Generalized Identity Based and Broadcast Encryption Schemes

Boneh, Dan; Hamburg, Mike

doi:10.1007/978-3-540-89255-7_28

Cited by 162 publications

(189 citation statements)

References 17 publications

Supporting

Mentioning

187

Contrasting

Unclassified

Order By: Relevance

“…The new protocol allows an adversary to adaptively choose his targets, and it offers the key secrecy, known-key security and partial forward secrecy properties. This design is also readily adaptable to provide broadcast encryption [7,15].…”

Section: Resultsmentioning

confidence: 99%

Identity-Based Authenticated Asymmetric Group Key Agreement Protocol

Zhang

Qin

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In identity-based public-key cryptography, an entity's public key can be easily derived from its identity. The direct derivation of public keys in identity-based public-key cryptography eliminates the need for certificates and solves certain public key management problems in traditional public-key cryptosystems. Recently, the notion of asymmetric group key agreement was introduced, in which the group members merely negotiate a common encryption key which is accessible to any entity, but they hold respective secret decryption keys. In this paper, we first propose a security model for identity-based authenticated asymmetric group key agreement (IB-AAGKA) protocols. We then propose an IB-AAGKA protocol which is proven secure under the Bilinear Diffie-Hellman Exponent assumption. Our protocol is also efficient, and readily adaptable to provide broadcast encryption.

show abstract

Section: Resultsmentioning

confidence: 99%

Identity-Based Authenticated Asymmetric Group Key Agreement Protocol

Zhang

Qin

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…the distribution R W IBE . However, as a future direction, it would be interesting to explore whether there exist HIBE schemes that are IND-sCR-CPA-secure according to the most generic notion, i.e., without any restriction on R. Perhaps more interestingly, the resulting primitive could be seen as the dual version of the notion of Spatial Encryption proposed by Boneh and Hamburg in [14]. In Spatial Encryption, ciphertexts are associated to points in Z p , while secret keys correspond to affine subspaces of Z p .…”

Section: Future Directionsmentioning

confidence: 99%

From Selective to Full Security: Semi-generic Transformations in the Standard Model

Abdalla

Fiore

Lyubashevsky

2012

Public Key Cryptography – PKC 2012

View full text Add to dashboard Cite

In this paper, we propose an efficient, standard model, semi-generic transformation of selectivesecure (Hierarchical) Identity-Based Encryption schemes into fully secure ones. The main step is a procedure that uses admissible hash functions (whose existence is implied by collision-resistant hash functions) to convert any selective-secure wildcarded identity-based encryption (WIBE) scheme into a fully secure (H)IBE scheme. Since building a selective-secure WIBE, especially with a selective-secure HIBE already in hand, is usually much less involved than directly building a fully secure HIBE, this transform already significantly simplifies the latter task. This black-box transformation easily extends to schemes secure in the Continual Memory Leakage (CML) model of Brakerski et al. (FOCS 2010), which allows us obtain a new fully secure IBE in that model. We furthermore show that if a selective-secure HIBE scheme satisfies a particular security notion, then it can be generically transformed into a selective-secure WIBE. We demonstrate that several current schemes already fit this new definition, while some others that do not obviously satisfy it can still be easily modified into a selective-secure WIBE.

show abstract

“…In a BE scheme [FN94,YFDL04,BGW05,BH08,PPS11,BWZ14] there is a set of n users, and for any given subset S ⊆ {1, . .…”

Section: Introductionmentioning

confidence: 99%

Constrained PRFs for Unbounded Inputs

Abusalah

Fuchsbauer

Pietrzak

2016

Topics in Cryptology - CT-RSA 2016

View full text Add to dashboard Cite

A constrained pseudorandom function F : K ×X → Y for a family T ⊆ 2 X of subsets of X is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a constrained key k S which allows to evaluate F (k, ·) on all inputs x ∈ S, while even given this key, the outputs on all inputs x / ∈ S look random. At Asiacrypt'13 Boneh and Waters gave a construction which supports the most general set family so far. Its keys k C are defined for sets decided by boolean circuits C and enable evaluation of the PRF on any x ∈ X where C(x) = 1. In their construction the PRF input length and the size of the circuits C for which constrained keys can be computed must be fixed beforehand during key generation.We construct a constrained PRF that has an unbounded input length and whose constrained keys can be defined for any set recognized by a Turing machine. The only a priori bound we make is on the description size of the machines. We prove our construction secure assuming public-coin differing-input obfuscation.As applications of our constrained PRF we build a broadcast encryption scheme where the number of potential receivers need not be fixed at setup (in particular, the length of the keys is independent of the number of parties) and the first identity-based non-interactive key exchange protocol with no bound on the number of parties that can agree on a shared key.

show abstract

Generalized Identity Based and Broadcast Encryption Schemes

Cited by 162 publications

References 17 publications

Identity-Based Authenticated Asymmetric Group Key Agreement Protocol

Identity-Based Authenticated Asymmetric Group Key Agreement Protocol

From Selective to Full Security: Semi-generic Transformations in the Standard Model

Constrained PRFs for Unbounded Inputs

Contact Info

Product

Resources

About