More Web Proxy on the site http://driver.im/

Article

Improved efficiency for CCA-secure cryptosystems built using identity-based encryption

Authors:

Jonathan KatzAuthors Info & Claims

CT-RSA'05: Proceedings of the 2005 international conference on Topics in Cryptology

Pages 87 - 103

https://doi.org/10.1007/978-3-540-30574-3_8

Published: 14 February 2005 Publication History

Abstract

Recently, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure encryption schemes from identity-based encryption schemes in the standard model. We improve the efficiency of their construction, and show two specific instantiations of our resulting scheme which offer the most efficient encryption (and, in one case, key generation) of any CCA-secure encryption scheme to date.

References

[1]

M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations Among Notions of Security for Public-Key Encryption Schemes. Adv. in Cryptology - Crypto 1998, LNCS vol. 1462, Springer-Verlag, pp. 26-45, 1998.

[2]

M. Bellare and P. Rogaway. Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. First ACM Conf. on Computer and Comm. Security, ACM, pp. 62-73, 1993.

[3]

D. Bleichenbacher. Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS#1. Adv. in Cryptology - Crypto 1998, LNCS vol. 1462, Springer-Verlag, pp. 1-12, 1998.

[4]

M. Blum, P. Feldman, and S. Micali. Non-Interactive Zero-Knowledge and its Applications. 20th ACM Symposium on Theory of Computing (STOC), ACM, pp. 103-112, 1988.

[5]

D. Boneh and X. Boyen. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles. Adv. in Cryptology - Eurocrypt 2004, LNCS vol. 3027, Springer-Verlag, pp. 223-238, 2004. Full version available from http://eprint.iacr.org/2004/172

[6]

D. Boneh and X. Boyen. Secure Identity Based Encryption Without Random Oracles. Adv. in Cryptology - Crypto 2004, LNCS vol. 3152, Springer-Verlag, pp. 443-459, 2004.

[7]

D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. Adv. in Cryptology - Crypto 2001, LNCS vol. 2139, Springer-Verlag, pp. 213-229, 2001. Full version in SIAM J. Computing 32(3): 586-615, 2003 and available from http://crypto.stanford.edu/~dabo/pubs.html

[8]

R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. 42nd IEEE Symp. on Foundations of Computer Science (FOCS), IEEE, pp. 136-145, 2001. Full version available at http://eprint.iacr.org/2000/067/

[9]

R. Canetti, O. Goldreich, and S. Halevi. The Random Oracle Methodology, Revisited. 30th ACM Symp. on Theory of Computing (STOC), ACM, pp. 209-218, 1998.

[10]

R. Canetti, S. Halevi, and J. Katz. A Forward-Secure Public-Key Encryption Scheme. Adv. in Cryptology - Eurocrypt 2003, LNCS vol. 2656, Springer-Verlag, pp. 255-271, 2003. Full version available at http://eprint.iacr.org/2003/083

[11]

R. Canetti, S. Halevi, and J. Katz. Chosen-Ciphertext Security from Identity-Based Encryption. Adv. in Cryptology - Eurocrypt 2004, LNCS vol. 3027, Springer-Verlag, pp. 207-222, 2004.

[12]

C. Cocks. An Identity-Based Encryption Scheme Based on Quadratic Residues. Cryptography and Coding, LNCS vol. 2260, Springer-Verlag, pp. 360-363, 2001.

[13]

R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure Against Chosen Ciphertext Attack. Adv. in Cryptology - Crypto 1998, LNCS vol. 1462, Springer-Verlag, pp. 13-25, 1998.

[14]

R. Cramer and V. Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. Adv. in Cryptology - Eurocrypt 2002, LNCS vol. 2332, Springer-Verlag, pp. 45-64, 2002.

[15]

J. Camenisch and V. Shoup. Practical Verifiable Encryption and Decryption of Discrete Logarithms. Adv. in Cryptology - Crypto 2003, LNCS vol. 2729, Springer-Verlag, pp. 126-144, 2003.

[16]

I. Damgård, T.P. Pedersen, and B. Pfitzmann. On the Existence of Statistically-Hiding Bit Commitment Schemes and Fail-Stop Signatures. Adv. in Cryptology - Crypto 1993, LNCS vol. 773, Springer-Verlag, pp. 250-265, 1993.

[17]

D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography. SIAM J. Computing 30(2): 391-437, 2000.

[18]

