Article

Efficient identity-based encryption without random oracles

Author:

Brent WatersAuthors Info & Claims

EUROCRYPT'05: Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Pages 114 - 127

https://doi.org/10.1007/11426639_7

Published: 22 May 2005 Publication History

Abstract

We present the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles. We first present our IBE construction and reduce the security of our scheme to the decisional Bilinear Diffie-Hellman (BDH) problem. Additionally, we show that our techniques can be used to build a new signature scheme that is secure under the computational Diffie-Hellman assumption without random oracles.

References

[1]

Dan Boneh and Xavier Boyen. Efficient selective-id secure identity based encryption without random oracles. In Proceedings of the International Conference on Advances in Cryptology (EUROCRYPT '04), Lecture Notes in Computer Science. Springer Verlag, 2004.

[2]

Dan Boneh and Xavier Boyen. Secure identity based encryption without random oracles. In Proceedings of the Advances in Cryptology (CRYPTO '04), 2004.

[3]

Dan Boneh and Xavier Boyen. Short signatures without random oracles. In Advances in Cryptology--EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 56-73. Berlin: Springer-Verlag, 2004.

[4]

Dan Boneh and Matthew K. Franklin. Identity-based encryption from the weil pairing. In Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, pages 213-229. Springer-Verlag, 2001.

Digital Library

[5]

Dan Boneh and Matthew K. Franklin. Identity-based encryption from the weil pairing. SIAM J. Comput., 32(3):586-615, 2003.

Digital Library

[6]

Dan Boneh and Jonathan Katz. Improved efficiency for cca-secure cryptosystems built using identity based encryption. In In Proceedings of RSA-CT 2005, 2005.

Digital Library

[7]

Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the weil pairing. In ASIACRYPT '01: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, pages 514-532. Springer-Verlag, 2001.

Digital Library

[8]

Dan Boneh, Ilya Mironov, and Victor Shoup. A secure signature scheme from bilinear maps. In CT-RSA, pages 98-110, 2003.

Digital Library

[9]

Ran Canetti, Shai Halevi, and Jonathan Katz. A forward-secure public-key encryption scheme. In Proceedings of Eurocrypt 2003. Springer-Verlag, 2003.

Digital Library

[10]

Ran Canetti, Shai Halevi, and Jonathan Katz. Chosen-ciphertext security from identity-based encryption. In Proceedings of Eurocrypt 2004. Springer-Verlag, 2004.

[11]

Ronald Cramer and Victor Shoup. Signature schemes based on the strong rsa assumption. ACM Trans. Inf. Syst. Secur., 3(3):161-185, 2000.

Digital Library

[12]

Rosario Gennaro, Shai Halevi, and Tal Rabin. Secure hash-and-sign signatures without the random oracle. Lecture Notes in Computer Science, 1592:123++, 1999.

Digital Library

[13]

Craig Gentry and Alice Silverberg. Hierarchical id-based cryptography. In Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security, pages 548-566. Springer-Verlag, 2002.

Digital Library

[14]

Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17(2):281-308, 1988.

Digital Library

[15]

Jeremy Horwitz and Ben Lynn. Toward hierarchical identity-based encryption. In Advances in Cryptology: EUROCRYPT 2002, pages 466-481, 2002.

Digital Library

[16]

Adi Shamir. Identity-based cryptosystems and signature schemes. In Proceedings of CRYPTO 84 on Advances in cryptology, pages 47-53. Springer-Verlag New York, Inc., 1985.

Digital Library

Cited By

Jiang YJiang JZhang GSong JWang W(2024)A Secure Enhancement Scheme for Interworking Privacy-Preserving Multi-Party Collaborative ModelingProceedings of the International Conference on Computing, Machine Learning and Data Science10.1145/3661725.3661762(1-4)Online publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1145/3661725.3661762
Xu SCao YChen XGuo YYang YGuo FYiu SSerra ESpezzano F(2024)Post-Quantum Searchable Encryption Supporting User-Authorization for Outsourced Data ManagementProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679522(2702-2711)Online publication date: 21-Oct-2024
https://dl.acm.org/doi/10.1145/3627673.3679522
Li CChen RWang YXing QWang B(2024)REEDS: An Efficient Revocable End-to-End Encrypted Message Distribution System for IoTIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.335381121:5(4526-4542)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1109/TDSC.2024.3353811
Show More Cited By

Efficient identity-based encryption without random oracles

Recommendations

Efficient Selective Identity-Based Encryption Without Random Oracles

We construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map. Selective-identity secure IBE is a slightly weaker security model than ...
Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles

Broadcast encryption provides a method of secure multi-receiver communications, where a broadcaster can encrypt a message for a set S of users who are listening to a broadcast channel. Most identity-based broadcast encryption (IBBE) schemes are not ...
Secure public-key encryption scheme without random oracles

Since the first practical and secure public-key encryption scheme without random oracles proposed by Cramer and Shoup in 1998, Cramer-Shoup's scheme and its variants remained the only practical and secure public-key encryption scheme without random ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

EUROCRYPT'05: Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

May 2005

574 pages

ISBN:3540259104

Editor:
Ronald Cramer
CWI Amsterdam, The Netherlands

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 May 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

627
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jiang YJiang JZhang GSong JWang W(2024)A Secure Enhancement Scheme for Interworking Privacy-Preserving Multi-Party Collaborative ModelingProceedings of the International Conference on Computing, Machine Learning and Data Science10.1145/3661725.3661762(1-4)Online publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1145/3661725.3661762
Xu SCao YChen XGuo YYang YGuo FYiu SSerra ESpezzano F(2024)Post-Quantum Searchable Encryption Supporting User-Authorization for Outsourced Data ManagementProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679522(2702-2711)Online publication date: 21-Oct-2024
https://dl.acm.org/doi/10.1145/3627673.3679522
Li CChen RWang YXing QWang B(2024)REEDS: An Efficient Revocable End-to-End Encrypted Message Distribution System for IoTIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.335381121:5(4526-4542)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1109/TDSC.2024.3353811
Chu QChen J(2024)Tightly secure (H)IBE in the random oracle modelTheoretical Computer Science10.1016/j.tcs.2024.1146741007:COnline publication date: 29-Jul-2024
https://dl.acm.org/doi/10.1016/j.tcs.2024.114674
Liu ZMambo MTso RTseng Y(2024)Anonymous hierarchical identity-based encryption with delegated traceability for cloud-based data sharing systemsComputer Standards & Interfaces10.1016/j.csi.2023.10381789:COnline publication date: 25-Jun-2024
https://dl.acm.org/doi/10.1016/j.csi.2023.103817
Das SRen L(2024)Adaptively Secure BLS Threshold Signatures from DDH and co-CDHAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68394-7_9(251-284)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68394-7_9
Zhu ZLi JZhang KGong JQian H(2024)Registered Functional Encryptions from PairingsAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58723-8_13(373-402)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-58723-8_13
Bauer BFuchsbauer GRegen F(2024)On Proving Equivalence Class Signatures Secure from Non-interactive AssumptionsPublic-Key Cryptography – PKC 202410.1007/978-3-031-57718-5_1(3-36)Online publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57718-5_1
Glaeser NKolonelos DMalavolta GRahimi AMeng WJensen CCremers CKirda E(2023)Efficient Registration-Based EncryptionProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3616596(1065-1079)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3616596
Katsumata SReichle MSakai Y(2023)Practical Round-Optimal Blind Signatures in the ROM from Standard AssumptionsAdvances in Cryptology – ASIACRYPT 202310.1007/978-981-99-8724-5_12(383-417)Online publication date: 4-Dec-2023
https://dl.acm.org/doi/10.1007/978-981-99-8724-5_12
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents