A Forward-Secure Digital Signature Scheme

Bellare, Mihir; Miner, Sara K.

doi:10.1007/3-540-48405-1_28

Cited by 398 publications

(385 citation statements)

References 18 publications

Supporting

Mentioning

366

Contrasting

Unclassified

Order By: Relevance

“…The signature and key sizes do not depend on the total number of time periods. Moreover, comparing with the schemes [1,5,16], the signature size is shorter for the same security level since our scheme is operating over an elliptic curve (so in the security parameter k is different). The signing algorithm will be similar to that of [8] if we store the fixed part in the signature for later use.…”

Section: Discussionmentioning

confidence: 99%

“…Like almost other forward secure signature schemes, the definitions of our forward secure signature scheme follow the formal definition from [1,5].…”

Section: Backgroundsmentioning

confidence: 99%

“…The security of the signature scheme means that it is computational infeasible for any adversary to forge a signature with respect to any of the previously used secret keys even if the exposure of the current secret key happens. We use the security model introduced by Bellare and Miner [5] with some modification. In our model, besides knowing the user's public key P K, the adversary also gets to know the current time period.…”

Section: Definitionsmentioning

confidence: 99%

“…We analyze the security of our forward secure signature scheme used technique like in [1,5,15]. In addition, we assume that, partial key exposure also leads to key exposure problem.…”

Section: Security Analysismentioning

confidence: 99%

“…In [5], Bellare and Miner formalized Anderson's idea by the concepts of the forward secure signature scheme and presented their construction of this signature using a key evolution scheme. This construction is based on a binary tree model in which the total life time of the scheme is divided into a small period.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Yet Another Forward Secure Signature from Bilinear Pairings

Kim

2006

Information Security and Cryptology - ICISC 2005

View full text Add to dashboard Cite

Abstract. In this work, we have proposed yet another forward secure signature based on bilinear pairings. Our forward secure signature requires the general security parameters only independent to the total number of time periods. The scheme can perform key evolving for unlimited time periods while maintaining sizes of keys and signature fixed. In addition, the signing algorithm is very efficient with the simple verification algorithm. We also provide a formal definition along with a detailed security proof of our signature scheme under the assumption of Computational Diffie-Hellman problem.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Like almost other forward secure signature schemes, the definitions of our forward secure signature scheme follow the formal definition from [1,5].…”

Section: Backgroundsmentioning

confidence: 99%

Section: Definitionsmentioning

confidence: 99%

“…We analyze the security of our forward secure signature scheme used technique like in [1,5,15]. In addition, we assume that, partial key exposure also leads to key exposure problem.…”

Section: Security Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Yet Another Forward Secure Signature from Bilinear Pairings

Kim

2006

Information Security and Cryptology - ICISC 2005

View full text Add to dashboard Cite

show abstract

Authenticated key exchange with synchronized state

Yang

Guo

2014

Security Comm Networks

View full text Add to dashboard Cite

We study the problem on how to either prevent identity impersonation (IDI) attacks or limit its consequences by on‐line detecting previously unidentified IDI attacks, where IDI attacks are normally caused by the leakage of identity related long‐term key. Such problem has, up until now, lacked a provably good solution. We deal with this problem through the scenario on authenticated key exchange with synchronized state (AKESS). This work provides a security model for AKESS, in which we particularly formalize the security of synchronized state based on indistinguishability. We propose a two party execution state synchronization framework for symmetric case, based on which we propose a generic compiler for AKESS protocols. Our goal is to transform any existing passively secure KE protocols to AKESS protocols using synchronized state, without any modification on those KE protocols. The new generic compiler is probably secure in the standard model under standard assumptions. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

PyTHIA: Towards Anonymity in Authentication

Gritzalis

Moulinos

Iliadis

et al. 2001

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

There is a scale between authentication and anonymity, which is currently leaning towards the side of authentication, when it comes to e-commerce. Service providers and merchants are usually keeping track of user-related information in order to construct behavioural profiles of their customers. Service providers and merchants also correlate profiles of this kind, stemming from different sources, in order to increase their profit. This correlation is usually performed with the use of Unified Codes. Authentication, confidentiality, integrity, authentication, and non-repudiation are necessary functionalities for enabling e-commerce. Most of the currently used mechanisms that support these services do not provide anonymity. This paper presents PyTHIA, a mechanism, which is based on the use of Message Digest Algorithms and the intermediation of Trusted Third Parties in order to provide anonymity to e-commerce users who have to authenticate themselves in order to access services or buy goods from service providers and merchants respectively. With PyTHIA e-commerce users are able to authenticate without giving away any personal data and without using Unified Codes. In addition, PyTHIA ensures that service providers and merchants can effectively trace a customer in case he behaves maliciously.

show abstract

A Forward-Secure Digital Signature Scheme

Cited by 398 publications

References 18 publications

Yet Another Forward Secure Signature from Bilinear Pairings

Yet Another Forward Secure Signature from Bilinear Pairings

Authenticated key exchange with synchronized state

PyTHIA: Towards Anonymity in Authentication

Contact Info

Product

Resources

About