U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Under General Assumptions. SIAM J. Computing 29(1): 1-28, 1999.

[19]

R. Gennaro and Y. Lindell. A Framework for Password-Based Authenticated Key Exchange. Adv. in Cryptology - Eurocrypt 2003, LNCS vol. 2656, Springer-Verlag, pp. 524-543, 2003.

[20]

S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure against Adaptive Chosen-Message Attacks. SIAM J. Computing 17(2): 281-308, 1988.

[21]

S. Halevi and S. Micali. Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. Adv. in Cryptology - Crypto 1996, LNCS vol. 1109, Springer-Verlag, pp. 201-215, 1996.

[22]

J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. Construction of a Pseudorandom Generator from any One-Way Function. SIAM J. Comp. 28(4): 1364-1396, 1999.

[23]

N. Howgrave-Graham, P. Q. Nguyen, D. Pointcheval, J. Proos, J. H. Silverman, A. Singer, and W. Whyte. The Impact of Decryption Failures on the Security of NTRU Encryption. Adv. in Cryptology - Crypto 2003, LNCS vol. 2729, Springer-Verlag, pp. 226-246, 2003.

[24]

M. Joye, J.-J. Quisquater, and M. Yung. On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC. Cryptographers' Track - RSA 2001, LNCS vol. 2020, Springer-Verlag, pp. 208-222, 2001.

[25]

K. Kurosawa and Y. Desmedt. A New Paradigm of Hybrid Encryption Scheme. Adv. in Cryptology - Crypto 2004, LNCS vol. 3152, Springer-Verlag, pp. 426-442, 2004.

[26]

L. Lamport. Constructing Digital Signatures from a One-Way Function. Technical Report CSL-98, SRI International, 1978.

[27]

Y. Lindell. A Simpler Construction of CCA-Secure Public-Key Encryption Under General Assumptions. Adv. in Cryptology - Eurocrypt 2003, LNCS vol. 2656, Springer-Verlag, pp. 241-254, 2003.

[28]

M. Naor and M. Yung. Universal One-Way Hash Functions and Their Cryptographic Applications. 21st ACM Symposium on Theory of Computing (STOC), ACM, pp. 33-43, 1989.

[29]

C. Rackoff and D. Simon. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. Adv. in Cryptology - Crypto 1991, LNCS vol. 576, Springer-Verlag, pp. 433-444, 1992.

[30]

A. Sahai. Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. 40th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 543-553, 1999.

[31]

A. Shamir. Identity-Based Cryptosystems and Signature Schemes. Adv. in Cryptology - Crypto 1984, LNCS vol. 196, Springer-Verlag, pp. 47-53, 1985.

[32]

V. Shoup. Why Chosen Ciphertext Security Matters. IBM Research Report RZ 3076, November, 1998. Available at http://www.shoup.net/papers.

[33]

V. Shoup. Using Hash Functions as a Hedge Against Chosen Ciphertext Attack. Adv. in Cryptology - Eurocrypt 2000, LNCS vol. 275-288, Springer-Verlag, pp. 1807, 2000.

[34]

B. Waters. Efficient Identity-Based Encryption Without Random Oracles. Available at http://eprint.iacr.org/2004/180

[35]

M.N. Wegman and J.L. Carter. New Hash Functions and Their Use in Authentication and Set Equality. J. Computer System Sciences 22(3): 265-279, 1981.

Cited By

Yi XHao FBertino E(2022)ID-Based Two-Server Password-Authenticated Key ExchangeComputer Security - ESORICS 201410.1007/978-3-319-11212-1_15(257-276)Online publication date: 10-Mar-2022
https://dl.acm.org/doi/10.1007/978-3-319-11212-1_15
Beskorovajnov WGröll RMüller-Quade JOttenhues ASchwerdt R(2022)A New Security Notion for PKC in the Standard Model: Weaker, Simpler, and Still Realizing Secure ChannelsPublic-Key Cryptography – PKC 202210.1007/978-3-030-97131-1_11(316-344)Online publication date: 8-Mar-2022
https://dl.acm.org/doi/10.1007/978-3-030-97131-1_11
Xagawa K(2021)The Boneh-Katz Transformation, Revisited: Pseudorandom/Obliviously-Samplable PKE from Lattices and Codes and Its ApplicationSelected Areas in Cryptography10.1007/978-3-030-99277-4_3(47-67)Online publication date: 29-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-99277-4_3
Show More Cited By

