Linear algebra with sub-linear zero-knowledge arguments

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

Volumn 5677 LNCS, Issue , 2009, Pages 192-208

  Groth, Jens ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Circuit satisfiability; Linear algebra; Pedersen commitments; Public coin special honest verifier zero knowledge; Sub linear size zero knowledge arguments

Indexed keywords

ARITHMETIC CIRCUIT; BINARY CIRCUITS; CIRCUIT SATISFIABILITY; COMMUNICATION COMPLEXITY; COMPUTATION COMPLEXITY; EXPONENTIATIONS; FINITE FIELDS; HADAMARD PRODUCTS; MATRIX; PEDERSEN COMMITMENTS; PUBLIC-COIN SPECIAL HONEST VERIFIER ZERO-KNOWLEDGE; SATISFIABILITY; SUB-LINEAR SIZE ZERO-KNOWLEDGE ARGUMENTS; ZERO KNOWLEDGE;

ALGEBRA; CRYPTOGRAPHY; INTEGRATING CIRCUITS; LOGIC CIRCUITS;

MATRIX ALGEBRA;

EID: 70350347973     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03356-8_12     Document Type: Conference Paper

References (17)

1. +98] 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)
2. [AS98] Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM 45(1), 70-122 (1998)
3. +05] Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Short PCPs verifiable in polylogarithmic time. In: IEEE Conference on Computational Complexity, pp. 120-134 (2005)
4. [Cha81] Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24(2), 84-88 (1981)
5. [Din07] Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM 54(3) (2007)
6. [GI08] 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), http://www.daimi.au.dk/~jg/ PCPShuffle.pdf
7. [GKR08] Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: STOC, pp. 113-122 (2008)
8. [Gro03] Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 145-160. Springer, Heidelberg (2002), ePrint Archive: http://eprint.iacr.org/2005/246
9. [Gro04] Groth, J.: Honest verifier zero-knowledge arguments applied. Dissertation Series DS-04-3, BRICS. Ph.D thesis, pp. xii+119 (2004)
10. [IKOS07] Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC, pp. 21-30 (2007)
11. [Joh00] Johnson, D.: Challenges for theoretical computer science (2000), http://www.research.att.com/~dsj/nsflist.html#Crypto
12. [Kil92] Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: STOC, pp. 723-732 (1992)
13. [KR08] 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, pp. 536-547. Springer, Heidelberg (2008)
14. [Lim00] Lim, C.H.: Efficient multi-exponentiation and application to batch verification of digital signatures (2000), http://dasan.sejong.ac.kr/ ~chlim/pub/multi-exp.ps
15. [Nef01] Andrew Neff, C.: A verifiable secret shuffle and its application to e-voting. In: ACM CCS, pp. 116-125 (2001)
16. [Ped91] 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)
17. [Pip80] Pippenger, N.: On the evaluation of powers and monomials. SIAM Journal of Computing 9(2), 230-250 (1980)