SIAM Journal on Computing · 2003 · 3.6K citations · 14 references
ComputingComputer EngineeringComputer ScienceComputer SecurityCryptographySecurity ProtocolsAuthenticated EncryptionCryptographic AlgorithmsCryptographic ProtocolsElliptic Curve CryptographyIdentity-based CryptographyKey Exchange ProtocolsBilinear FormsChosen-ciphertext SecurityElliptic Curve PairingsIdentity-based EncryptionIdentity-based Encryption From Bilinear MapsPairing-based CryptographyRandom Oracle Model
The Weil pairing on elliptic curves is an example of the bilinear map underlying the scheme. The authors propose a fully functional identity‑based encryption scheme and define secure IBE schemes with multiple applications. The scheme is built on bilinear maps between groups, achieves chosen‑ciphertext security in the random‑oracle model, and relies on a variant of the computational Diffie–Hellman problem. The authors present precise definitions of secure IBE schemes and illustrate several practical applications.
We propose a fully functional identity-based encryption (IBE) scheme. The scheme has chosen ciphertext security in the random oracle model assuming a variant of the computational Diffie--Hellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic curves is an example of such a map. We give precise definitions for secure IBE schemes and give several applications for such systems.
14
Handbook of applied cryptography
Choice Reviews Online · 1997 · 10.5K citations · Full text
Mihir Bellare, Phillip Rogaway · 1993 · 4.7K citations · Full text
Shafi Goldwasser, Silvio Micali · Journal of Computer and System Sciences · 1984 · 2.6K citations
Zero-knowledge proofs of identity
Uriel Feige, Amos Fiat, Adi Shamir · Journal of Cryptology · 1988 · 1K citations · Full text