Improved efficiency for CCA-secure cryptosystems built using identity-based encryption

Recommendations

Post-challenge leakage in public-key encryption

When an adversary can measure the physical memory storing the decryption key, decryption functionality often comes in handy. Halevi and Lin (TCC'11) studied after-the-fact (or post-challenge) leakage in public-key encryption (PKE), in which an adversary ...
Chosen-Ciphertext Security from Identity-Based Encryption

We propose simple and efficient CCA-secure public-key encryption schemes (i.e., schemes secure against adaptive chosen-ciphertext attacks) based on any identity-based encryption (IBE) scheme. Our constructions have ramifications of both theoretical and ...
Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness

Affine message authentication code (MAC) and delegatable affine MAC turn out to be useful tools for constructing identity-based encryption (IBE) and hierarchical IBE (HIBE), as shown in Blazy, Kiltz and Pan's (BKP) creative work in CRYPTO (2014). An ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings

CT-RSA'05: Proceedings of the 2005 international conference on Topics in Cryptology

February 2005

384 pages

ISBN:3540243992

Editor:
Alfred Menezes
Department of Combinatorics & Optimization, University of Waterloo

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 14 February 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

94
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yi XHao FBertino E(2022)ID-Based Two-Server Password-Authenticated Key ExchangeComputer Security - ESORICS 201410.1007/978-3-319-11212-1_15(257-276)Online publication date: 10-Mar-2022
https://dl.acm.org/doi/10.1007/978-3-319-11212-1_15
Beskorovajnov WGröll RMüller-Quade JOttenhues ASchwerdt R(2022)A New Security Notion for PKC in the Standard Model: Weaker, Simpler, and Still Realizing Secure ChannelsPublic-Key Cryptography – PKC 202210.1007/978-3-030-97131-1_11(316-344)Online publication date: 8-Mar-2022
https://dl.acm.org/doi/10.1007/978-3-030-97131-1_11
Xagawa K(2021)The Boneh-Katz Transformation, Revisited: Pseudorandom/Obliviously-Samplable PKE from Lattices and Codes and Its ApplicationSelected Areas in Cryptography10.1007/978-3-030-99277-4_3(47-67)Online publication date: 29-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-99277-4_3
Boyen XIzabachène MLi Q(2021)Secure Hybrid Encryption in the Standard Model from Hard Learning ProblemsPost-Quantum Cryptography10.1007/978-3-030-81293-5_21(399-418)Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-81293-5_21
Mandal MNuida K(2020)Identity-Based Outsider Anonymous Broadcast Encryption with Simultaneous Individual MessagingNetwork and System Security10.1007/978-3-030-65745-1_10(167-186)Online publication date: 25-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-65745-1_10
Tomida JKawahara YNishimaki R(2020)Fast, Compact, and Expressive Attribute-Based EncryptionPublic-Key Cryptography – PKC 202010.1007/978-3-030-45374-9_1(3-33)Online publication date: 4-May-2020
https://dl.acm.org/doi/10.1007/978-3-030-45374-9_1
Mao YLi JChen MLiu JXie CZhan Y(2016)Fully secure fuzzy identity-based encryption for secure IoT communicationsComputer Standards & Interfaces10.1016/j.csi.2015.06.00744:C(117-121)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1016/j.csi.2015.06.007
Zhu DZhang RGu XZhu H(2016)A Practical Scheme for Data Secure Transport in VoIP ConferencingInformation and Communications Security10.1007/978-3-319-50011-9_36(466-475)Online publication date: 29-Nov-2016
https://dl.acm.org/doi/10.1007/978-3-319-50011-9_36
Sun XLi BLu XFang F(2015)CCA Secure Public Key Encryption Scheme Based on LWE Without Gaussian SamplingRevised Selected Papers of the 11th International Conference on Information Security and Cryptology - Volume 958910.1007/978-3-319-38898-4_21(361-378)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/978-3-319-38898-4_21
Zhang LWang ZWu Q(2015)Leakage-Resilient Anonymous Identity-Based Broadcast Encryption in the Standard ModelProceedings of the ICA3PP International Workshops and Symposiums on Algorithms and Architectures for Parallel Processing - Volume 953210.1007/978-3-319-27161-3_18(201-210)Online publication date: 18-Nov-2015
https://dl.acm.org/doi/10.1007/978-3-319-27161-3_18
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents