Signature Schemes with Bounded Leakage Resilience

  • Jonathan Katz
  • Vinod Vaikuntanathan
Conference paper

DOI: 10.1007/978-3-642-10366-7_41

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5912)
Cite this paper as:
Katz J., Vaikuntanathan V. (2009) Signature Schemes with Bounded Leakage Resilience. In: Matsui M. (eds) Advances in Cryptology – ASIACRYPT 2009. ASIACRYPT 2009. Lecture Notes in Computer Science, vol 5912. Springer, Berlin, Heidelberg

Abstract

A leakage-resilient cryptosystem remains secure even if arbitrary, but bounded, information about the secret key (and possibly other internal state information) is leaked to an adversary. Denote the length of the secret key by n. We show:
  • A full-fledged signature scheme tolerating leakage of n − nε bits of information about the secret key (for any constant ε> 0), based on general assumptions.

  • A one-time signature scheme, based on the minimal assumption of one-way functions, tolerating leakage of \((\frac{1}{4}-\epsilon) \cdot n\) bits of information about the signer’s entire state.

  • A more efficient one-time signature scheme, that can be based on several specific assumptions, tolerating leakage of \((\frac{1}{2}-\epsilon) \cdot n\) bits of information about the signer’s entire state.

The latter two constructions extend to give leakage-resilient t-time signature schemes. All the above constructions are in the standard model.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jonathan Katz
    • 1
  • Vinod Vaikuntanathan
    • 2
  1. 1.University of Maryland 
  2. 2.IBM Research 

Personalised recommendations