Abstract
Precise zero-knowledge was introduced by Micali and Pass in STOC’06. This notion captures the idea that the view of a verifier can be reconstructed in almost same time. Following the notion, they constructed some precise zero-knowledge proofs and arguments, in which the communicated messages are polynomial bits. In this paper, we employ the new simulation technique introduced by them to provide a precise simulator for a modified Kilian’s zero-knowledge arguments with poly-logarithmic efficiency (this modification addressed by Rosen), and as a result we show this protocol is a precise zero-knowledge argument with poly-logarithmic efficiency. We also present an alternative construction of the desired protocols.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Goldwasser S, Micali S, Rackoff S. The knowledge complexity of interactive proof-systems [J]. SIAM Journal on Computing, 1989, 18(1): 186–208.
Goldreich O. Foundations of cryptography: Basic tools [M]. New York: Cambridge University Press, 2001.
Halevi S, Micali S. More on proofs of knowledge [EB/OL]. (1998-05-04). http://eprint.iacr.org/1998/015.ps.
Micali S, Pass R. Local zero knowledge [C]//Kleingerg J. Proceedings of 38th STOC. New York: ACM, 2006: 306–315.
Kilian J. A note on efficient zero-knowledge proofs and arguments [C]//Proceedings of 24th STOC. New York: ACM, 1992: 723–732.
Blum M. Coin flipping by phone [C]// Proceedings of 24th Computer Conference. [s.l.]: IEEE, 1982: 133–137.
Goldreich O, Levin L A. A hard-core predicate for all one-way functions [C]// Proceedings of 21st STOC. New York: ACM, 1989: 25–32.
Barak B, Ong S J, Vadhan S. Derandomization in cryptography [C]// Boneh D. Proceedings of Crypto’03. Berlin: Springer-Verlag, 2003: 299–315.
Naor M. Bit commitment using psedorandomness [J]. Journal of Cryptology, 1991, 4(2): 151–158.
Merkle R C. A certified digital signature [C]//Brassard G. Proceedings of Crypto’89. Berlin: Springer-Verlag, 1989: 218–238.
Brassard G, Chaum D, Crépeau C. Minimum disclosure proofs of knowledge [J]. Journal of Computer and System Science, 1988, 37(2): 156–189.
Blum M. How to prove a theorem so no one else can claim it [C]// Gleason A M. Proceedings of the International Congress of Mathematicians. Berkeley: AMS, 1986: 1444–1451.
Rosen A. The round-complexity of black-box concurrent zero-knowledge [D]. Israel Rehovot: Weizmann Institute of Science, 2004.
Prabhakaran M, Rosen A, Sahai A. Concurrent zero knowledge with logarithmic round-complexity [C]//Proceedings of 43rd FOCS. Los Alamitos: IEEE, 2002: 366–375.
Feige U, Shamir A. Zero knowledge proofs of knowledge in two rounds [C]//Proceedings of Crypto’89. Berlin: Springer-Verlag, 1989: 526–544.
Pass R. A precise computational approach to knowledge [D]. Cambridge: MIT, 2006.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: the National Natural Science Foundation of China (No. 60573031) and New Century Excellent Talent Program of Education Ministry of China (No. NCET-05-0398)
Rights and permissions
About this article
Cite this article
Ding, N., Gu, Dw. Precise zero-knowledge arguments with poly-logarithmic efficiency. J. Shanghai Jiaotong Univ. (Sci.) 14, 584–589 (2009). https://doi.org/10.1007/s12204-009-0584-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12204-009-0584-3