An Efficient Signature Scheme from Bilinear Pairings and Its Applications

Zhang, Fangguo; Safavi–Naini, Reihaneh; Susilo, Willy

doi:10.1007/978-3-540-24632-9_20

Cited by 384 publications

(261 citation statements)

References 24 publications

Supporting

Mentioning

260

Contrasting

Unclassified

Order By: Relevance

“…When q = 1, Decision 1-BDHI is exactly the definition of Decision BDHI problem. It was also shown in [23] that DHI problem is equivalent to BDH problem. Obviously, Decision BDHI is a weaker version of Decision q-BDHI Problem when q > 1.…”

Section: Definition 4 (Dhi Problem) the Diffie-hellman Inversion (Dhmentioning

confidence: 98%

A New Hierarchical ID-Based Cryptosystem and CCA-Secure PKE

Zhang

Wang

2006

Emerging Directions in Embedded and Ubiquitous Computing

Self Cite

View full text Add to dashboard Cite

Abstract.A new hierarchical identity based (ID-based) cryptosystem is proposed, including hierarchical identity based encryption (HIBE) and signature (HIBS) schemes. The new HIBE scheme can be proved to be secure without relying on the random oracle model. Then, a new public key encryption (PKE) scheme is constructed based on the new HIBE. It is secure against adaptively chosen ciphertext attacks (IND-CCA) and has many attractive properties, such as efficient key generation, short private key, fast encryption, and etc. Performance of the new PKE scheme is better than all the previous PKE schemes converted from IBE, and is competitive with the best provably secure solutions to date. Furthermore, a new HIBS scheme is also constructed, which shares the same parameters with the new HIBE. The new HIBS scheme is more efficient than the previous HIBS.

show abstract

Section: Definition 4 (Dhi Problem) the Diffie-hellman Inversion (Dhmentioning

confidence: 98%

A New Hierarchical ID-Based Cryptosystem and CCA-Secure PKE

Zhang

Wang

2006

Emerging Directions in Embedded and Ubiquitous Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…The following assumption can be considered as a particular case of the poly-Diffie-Hellman assumption [23], or a generalization of the N +1-Exponent assumption introduced in [30].…”

Section: Assumptionsmentioning

confidence: 99%

“…In [30], the N -DHI assumption was shown to be equivalent to the N +1-Exponent assumption (N +1-DHE). We state here the following implication.…”

Section: Assumptionsmentioning

confidence: 99%

Fair Exchange of Short Signatures without Trusted Third Party

Camacho

2013

Topics in Cryptology – CT-RSA 2013

View full text Add to dashboard Cite

We propose a protocol to exchange Boneh-Boyen short signatures in a fair way and without relying on a trusted third party. Our protocol is quite practical and is the first of the sort to the best of our knowledge. Our construction uses a new non-interactive zero-knowledge (NIZK) argument to prove that a commitment is the encryption of a bit vector. We also design a NIZK argument to prove that a commitment to a bit vector v = (b1, b2, ..., bκ) is such that i∈[κ] bi2 i−1 = θ where θ is the discrete logarithm of some public value D = g θ . These arguments may be of independent interest.

show abstract

“…In this construction, partial private keys are signatures computed using a signature scheme independently considered in [11] and [33]. The NewFullCLE scheme is constructed on the Sakai-Kasahara IBE [26,14,15] which bears itself similarities with the second IBE scheme that was proved to be selective-ID secure [13,10] without random oracles by Boneh and Boyen [10].…”

Section: The Schemementioning

confidence: 99%

On Constructing Certificateless Cryptosystems from Identity Based Encryption

Libert

Quisquater

2006

Public Key Cryptography - PKC 2006

123

View full text Add to dashboard Cite

Abstract. Certificateless cryptography (CL-PKC) is a concept that aims at enjoying the advantages of identity based cryptography without suffering from its inherent key escrow. Several methods were recently suggested to generically construct a certificateless encryption (CLE) scheme by combining identity based schemes with ordinary public key cryptosystems. Whilst the security of one of these generic compositions was proved in a relaxed security model, we show that all them are insecure against chosen-ciphertext attacks in the strongest model of Al-Riyami and Paterson. We show how to easily fix these problems and give a method to achieve generic CLE constructions which are provably CCA-secure in the random oracle model. We finally propose a new efficient pairingbased scheme that performs better than previous proposals without precomputation. We also prove its security in the random oracle model.

show abstract

An Efficient Signature Scheme from Bilinear Pairings and Its Applications

Cited by 384 publications

References 24 publications

A New Hierarchical ID-Based Cryptosystem and CCA-Secure PKE

A New Hierarchical ID-Based Cryptosystem and CCA-Secure PKE

Fair Exchange of Short Signatures without Trusted Third Party

On Constructing Certificateless Cryptosystems from Identity Based Encryption

Contact Info

Product

Resources

About