Construction and Applications of Identity-Based Encryption without Pairings∗
نویسنده
چکیده
منابع مشابه
An Efficient ID-KEM Based On The Sakai-Kasahara Key Construction
Sakai et. al in 2000 produced a method of construction identity based public/private key pairs using pairings on elliptic curves. In 2001, using the same key construction as Sakai et. al., Boneh and Franklin presented the first efficient and provably secure identity-based encryption scheme. In 2003 Sakai and Kasahara proposed another method of constructing identity based keys, also using pairin...
متن کاملPairing-Based Cryptography: Past, Present, and Future
While pairings were first introduced in cryptography as a tool to attack the discrete-log problem on certain elliptic curves, they have since found numerous applications in the construction of cryptographic systems. To this day many problems can only be solved using pairings. A few examples include collusionresistant broadcast encryption and traitor tracing with short keys, 3-way DiffieHellman,...
متن کاملIdentity-Based Encryption from the Diffie-Hellman Assumption
We provide the first constructions of identity-based encryption and hierarchical identitybased encryption based on the hardness of the (Computational) Diffie-Hellman Problem (without use of groups with pairings) or Factoring. Our construction achieves the standard notion of identity-based encryption as considered by Boneh and Franklin [CRYPTO 2001]. We bypass known impossibility results using g...
متن کاملGeneric Constructions of Biometric Identity Based Encryption Systems
In this paper, we present a novel framework for the generic construction of biometric Identity Based Encryption (IBE) schemes, which do not require bilinear pairings and result in more efficient schemes than existing fuzzy IBE systems implemented for biometric identities. Also, we analyze the security properties that are specific to biometric IBE namely anonymity and identity privacy. Consideri...
متن کامل(Anonymous) Fully Secure Constant-Size Ciphertext HIBE From Type-3 Pairings
This paper takes a comprehensive look at hierarchical identity-based encryption (HIBE) schemes with constant-size ciphertexts which provide desirable provable guarantees and can be implemented using the most efficient bilinear pairings, namely, Type-3 pairings. Our work results in six new HIBE schemes. The first construction, DPVS-HIBE , is obtained by extending the IBE scheme of Chen et.al. Th...
متن کامل