Abstract
We describe efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important applications of these protocols:
-
Chosen-ciphertext-secure, interactive encryption. In settings where both parties are on-line, an interactive encryption protocol may be used. We construct chosen-ciphertext-secure interactive encryption schemes based on any of the schemes above. In each case, the improved scheme requires only a small overhead beyond the original, semantically-secure scheme.
-
Password-based authenticated key exchange. We derive efficient protocols for password-based key exchange in the public-key model [28], [5] whose security may be based on any of the cryptosystems mentioned above.
-
Deniable authentication. Our techniques give the first efficient constructions of deniable authentication protocols based on, e.g., the RSA or computational Diffie-Hellman assumption.
Of independent interest, we consider the concurrent composition of proofs of knowledge; this is essential to prove security of our protocols when run in an asynchronous, concurrent environment.
Keywords
- Encryption Scheme
- Authentication Protocol
- Decryption Oracle
- Deniable Authentication
- Universal Composability
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The full version of this work appears in [29].
(Work done while at Columbia University)
Download conference paper PDF
References
Y. Aumann and M.O. Rabin. A Proof of Plaintext Knowledge Protocol and Applications. Manuscript. June, 2001.
B. Barak. Constant-Round Coin Tossing with a Man in the Middle or Realizing the Shared Random String Model. Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, IEEE, 2002, pp. 345–355.
M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. Advances in Cryptology — Crypto’ 92, LNCS vol. 740, E. Brickell, ed., Springer-Verlag, 1992, pp. 390–420.
M. Blum and S. Goldwasser. An Efficient Probabilistic Public-Key Encryption Scheme which Hides All Partial Information. Advances in Cryptology — Crypto’ 84, LNCS vol. 196, G. Blakley and D. Chaum, eds., Springer-Verlag, pp. 289–302.
M. Boyarsky. Public-Key Cryptography and Password Protocols: the Multi-User Case. ACM Conference on Computer and Communications Security, 1999, pp. 63–72.
R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, IEEE, 2001, pp. 136–145.
R. Cramer. Modular Design of Secure Yet Practical Cryptographic Protocols. PhD Thesis, CWI and U. Amsterdam, 1996.
R. Cramer, I. Damgård, and J.B. Nielsen. Multiparty Computation from Threshold Homomorphic Encryption. Advances in Cryptology — Eurocrypt 2001, LNCS vol. 2045, B. Pfitzmann, ed., Springer-Verlag, 2001, pp. 280–299.
R. Cramer, I. Damågrd, and B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. Advances in Cryptology — Crypto’ 94, LNCS vol. 839, Y. Desmedt, ed., Springer-Verlag, 1994, pp. 174–187.
R. Cramer and V. Shoup. A Practical Public-Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. Advances in Cryptology — Crypto’ 98, LNCS vol. 1462, H. Krawczyk, ed., Springer-Verlag, 1998, pp. 13–25.
R. Cramer and V. Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen-Ciphertext-Secure Public-Key Encryption. Advances in Cryptology — Eurocrypt 2002, LNCS vol. 2332, L. Knudsen, ed., Springer-Verlag, 2002, pp. 45–64.
A. De Santis and G. Persiano. Zero-Knowledge Proofs of Knowledge Without Interaction. Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, pp. 427–436.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust Non-Interactive Zero Knowledge. Advances in Cryptology — Crypto 2001, LNCS vol. 2139, J. Kilian, ed., Springer-Verlag, 2001, pp. 566–598.
G. Di Crescenzo, J. Katz, R. Ostrovsky, and A. Smith. Efficient and Non-Interactive Non-Malleable Commitment. Advances in Cryptology — Eurocrypt 2001, LNCS vol. 2045, B. Pfitzmann, ed., Springer-Verlag, 2001, pp. 40–59
D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography. SIAM J. Computing 30(2): 391–437 (2000).
C. Dwork and M. Naor. Zaps and Their Applications. Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE, 2000, pp. 283–293.
C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. Proceedings of the 30th Annual Symposium on Theory of Computing, ACM, 1998, pp. 409–418.
C. Dwork and A. Sahai. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. Advances in Cryptology — Crypto’ 98, LNCS vol. 1462, H. Krawczyk, ed., Springer-Verlag, 1998, pp. 442–457.
T. El Gamal. A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory 31(4): 469–472 (1985).
U. Feige, A. Fiat, and A. Shamir. Zero-Knowledge Proofs of Identity. Journal of Cryptology 1(2): 77–94 (1988).
U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String. Proceedings of the 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 308–317.
Z. Galil, S. Haber, and M. Yung. Symmetric Public-Key Encryption. Advances in Cryptology — Crypto’ 85, LNCS vol. 218, H.C. Williams, ed., Springer-Verlag, 1985, pp. 128–137.
J. Garay and P. MacKenzie. Concurrent Oblivious Transfer. Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE, 2000, pp. 314–324.
O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge, UK, 2001.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing but Their Validity or: All Languages in NP Have Zero-Knowledge Proof Systems. JACM 38(3): 691–729 (1991).
L.C. Guillou and J.-J. Quisquater. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory. Advances in Cryptology — Eurocrypt’ 88, LNCS vol. 330, C.G. Günther, ed., Springer-Verlag, 1988, pp. 123–128.
S. Haber. Multi-Party Cryptographic Computations: Techniques and Applications. PhD Thesis, Columbia University, 1987.
S. Halevi and H. Krawczyk. Public-Key Cryptography and Password Protocols. ACM Transactions on Information and System Security 2(3): 230–268 (1999).
J. Katz. Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks. PhD Thesis, Columbia University, 2002.
M. Naor. Deniable Ring Authentication. Advances in Cryptology — Crypto 2002, LNCS vol. 2442, M. Yung, ed., Springer-Verlag, 2002, pp. 481–498.
M. Naor and M. Yung. Public-Key Cryptosystems Provably Secure Against Chosen-Ciphertext Attack. Proceedings of the 22th Annual Symposium on Theory of Computing, ACM, 1990, pp. 427–437.
H. Ong and C.P. Schnorr. Fast Signature Generation With a Fiat-Shamir-Like Scheme. Advances in Cryptology — Eurocrypt’ 90, LNCS vol. 473, I. Damgård, ed., Springer-Verlag, 1990, pp. 432–440.
P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Advances in Cryptology — Eurocrypt’ 99, LNCS vol. 1592, J. Stern, ed., Springer-Verlag, 1999, pp. 223–238.
M. Rabin. Digitalized Signatures and Public-Key Functions as Intractable as Factorization. Technical Report MIT/LCS/TR-212, MIT Laboratory for Computer Science, January 1979.
C. Rackoff and D. Simon. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen-Ciphertext Attack. Advances in Cryptology — Crypto’ 91, LNCS vol. 576, J. Feigenbaum, ed., Springer-Verlag, 1991, pp. 433–444.
R. Rivest, A. Shamir, and L.M. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2): 120–126 (1978).
A. Sahai. Non-Malleable Non-Interactive Zero-Knowledge and Adaptive Chosen-Ciphertext Security. Proceedings of the 40th Annual Symposium on Foundations of Computer Science, IEEE, 1999, pp. 543–553.
C.P. Schnorr. Efficient Identification and Signatures for Smart Cards. Advances in Cryptology — Crypto’ 89, LNCS vol. 435, G. Brassard, ed., Springer-Verlag, 1989, pp. 239–252.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 International Association for Cryptologic Research
About this paper
Cite this paper
Katz, J. (2003). Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications. In: Biham, E. (eds) Advances in Cryptology — EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science, vol 2656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39200-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-39200-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-14039-9
Online ISBN: 978-3-540-39200-2
eBook Packages: Springer Book Archive
