Efficient zero-knowledge arguments from two-tiered homomorphic commitments

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

Volumn 7073 LNCS, Issue , 2011, Pages 431-448

  Groth, Jens ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

circuit satisfiability; range proofs; sublinear communication; two tiered homomorphic commitments; Zero knowledge arguments

Indexed keywords

CIRCUIT SATISFIABILITY; RANGE PROOFS; SUBLINEAR; TWO-TIERED HOMOMORPHIC COMMITMENTS; ZERO KNOWLEDGE;

COMMUNICATION; CRYPTOGRAPHY; IMAGE QUALITY;

SECURITY OF DATA;

EID: 82955177081     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25385-0_23     Document Type: Conference Paper

References (32)

1. Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-Preserving Signatures and Commitments to Group Elements. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, p. 209-236. Springer, Heidelberg (2010)
2. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501-555(1998) (Pubitemid 128506634)
3. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM 45(1), 70-122(1998) (Pubitemid 128615465)
4. Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S. P.: Short PCPs verifiable in polylogarithmic time. In: IEEE Conference on Computational Complexity, ppp. 120-134(2005) (Pubitemid 41577373)
5. Boudot, F.: Efficient Proofs that a Committed Number Lies in an Interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 431-444. Springer, Heidelberg (2000)
6. Camenisch, J., Chaabouni, R., Shelat, A.: Efficient Protocols for Set Membership and Range Proofs. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, p. 234-252. Springer, Heidelberg (2008)
7. Chaabouni, R., Lipmaa, H., Shelat, A.: Additive Combinatorics and Discrete Logarithm Based Range Protocols. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol. 6168, pp. 336-351. Springer, Heidelberg (2010)
8. Cramer, R., Damgård, I., Schoenmakers, B.: Proof of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y. G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174-187. Springer, Heidelberg (1994)
9. Damgård, I.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, p. 418-430. Springer, Heidelberg (2000)
10. Damgård, I., Jurik, M. J.: A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119-136. Springer, Heidelberg (2001) (Pubitemid 33232937)
11. Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM 54(3) (2007)
12. Galbraith, S. D., Paterson, K. G., Smart, N. P.: Pairings for cryptographers. Discrete Applied Mathematics 156(16), 3113-3121(2008)
13. Garay, J. A., MacKenzie, P. D., Yang, K.: Strengthening zero-knowledge protocols using signatures. Journal of Cryptology 19(2), 169-209(2006) (Pubitemid 43255772)
14. Gentry, C.: A fully homomorphic encryption scheme. PhD thesis. Stanford University (2009)
15. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, p. 169-178(2009)
16. Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM Journal of Computing 25(1), 69-192(1996)
17. Goldwasser, S., Kalai, Y. T., Rothblum, G. N.: Delegating computation: interactive proofs for muggles. In: STOC, pp. 113-122(2008)
18. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proofs. SIAM Journal of Computing 18(1), p186-208(1989)
19. Groth, J.: Honest verifier zero-knowledge arguments applied. Dissertation Series DS-04-3, BRICS, PhD thesis. xii+119 pp (2004)
20. Groth, J.: Non-interactive Zero-Knowledge Arguments for Voting. In: Ioannidis, J., Keromytis, A. D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 467-482. Springer, Heidelberg (2005) (Pubitemid 41422134)
21. Groth, J.: Homomorphic trapdoor commitments to group elements. Cryptology ePrint Archive, Report 2009/007(2009)
22. Groth, J.: Linear Algebra with Sub-Linear Zero-Knowledge Arguments. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, ppp. 192-208. Springer, Heidelberg (2009)
23. Groth, J.: Minimizing non-interactive zero-knowledge proofs using fully homomorphic encryption. Cryptology ePrint Archive, Report 2011/012(2011)
24. Groth, J., Ishai, Y.: Sub-Linear Zero-Knowledge Argument for Correctness of a Shuffle. In: Smart, N. P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 379-396. Springer, Heidelberg (2008) (Pubitemid 351762840)
25. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge proofs from secure multiparty computation. SIAM Journal of Computing 39(3), 121-1152(2009)
26. Kalai, Y. T., Raz, R.: Interactive PCP. In: Aceto, L., Damgård, I., Goldberg, L. A., Halldórsson, M. M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, p. 536-547. Springer, Heidelberg (2008)
27. Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: STOC, ppp. 723-732(1992) (Pubitemid 23608089)
28. Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. Journal of Cryptology 16(3), 143-184(2003) (Pubitemid 41201208)
29. Lipmaa, H.: On Diophantine Complexity and Statistical Zero-Knowledge Arguments. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 398-415. Springer, Heidelberg (2003)
30. Lipmaa, H., Asokan, N., Niemi, V.: Secure Vickrey Auctions Without Threshold Trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 87-101. Springer, Heidelberg (2003) (Pubitemid 36316773)
31. Pedersen, T. P.: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129-140. Springer, Heidelberg (1992)
32. Schnorr, C.-P.: Efficient signature generation by smart cards. Journal of Cryptology 4(3), 161-174(1991)