Abstract
Hada and Tanaka [11,12] showed the existence of 3-round, negligible-error zero-knowledge arguments for NP based on a pair of non-standard assumptions, here called KEA1 and KEA2. In this paper we show that KEA2 is false. This renders vacuous the results of [11,12]. We recover these results, however, under a suitably modified new assumption called KEA3. What we believe is most interesting is that we show that it is possible to “falsify” assumptions like KEA2 that, due to their nature and quantifier-structure, do not lend themselves easily to “efficient falsification” (Naor [15]).
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Barak, B.: How to go beyond the black-box simulation barrier. In: Proceedings of the 42nd Symposium on Foundations of Computer Science, IEEE, Los Alamitos (2001)
Bellare, M.: A note on negligible functions. Journal of Cryptology 15(4), 271–284 (2002)
Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 547–557. Springer, Heidelberg (1990)
Bellare, M., Palacio, A.: The Knowledge-of-Exponent assumptions and 3-round zero-knowledge protocols. Full version of the current paper, available via, http://www-cse.ucsd.edu/users/mihir
Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444–1451 (1986)
Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. J. Computer and System Sciences 37(2), 156–189 (1988)
Damgård, I.: Towards practical public-key cryptosystems provably-secure against chosen-ciphertext attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 445–456. Springer, Heidelberg (1992)
Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)
Goldreich, O., Krawczyk, H.: On the Composition of Zero Knowledge Proof Systems. SIAM J. on Computing 25(1), 169–192 (1996)
Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal of Computing 18(1), 186–208 (1989)
Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, p. 408. Springer, Heidelberg (1998) [Preliminary version of [12].]
Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols. Cryptology ePrint Archive: Report 1999/009 (March 1999), http://eprint.iacr.org/1999/009/ [Final version of [11].]
Lepinski, M.: On the existence of 3-round zero-knowledge proofs. SM Thesis, MIT (June 2002), http://theory.lcs.mit.edu/~cis/theses/lepinski-masters.ps
Lepinski, M., Micali, S.: On the existence of 3-round zero-knowledge proof systems. MIT LCS Technical Memo. 616 (April 2001), http://www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TM-616.pdf
Naor, M.: On cryptographic assumptions and challenges. Invited paper and talk. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96–109. Springer, Heidelberg (2003)
Sakurai, K., Itoh, T.: On the discrepancy between serial and parallel of zeroknowledge protocols. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 246–259. Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellare, M., Palacio, A. (2004). The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols. In: Franklin, M. (eds) Advances in Cryptology – CRYPTO 2004. CRYPTO 2004. Lecture Notes in Computer Science, vol 3152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-28628-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22668-0
Online ISBN: 978-3-540-28628-8
eBook Packages: Springer Book Archive