Non-interactive zero-knowledge from homomorphic encryption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3876 LNCS, Issue , 2006, Pages 41-59

  Damgård, Ivan ^a   Fazio, Nelly ^b   Nicolosi, Antonio ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER APPLICATIONS; INTERACTIVE COMPUTER SYSTEMS; KNOWLEDGE ACQUISITION; PUBLIC KEY CRYPTOGRAPHY;

HOMOMORPHIC ENCRYPTION; NON-INTERACTIVE THRESHOLD RSA; NON-INTERACTIVE ZERO-KNOWLEDGE; RANDOM ORACLES;

NETWORK PROTOCOLS;

EID: 33745559842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_3     Document Type: Conference Paper

References (18)

1. B. Barak, R. Canetti, J. B. Nielsen, and R. Pass. Universally Composable Protocols with Relaxed Set-Up Assumptions. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pages 186-195. IEEE Computer Society, 2004.
2. F. Boudot. Efficient Proofs that a Commited Number Lies in an Interval. In Advances in Cryptology - EUROCRYPT '00, volume 1807 of LNCS, pages 431-444. Springer, 2000.
3. R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resettable zero-knowledge. In STOC'99, pages 235-244. ACM Press, 1999.
4. D. Chaum and T. P. Pedersen. Wallet databases with observers. In Advances in Oryptology - CRYPTO '92, volume Volume 740 of LNCS, pages 89-105. Springer, 1992.
5. R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocols. PhD thesis, CWI and University of Amsterdam, 1996.
6. th Annual ACM Symposium on Theory of Computing, pages 436-445. ACM Press, 1997.
7. R. Cramer and I. Damgård. Secret-Key Zero-Knowledge. In Theory of Cryptography - TCC '04, pages 223-237. Springer-Verlag, 2004. LNCS 2951.
8. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Advances in Cryptology - CRYPTO '94, pages 174-187. Springer, 1994. LNCS 839.
9. I. Damgård and E. Fujisaki. A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In Advances in Cryptology - ASIACRYPT '02, pages 125-142. Springer, 2002. LNCS 2501.
10. C. Dwork and M. Naor. Zaps and Their Applications. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00), pages 283-293. IEEE Computer Society, 2000.
11. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Advances in Cryptology - Crypto'86, volume 263 of LNCS, pages 186-194, Berlin, 1987. Springer.
12. S. Goldwasser and Y. Tauman Kalai. On the (In)security of the Fiat-Shamir Paradigm. In FOCS '03, pages 102-115. IEEE Computer Society, 2003.
13. J. Groth, R. Ostrovsky, and A. Sahai. Perfect Non-Interactive Zero Knowledge for NP. http://eprint.iacr.org/2005/290, 2005.
14. Joe Kilian and Erez Pet rank. An Efficient Non-interactive Zero-Knowledge Proof System for NP with General Assumptions. J. Cryptology, 11(1):1-27, 1998.
15. P. Paillier. Public Key Cryptosystems Based on Composite Degree Rediduosity Classes. In Advances in Cryptology - EUROCRYPT '99, pages 223-238. Springer, 1999. LNCS 1592.
16. C. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161-174, 1991.
17. V. Shoup. Practical Threshold Signatures. In Advances in Cryptology - EUROCRYPT '00, pages 207-220. Springer, 2000. LNCS 1807.
18. J. van de Graaf and R. Peralta. A Simple and Secure Way to Show Validity of Your Public Key. In Advances in Cryptology - CRYPTO '87, volume 293 of LNCS, pages 128-134. Springer, 1988.