ADDITIVE PROOFS OF KNOWLEDGE - A New Notion for Non-Interactive Proofs

Amitabh Saxena

2007

Abstract

This paper has two contributions. Firstly, we describe an efficient Non-Interactive Zero-Knowledge (NIZK) Proof of Knowledge (PoK) protocol using bilinear pairings. The protocol assumes the hardness of the Computational Diffie-Hellman (CDH) problem. The prover does not perform any pairing computations while the verifier performs 3 pairing computations. The protocol can be used for identification (eg. in smart-cards). Secondly, we extend the idea to multiple proofs and propose the notion of efficient Additive Non-Interactive Witness-Indistinguishable (A-NIWI) proofs. Intuitively an A-NIWI proof can be considered as a PoK of another A-NIWI proof. Our ideas are based on the aggregate signature scheme of Boneh et al. (proposed in Eurocrypt 2003).

References

  1. Bellare, M. and Goldreich, O. (1993). On defining proofs of knowledge. Lecture Notes in Computer Science, 740:390-420.
  2. Blum, M., Feldman, P., and Micali, S. (1988). Noninteractive zero-knowledge and its applications. In STOC 7888: Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 103-112. ACM Press.
  3. Boneh, D., Gentry, C., Lynn, B., and Shacham, H. (2003). Aggregate and verifiably encrypted signatures from bilinear maps. In Biham, E., editor, EUROCRYPT, volume 2656 of Lecture Notes in Computer Science, pages 416-432. Springer.
  4. Boneh, D., Lynn, B., and Shacham, H. (2004). Short signatures from the weil pairing. J. Cryptology, 17(4):297- 319.
  5. Coron, J.-S. and Naccache, D. (2003). Boneh et al.'s kelement aggregate extraction assumption is equivalent to the Diffie-Hellman assumption. In Laih, C.-S., editor, ASIACRYPT, volume 2894 of Lecture Notes in Computer Science, pages 392-397. Springer.
  6. Crescenzo, G. D., Sakurai, K., and Yung, M. (1997). Zeroknowledge proofs of decision power: new protocols and optimal round-complexity. In ICICS 7897: Proceedings of the First International Conference on Information and Communication Security, pages 17-27, London, UK. Springer-Verlag.
  7. Crescenzo, G. D., Sakurai, K., and Yung, M. (2000). On zero-knowledge proofs (extended abstract): “from membership to decision”. In STOC 7800: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 255-264, New York, NY, USA. ACM Press.
  8. Dwork, C. and Naor, M. (2000). Zaps and their applications. In FOCS 7800: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 283-293, Washington, DC, USA. IEEE Computer Society.
  9. Feige, U. and Shamir, A. (1990). Witness indistinguishable and witness hiding protocols. In STOC 7890: Proceedings of the twenty-second annual ACM symposium on Theory of computing, pages 416-426, New York, NY, USA. ACM Press.
  10. Goldreich, O. (2001). Foundations of Cryptography I, volume Basic Tools. Cambridge University Press.
  11. Goldreich, O. and Levin, L. A. (1989). A hard-core predicate for all one-way functions. In STOC 7889: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pages 25-32, New York, NY, USA. ACM Press.
  12. Goldwasser, S., Micali, S., and Rackoff, C. (1989). The knowledge complexity of interactive proof systems. SIAM J. Comput., 18(1):186-208.
  13. Groth, J., Ostrovsky, R., and Sahai, A. (2006). Perfect noninteractive zero knowledge for np. In Vaudenay, S., editor, EUROCRYPT, volume 4004 of Lecture Notes in Computer Science, pages 339-358. Springer.
  14. Rackoff, C. and Simon, D. R. (1992). Non-interactive zeroknowledge proof of knowledge and chosen ciphertext attack. In CRYPTO 7891: Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, pages 433-444, London, UK. Springer-Verlag.
  15. Santis, A. D. and Persiano, G. (1992). Zero-knowledge proofs of knowledge without interaction. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 427-436.
  16. Saxena, A. and Soh, B. (2005). One-way signature chaining: A new paradigm for group cryptosystems. Cryptology ePrint Archive, Report 2005/335.
Download


Paper Citation


in Harvard Style

Saxena A. (2007). ADDITIVE PROOFS OF KNOWLEDGE - A New Notion for Non-Interactive Proofs . In Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007) ISBN 978-989-8111-12-8, pages 239-244. DOI: 10.5220/0002117102390244


in Bibtex Style

@conference{secrypt07,
author={Amitabh Saxena},
title={ADDITIVE PROOFS OF KNOWLEDGE - A New Notion for Non-Interactive Proofs},
booktitle={Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)},
year={2007},
pages={239-244},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002117102390244},
isbn={978-989-8111-12-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)
TI - ADDITIVE PROOFS OF KNOWLEDGE - A New Notion for Non-Interactive Proofs
SN - 978-989-8111-12-8
AU - Saxena A.
PY - 2007
SP - 239
EP - 244
DO - 10.5220/0002117102390244