Space-Efficient Identity Based EncryptionWithout Pairings

Boneh, Dan; Gentry, Craig; Hamburg, Mike

doi:10.1109/focs.2007.4389533

Cited by 77 publications

(79 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Anonymity is a useful property in many applications, such as fully private communication [7] and searching on encrypted data [1,11]. While there are a few anonymous (non-hierarchical) IBEs [10,13,19,24], only one other HIBE is known to be anonymous [15].…”

Section: Our Resultsmentioning

confidence: 99%

“…However, there are no trapdoor functions per se in pairing-based constructions; instead, the pairing is used to facilitate key agreement between the encrypter and decrypter. Our approach, therefore, may be seen as a blending of pairing-based techniques and the trapdoor techniques found in [13,18,24].…”

Section: Related Techniques and Workmentioning

confidence: 99%

“…(IBE is a powerful cryptographic primitive in which any string can serve as a public key [50]. ) Abstractly, the GPV schemes are structurally quite similar to Rabin/Rabin-Williams signatures [47] (based on integer factorization) and the Cocks/Boneh-Gentry-Hamburg IBEs [13,18] (based on the quadratic residuosity problem), in that they all employ a so-called "preimage sampleable" trapdoor function as a basic primitive. As a result, they have so far required the random oracle model (or similar heuristics) for their security analysis.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Bonsai Trees, or How to Delegate a Lattice Basis

Cash¹,

et al. 2011

View full text Add to dashboard Cite

We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include an efficient, stateless 'hash-and-sign' signature scheme in the standard model (i.e., no random oracles), and the first hierarchical identity-based encryption (HIBE) scheme (also in the standard model) that does not rely on bilinear pairings. Interestingly, the abstract properties of bonsai trees seem to have no known realization in conventional number-theoretic cryptography.

show abstract

Section: Our Resultsmentioning

confidence: 99%

Section: Related Techniques and Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Bonsai Trees, or How to Delegate a Lattice Basis

Cash¹,

et al. 2011

View full text Add to dashboard Cite

show abstract

“…12 In the case of IKIG, the figure of 1.9 kilobits refers to the encrypted pre-master secret and the signed message in our key agreement protocol. 13 This clearly shows that an execution of the TLS protocol in the GSI is significantly more costly than our protocol in IKIG in terms of bandwidth requirements.…”

Section: Communication Costsmentioning

confidence: 89%

“…For example, the sizes of a nonce and cipher_suite in the ClientHello message are merely 28 and 2 bytes, respectively [19]. 13 Similarly, we assume ServerIdentifier and ClientIdentifier are small fields which can be ignored in our calculation. public keys are predictable and are easy to construct by entities within the VO, provided that they have the correct system parameters.…”

Section: Qualitative Benefitsmentioning

confidence: 99%

Identity-based cryptography for grid security

Lim

Paterson

2010

Int. J. Inf. Secur.

View full text Add to dashboard Cite

The majority of current security architectures for grid systems use public key infrastructure (PKI) to authenticate identities of grid members and to secure resource allocation to these members. Identity-based cryptography (IBC) has some attractive properties that seem to align well with the demands of grid computing. This paper presents a comprehensive investigation into the use of identity-based techniques to provide an alternative grid security architecture. We propose a customised identity-based key agreement protocol, which fits nicely with the grid security infrastructure (GSI). We also present a delegation protocol, which is simpler and more efficient than existing delegation methods. Our study shows that properties of IBC can be exploited to provide grid security services in a more natural and clean way than more conventional public key cryptosystems, such as RSA.

show abstract

Cryptanalysis of an identity‐based authenticated key exchange protocol

Hatri

Otmani

Guenda

2017

Int J Communication

View full text Add to dashboard Cite

Authenticated Key Exchange (AKE) protocols represent an important cryptographic mechanism that enables several parties to communicate securely over an open network. Elashry, Mu and Susilo proposed an Identity Based Authenticated Key Exchange (IBAKE) protocol where different parties establish secure communication by means of their public identities.The authors also introduced a new security notion for IBAKE protocols called resiliency, that is, if the secret shared key is compromised, the entities can generate another shared secret key without establishing a new session between them. They then claimed that their IBAKE protocol satisfies this security notion.We analyze the security of their protocol and prove that it has a major security flaw which renders it insecure against an impersonation attack. We also disprove the resiliency property of their scheme by proposing an attack where an adversary can compute any share secret key if just one secret bit is leaked.

show abstract

Space-Efficient Identity Based EncryptionWithout Pairings

Cited by 77 publications

References 57 publications

Bonsai Trees, or How to Delegate a Lattice Basis

Bonsai Trees, or How to Delegate a Lattice Basis

Identity-based cryptography for grid security

Cryptanalysis of an identity‐based authenticated key exchange protocol

Contact Info

Product

Resources

About