Paper published in a book (Scientific congresses, symposiums and conference proceedings)
A Leakage-Resilient Pairing-Based Variant of the Schnorr Signature Scheme
Galindo, David; Venkatesh, Srinivas Vivek
2013In Stam, Martijn (Ed.) Cryptography and Coding
Peer reviewed
 

Files


Full Text
schnorr-IMACC13-final.pdf
Author postprint (425.57 kB)
Download

The final publication is available at www.springerlink.com.


All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Digital signatures; generic group model; leakage-resilient cryptography; continual leakage; efficiency; min-entropy
Abstract :
[en] Leakage-resilient cryptography aims at capturing side-channel attacks within the provable security framework. Currently there exists a plethora of schemes with provably secure guarantees against a variety of side-channel attacks. However, meeting the strongest security levels (resilience against continual leakage attacks) under the weakest assumptions leads currently to costly schemes. Additionally, recent results show the impossibility to achieve the strongest leakage-resilient security levels for cryptosystems whose secret key is uniquely determined by its public key. The above justifies the use of stronger assumptions to achieve simpler, more efficient schemes, since most deployed and practical cryptosystems satisfy the above-mentioned uniqueness of the secret key property. In particular, the Schnorr-based leakage-resilient digital signature schemes proposed up to now are built by gluing together ℓ-copies of the basic signature scheme, resulting in a public key that admits exponentially-many secret keys. Furthermore, the space needed to store the secret key material is proportional to the leakage tolerated by these schemes. We aim at designing a leakage-resilient variant of the Schnorr signature scheme whose secret key’s storage space is constant, independently of the amount of leakage that it can tolerate. We assume that at any given time only the parts of the memory in use leak (split-state/only computation leaks information model); we ease the problem of exhibiting a security reduction by relying on generic groups (generic bilinear group model). We proceed by first proposing a pairing analogue of the Schnorr signature scheme, that we next transform to include split signing key updates. We give a leakage-resilience lower bound in generic bilinear groups against continual leakage attacks for the new scheme.
Disciplines :
Computer science
Author, co-author :
Galindo, David ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) ; CNRS/LORIA, Nancy, France
Venkatesh, Srinivas Vivek ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
External co-authors :
yes
Language :
English
Title :
A Leakage-Resilient Pairing-Based Variant of the Schnorr Signature Scheme
Publication date :
2013
Event name :
FOURTEENTH IMA INTERNATIONAL CONFERENCE ON CRYPTOGRAPHY AND CODING
Event place :
Oxford, United Kingdom
Event date :
17-12-2013 to 19-12-2013
Audience :
International
Main work title :
Cryptography and Coding
Editor :
Stam, Martijn
Publisher :
Springer
ISBN/EAN :
978-3-642-45238-3
Collection name :
Lecture Notes in Computer Science, Volume 8308
Pages :
173-192
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 31 August 2015

Statistics


Number of views
51 (1 by Unilu)
Number of downloads
222 (1 by Unilu)

Scopus citations®
 
4
Scopus citations®
without self-citations
2
OpenCitations
 
2

Bibliography


Similar publications



Contact ORBilu