A Practical Leakage-Resilient Signature Scheme in the Generic Group Model

Galindo, David; Vivek, S. Sree

doi:10.1007/978-3-642-35999-6_4

Cited by 37 publications

(94 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…paper [21,31] for detailed description). Based on this lemma, we can get the following result directly.…”

Section: Schwartz-zippel Lemmamentioning

confidence: 99%

“…Following the techniques of the papers [21,24], we split the singing key into two parts which stored in different parts of the memory. Then the signing process be divided into corresponding two phases.…”

Section: Security In the Presence Of Leakagementioning

confidence: 99%

“…Which means that designing algorithms such that their description already provides security against those attacks. Leakage-resilient cryptography is an increasingly active area in recent years and many leakage models have been proposed, such as only computation leaks information (OCLI) [19,21,27, 24], memory leakage [1,17], bounded retrieval [2,3,14], and auxiliary input models [15,21,20,34], etc. In this work, we design leakage-resilient signature schemes based on the following two leakage models:…”

Section: Introductionmentioning

confidence: 99%

“…It is more important that their scheme is very efficient, just less than a little time slower than the standard ElGamal scheme. Galindo and Vivek [21] then adapted their techniques (i.e., blinding the secret state) to construct a practical signature scheme based on the Boneh-Boyen IBE scheme [10]. Its efficiency is close to the non leakage-resilient one and it tolerates leakage of almost half of the bits of the secret key at every signature invocation.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we follow the techniques by Kiltz et al [24] and Galindo et al [21], construct two leakage-resilient signature schemes based on the OCLI and continual leakage models. They are provable leakage-resilience in the GBG model (the BLS-based one needs an additional random oracle for the proof).…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient Leakage-Resilient Signature Schemes in the Generic Bilinear Group Model

Tang

Niu

et al. 2014

Information Security Practice and Experience

View full text Add to dashboard Cite

Abstract. We extend the techniques of Kiltz et al. (in ASIACRYPT 2010) and Galindo et al. (in SAC 2012) to construct two efficient leakage-resilient signature schemes. Our schemes based on Boneh-LynnShacham (BLS) short signature and Waters signature schemes, respectively. Both of them are more efficient than Galindo et al.'s scheme, and can tolerate leakage of (1 − o (1))/2 of the secret key at every signature invocation. The security of the proposed schemes are proved in the generic bilinear group model (additionally, in our first scheme which based on the BLS short signature, a random oracle is needed for the proof).

show abstract

“…paper [21,31] for detailed description). Based on this lemma, we can get the following result directly.…”

Section: Schwartz-zippel Lemmamentioning

confidence: 99%

Section: Security In the Presence Of Leakagementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient Leakage-Resilient Signature Schemes in the Generic Bilinear Group Model

Tang

Niu

et al. 2014

Information Security Practice and Experience

View full text Add to dashboard Cite

show abstract

Cryptanalysis and improvement of the YAK protocol with formal security proof and security verification via Scyther

Mohammad

2020

Int J Communication

View full text Add to dashboard Cite

Hao proposed the YAK as a robust key agreement based on public-key authentication, and the author claimed that the YAK protocol withstands all known attacks and therefore is secure against an extremely strong adversary. However, Toorani showed the security flaws in the YAK protocol. This paper shows that the YAK protocol cannot withstand the known key security attack, and its consequences lead us to introduce a new key compromise impersonation attack, where an adversary is allowed to reveal both the shared static secret key between two-party participation and the ephemeral private key of the initiator party in order to mount this attack. In addition, we present a new security model that covers these attacks against an extremely strong adversary. Moreover, we propose an improved YAK protocol to remedy these attacks and the previous attacks mentioned by Toorani on the YAK protocol, and the proposed protocol uses a verification mechanism in its block design that provides entity authentication and key confirmation. Meanwhile, we show that the proposed protocol is secure in the proposed formal security model under the gap Diffie-Hellman assumption and the random oracle assumption. Moreover, we verify the security of the proposed protocol and YAK protocol by using an automatic verification method such as the Scyther tool, and the verification result shows that the security claims of the proposed protocol are proven, in contrast to those of the YAK protocol, which are not proven. The security and performance comparisons show that the improved YAK protocol outperforms previous related protocols. K E Y W O R D Sauthenticated key agreement, cryptanalysis, eCK, formal security model, key compromise impersonation, known key security, Scyther tool | INTRODUCTIONAs a result of the rapid development in the Internet of Things (IoT)-related applications in daily life, which uses diverse communication devices, securing data has become a more challenging task. Due to a diverse powerful adversary for revealing secret information from a party's participation via the open communication model, many formal security models and automated verification tools have been developed for finding security flaws in proposed new protocols before implementing them in applications. Consequently, secret key distribution and user authentication became the most important security issues in IoT. Nowadays, the security proof and verification process of an Authenticated Key Agreement (AKA) protocol in the formal security model is important for successful IoT applications.Diffie-Hellman (DH) key exchange protocol is a fundamental building block to distribute a shared secret key over an insecure communication model, 1 which is based on the concept of asymmetric cryptography. The shared secret key is used to provide confidentiality, integrity, nonrepudiation, and authenticity for data during transmission over an untrusted communication model. An AKA protocol is based on a public key, wherein the two intended participating parties exchange static and ephemeral ...

show abstract

Leakage‐resilient certificate‐based encryption

Zhang

2015

Security Comm Networks

View full text Add to dashboard Cite

Certificate-based encryption is a new cryptography primitive, which can be used to construct efficient public key infrastructure. However, side-channel attacks are not considered in certificate-based encryption. In order to capture these attacks, we formalize security model of certificate-based encryption with leakage resilience. Furthermore, we present a leakage-resilient certificate-based encryption (LR-CBE) scheme. To the best of our knowledge, this is the first LR-CBE scheme. Based on decision bilinear Diffie-Hellman assumption and decision generalized bilinear Diffie-Hellman assumption, we prove that our scheme is secure against adaptive chosen ciphertext attacks in the random oracle model. Our scheme includes a certificate-based key encapsulation algorithm and a symmetric encryption algorithm, where the encapsulated information is a symmetric key that is used to encrypt message. In order to obtain leakage-resilient property, two-source extractor is used to randomize the symmetric key. The designed scheme can resist entropy leakage. The performance analysis of leakage resilience shows that the relative leakage ratio almost amounts to 1.

show abstract

A Practical Leakage-Resilient Signature Scheme in the Generic Group Model

Cited by 37 publications

References 24 publications

Efficient Leakage-Resilient Signature Schemes in the Generic Bilinear Group Model

Efficient Leakage-Resilient Signature Schemes in the Generic Bilinear Group Model

Cryptanalysis and improvement of the YAK protocol with formal security proof and security verification via Scyther

Leakage‐resilient certificate‐based encryption

Contact Info

Product

Resources

About