Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 560484, 7 pages
http://dx.doi.org/10.1155/2014/560484
Review Article

A Survey of Noninteractive Zero Knowledge Proof System and Its Applications

1Department of Information Engineering, North China University of Water Conservancy and Electric Power, Zhengzhou 450011, China
2School of Software, North China University of Water Conservancy and Electric Power, Zhengzhou 450011, China

Received 15 March 2014; Accepted 31 March 2014; Published 4 May 2014

Academic Editor: Guiwu Wei

Copyright © 2014 Huixin Wu and Feng Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Goldwasser, S. Micali, and C. Rackoff, “Knowledge complexity of interactive proof systems,” SIAM Journal on Computing, vol. 18, no. 1, pp. 186–208, 1989. View at Google Scholar · View at Scopus
  2. M. Blum, P. Feldman, and S. Micali, “Non-interactive zero-knowledge and its applications,” in Proceedings of the 20th Annual ACM symposium on Theory of computing (STOC '88), pp. 103–112, ACM, 1988.
  3. M. Blum, A. de Santis, S. Micali, and G. Persiano, “Noninteractive zero-knowledge,” SIAM Journal on Computing, vol. 20, no. 6, pp. 1084–1118, 1991. View at Google Scholar · View at Scopus
  4. S. Bayer, J. Groth, and editors, “Efficient zero knowledge argument for correctness of a shuffle,” in Advances in Cryptology—EUROCRYPT 2012, D. Pointcheval and T. Johansson, Eds., vol. 7237 of Lecture Notes in Computer Science, pp. 263–280, Springer, 2012. View at Publisher · View at Google Scholar
  5. J. Groth, “Simulation-sound NIZK proofs for a practical language and constant size group signatures,” in Advances in Cryptology—ASIACRYPT 2006, X. Lai and K. Chen, Eds., vol. 4284 of Lecture Notes in Computer Science, pp. 444–459, Springer, 2006. View at Publisher · View at Google Scholar
  6. J. Groth, “Fully anonymous group signatures without random oracles,” in Advances in Cryptology—ASIACRYPT 2007, K. Kurosawa, Ed., vol. 4833 of Lecture Notes in Computer Science, pp. 164–180, Springer, 2007. View at Publisher · View at Google Scholar
  7. J. Groth, “Linear algebras with sub-linear zero-knowledge arguments,” in Advances in Cryptology—CRYPTO 2009, S. Halevi, Ed., vol. 5677 of Lecture Notes in Computer Science, pp. 192–208, Springer, 2009. View at Publisher · View at Google Scholar
  8. J. Groth, “Pairing-based non-interactive zero-knowledge proofs,” in Pairing-Based Cryptography—Pairing 2010, M. Joye, A. Miyaji, and A. Otsuka, Eds., vol. 6487 of Lecture Notes in Computer Science, p. 206, Springer, 2010. View at Google Scholar
  9. J. Groth, “Short non-interactive zero-knowledge proofs,” in Advances in Cryptology—ASIACRYPT 2010, M. Abe, Ed., vol. 6477 of Lecture Notes in Computer Science, pp. 341–358, Springer, 2010. View at Publisher · View at Google Scholar
  10. J. Groth, “Short pairing-based non-interactive zero-knowledge arguments,” in Advances in Cryptology—ASIACRYPT 2010, M. Abe, Ed., vol. 6477 of Lecture Notes in Computer Science, pp. 321–340, Springer, 2010. View at Publisher · View at Google Scholar
  11. J. Groth, “Efficient zero-knowledge arguments from two-tiered homomorphic commitments,” in Advances in Cryptology—ASIACRYPT 2011, D. H. Lee and X. Wang, Eds., vol. 7073 of Lecture Notes in Computer Science, pp. 431–448, Springer, 2011. View at Publisher · View at Google Scholar
  12. J. Groth, “Efficient zero-knowledge proofs,” in Progress in Cryptology—AFRICACRYPT 2011, A. Nitaj and D. Pointcheval, Eds., vol. 6737 of Lecture Notes in Computer Science, p. 379, Springer, 2011. View at Publisher · View at Google Scholar
  13. J. Groth and Y. Ishai, “Sub-linear zero-knowledge argument for correctness of a shuffle,” in Advances in Cryptology—EUROCRYPT 2008, N. P. Smart, Ed., vol. 4965 of Lecture Notes in Computer Science, pp. 379–396, Springer, 2008. View at Publisher · View at Google Scholar
  14. J. Groth and S. Lu, “A non-interactive shuffle with pairing based verifiability,” in Advances in Cryptology—ASIACRYPT 2007, K. Kurosawa, Ed., vol. 4833 of Lecture Notes in Computer Science, pp. 51–67, Springer, 2007. View at Publisher · View at Google Scholar
  15. J. Groth, R. Ostrovsky, and A. Sahai, “Non-interactive Zaps and new techniques for NIZK,” in Advances in Cryptology—CRYPTO 2006, C. Dwork, Ed., vol. 4117 of Lecture Notes in Computer Science, pp. 97–111, Springer, 2006. View at Publisher · View at Google Scholar
  16. J. Groth, R. Ostrovsky, and A. Sahai, “Perfect non-interactive zero knowledge for NP,” in Advances in Cryptology—EUROCRYPT 2006, S. Vaudenay, Ed., vol. 4004 of Lecture Notes in Computer Science, pp. 339–358, Springer, 2006. View at Publisher · View at Google Scholar
  17. J. Groth and A. Sahai, “Efficient non-interactive proof systems for bilinear groups,” in Advances in Cryptology—EUROCRYPT 2008, N. P. Smart, Ed., vol. 4965 of Lecture Notes in Computer Science, pp. 415–432, Springer, 2008. View at Publisher · View at Google Scholar
  18. G. Brassard, D. Chaum, and C. Crépeau, “Minimum disclosure proofs of knowledge,” Journal of Computer and System Sciences, vol. 37, no. 2, pp. 156–189, 1988. View at Google Scholar · View at Scopus
  19. U. Feige and A. Shamir, “Witness indistinguishable and witness hiding protocols,” in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC '90), pp. 416–426, ACM, May 1990. View at Scopus
  20. Y. Oren, “On the cunning power of cheating verifiers: some observations about zero-knowledge proofs,” in Proceedings of the 28th Annual Symposium on Foundations of Computer Science (SFCS '87), pp. 462–471, IEEE, 1987. View at Publisher · View at Google Scholar
  21. A. de Santis, S. Micali, and G. Persiano, “Noninteractive zero-knowledge with preprocessing,” in Advances in Cryptology—CRYPTO '88, S. Goldwasser, Ed., vol. 403 of Lecture Notes in Computer Science, pp. 269–282, Springer, 1990. View at Publisher · View at Google Scholar
  22. C. E. Shannon, “Communication theory of secrecy systems,” The Bell System Technical Journal, vol. 28, pp. 656–715, 1949. View at Publisher · View at Google Scholar
  23. R. Cramer and I. Damgård, “Secret-key zero knowledge and non-interactive verifiable exponentiation,” in Theory of Cryptography, M. Naor, Ed., vol. 2951 of Lecture Notes in Computer Science, pp. 223–237, Springer, 2004. View at Publisher · View at Google Scholar
  24. J. Groth and R. Ostrovsky, “Cryptography in the multi-string model,” in Advances in Cryptology—CRYPTO 2007, A. Menezes, Ed., vol. 4622 of Lecture Notes in Computer Science, pp. 323–341, Springer, 2007. View at Publisher · View at Google Scholar
  25. U. Feige, D. Lapidot, and A. Shamir, “Multiple non-interactive zero knowledge proofs random string,” in Proceedings of the 31st Annual Symposium on Foundations of Computer Science (SFCS '90), vol. 1, pp. 308–317, 1990. View at Publisher · View at Google Scholar
  26. M. Bellare and M. Yung, “Certifying cryptographic tools: the case of trapdoor permu-tations,” in Advances in Cryptology—CRYPTO '92, E. F. Brickell, Ed., vol. 740 of Lecture Notes in Computer Science, pp. 442–460, Springer, 1992. View at Publisher · View at Google Scholar
  27. D. Lapidot and A. Shamir, “Publicly verifiable non-interactive zero-knowledge proofs,” in Advances in Cryptology—CRYPT0 '90, A. Menezes and S. A. Vanstone, Eds., vol. 537 of Lecture Notes in Computer Science, pp. 353–365, Springer, 1990. View at Publisher · View at Google Scholar
  28. I. Damgård, “Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with proprocessing,” in Advances in Cryptology—EUROCRYPT '92, R. A. Rueppel, Ed., vol. 658 of Lecture Notes in Computer Science, pp. 341–355, Springer, 1993. View at Publisher · View at Google Scholar
  29. M. Bellare and M. Yung, “Certifying permutations: noninteractive zero-knowledge based on any trapdoor permutation,” Journal of Cryptology, vol. 9, no. 3, pp. 149–166, 1996. View at Google Scholar · View at Scopus
  30. J. Kilian, “On the complexity of bounded-interaction and noninteractive zero-knowledge proofs,” in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS '94), pp. 466–477, IEEE, 1994. View at Publisher · View at Google Scholar
  31. A. de Santis, G. di Crescenzo, and G. Persiano, “Non-interactive zero-knowledge: a low-randomness characterization of NP,” in Automata, Languages and Programming, J. Wiedermann, P. van Emde Boas, and M. Nielsen, Eds., vol. 1644 of Lecture Notes in Computer Science, pp. 271–280, Springer, 1999. View at Google Scholar
  32. J. Boyar, I. Damgård, and R. Peralta, “Short non-interactive cryptographie proofs,” Journal of Cryptology, vol. 13, no. 4, pp. 449–472, 2000. View at Publisher · View at Google Scholar · View at Scopus
  33. R. Impagfiazzo and M. Yung, “Direct minimum-knowledge computations,” in Advances in Cryptology—CRYPTO '87, C. Pomerance, Ed., vol. 293 of Lecture Notes in Computer Science, pp. 40–51, Springer, 1987. View at Publisher · View at Google Scholar
  34. W. Aiello, “Statistical zero-knowledge languages can be recognized in two rounds,” Journal of Computer and System Sciences, vol. 42, no. 3, pp. 327–345, 1991. View at Publisher · View at Google Scholar · View at Scopus
  35. L. Fortnow, “The complexity of perfect zero-knowledge,” in Proceedings of the 19th annual ACM symposium on Theory of computing (STOC '87), pp. 204–209, ACM, 1987. View at Publisher · View at Google Scholar
  36. R. Ostrovsky, “One-way functions, hard on average problems, and statistical zero-knowledge proofs,” in Proceedings of the 6th Annual Structure in Complexity Theory Conference, pp. 133–138, July 1991. View at Scopus
  37. A. de Santis, G. di Crescenzo, and G. Persiano, “The knowledge complexity of quadratic residuosity languages,” Theoretical Computer Science, vol. 132, no. 1-2, pp. 291–317, 1994. View at Google Scholar · View at Scopus
  38. A. de Santis, G. di Crescenzo, and G. Persiano, “Randomness-efficient non-interactive zero-knowledge,” in Automata, Languages and Programming, P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds., vol. 1256 of Lecture Notes in Computer Science, pp. 716–726, Springer, 1997. View at Publisher · View at Google Scholar
  39. O. Goldreich, A. Sahai, and S. P. Vadhan, “Can statistical zero knowledge be made non-interactive? Or on the relationship of SZK and NISZK,” in Advances in Cryptology—CRYPTO '99, M. J. Wiener, Ed., vol. 1666 of Lecture Notes in Computer Science, pp. 467–484, Springer, 1999. View at Publisher · View at Google Scholar
  40. A. de Santis, G. di Crescenzo, and G. Persiano, “On NC1 boolean circuit composition of non-interactive perfect zero-knowledge,” in Mathematical Foundations of Computer Science 2004, J. Fiala, V. Koubek, and J. Kratochvil, Eds., vol. 3153 of Lecture Notes in Computer Science, pp. 356–367, Springer, 2004. View at Publisher · View at Google Scholar
  41. R. Pass and A. Shelat, “Unconditional characterizations of non-interactive zero knowledge,” in Advances in Cryptology—CRYPTO 2005, V. Shoup, Ed., vol. 3621 of Lecture Notes in Computer Science, pp. 118–134, Springer, 2005. View at Publisher · View at Google Scholar
  42. M. Abe and S. Fehr, “Perfect NIZK with adaptive soundness,” in Theory of Cryptography, S. P. Vadhan, Ed., vol. 4392 of Lecture Notes in Computer Science, pp. 118–136, Springer, 2007. View at Publisher · View at Google Scholar
  43. M. Naor and M. Yung, “Public-key cryptosystems provably secure against chosen ciphertext attacks,” in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC '90), pp. 427–437, ACM, May 1990. View at Scopus
  44. M. Bellare and S. Goldwasser, “New paradigms for digital signatures and mes-sage authentication based on non-interative zero knowledge proofs,” in Advances in Cryptology—CRYPTO '89 Proceedings, G. Brassard, Ed., vol. 435 of Lecture Notes in Computer Science, pp. 194–211, Springer, 1989. View at Publisher · View at Google Scholar
  45. E. Ghadafi, N. P. Smart, and B. Warinschi, “Groth-Sahai proofs revisited,” in Public Key Cryptography—PKC 2010, P. Q. Nguyen and D. Pointcheval, Eds., vol. 6056 of Lecture Notes in Computer Science, pp. 177–192, Springer, 2010. View at Publisher · View at Google Scholar
  46. I. Damgård and R. Thorbek, “Non-interactive proofs for integer multiplication,” in Advances in Cryptology—EUROCRYPT 2007, M. Naor, Ed., vol. 4515 of Lecture Notes in Computer Science, pp. 412–429, Springer, 2007. View at Publisher · View at Google Scholar
  47. M. Ben-Or and D. Gutfreund, “Trading help for interaction in statistical zero-knowledge proofs,” Journal of Cryptology, vol. 16, no. 2, pp. 95–116, 2003. View at Publisher · View at Google Scholar · View at Scopus
  48. D. F. Ciocan and S. Vadhan, “Interactive and noninteractive zero in the help model,” Cryptology ePrint Archive Report 2007/389, 2007, http://eprint.iacr.org.
  49. A. Chailloux, D. F. Ciocan, I. Kerenidis, and S. Vadhan, “Interactive and noninteractive zero knowledge are equivalent in the help model,” in Theory of Cryptography, R. Canetti, Ed., vol. 4948 of Lecture Notes in Computer Science, pp. 501–534, Springer, 2008. View at Publisher · View at Google Scholar
  50. A. Fiat and A. Shamir, “How to prove yourself: practical solutions to identification and signature problems,” in Advances in Cryptology—CRYPTO '86, A. M. Odlyzko, Ed., vol. 263 of Lecture Notes in Computer Science, pp. 186–194, Springer, 1987. View at Publisher · View at Google Scholar
  51. C. Dwork and M. Naor, “Zaps and their applications,” in Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS '00), pp. 283–293, November 2000. View at Scopus
  52. A. Bender, J. Katz, and R. Morselli, “Ring signatures: stronger definitions, and constructions without random oracles,” Journal of Cryptology, vol. 22, no. 1, pp. 114–138, 2009. View at Publisher · View at Google Scholar · View at Scopus
  53. S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of Computer and System Sciences, vol. 28, no. 2, pp. 270–299, 1984. View at Google Scholar · View at Scopus
  54. A. Sahai, “Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security,” in Proceedings of the 40th IEEE Annual Conference on Foundations of Computer Science (FOCS '99), pp. 543–553, October 1999. View at Scopus
  55. M. Bellare, D. Micciancio, and B. Warinschi, “Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions,” in Advances in Cryptology—EUROCRYPT 2003, E. Biham, Ed., vol. 2656 of Lecture Notes in Computer Science, pp. 614–629, Springer, 2003. View at Publisher · View at Google Scholar
  56. M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, “Structure-preserving signatures and commitments to group elements,” in Advances in Cryptology—CRYPTO 2010, T. Rabin, Ed., vol. 6223 of Lecture Notes in Computer Science, pp. 209–236, Springer, 2010. View at Publisher · View at Google Scholar