Rational arguments: Single round delegation with sublinear verification

ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science

Volumn , Issue , 2014, Pages 523-539

  Guo, Siyao ^a   Hubáček, Pavel ^b   Rosen, Alon ^c   Vald, Margarita ^d  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b AARHUS UNIVERSITY   (Denmark)

^c INTERDISCIPLINARY CENTER   (Israel)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

Delegation of Computation; Rational Cryptography; Succinct Arguments; Threshold Circuits

Indexed keywords

THRESHOLD LOGIC;

CLASSICAL COUNTERPART; INTERACTIVE PROOFS; RATIONAL CRYPTOGRAPHIES; SEARCH PROBLEM; SUCCINCT ARGUMENTS; THRESHOLD CIRCUITS; THRESHOLD GATES; UNIFORM CIRCUITS;

COMPUTER SCIENCE;

EID: 84893284656     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2554797.2554845     Document Type: Conference Paper

References (29)

1. B. Applebaum, Y. Ishai, and E. Kushilevitz. From secrecy to soundness: Efficient verification via secure computation. In S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, editors, ICALP (1), Volume 6198 of Lecture Notes in Computer Science, pages 152-163. Springer, 2010.
2. P. D. Azar and S. Micali. Rational proofs. In H. J. Karloff and T. Pitassi, editors, STOC, pages 1017-1028. ACM, 2012.
3. P. D. Azar and S. Micali. Super-efficient rational proofs. In M. Kearns, R. P. McAfee, and É. Tardos, editors, ACM Conference on Electronic Commerce, pages 29-30. ACM, 2013.
4. N. Bitansky, A. Chiesa, Y. Ishai, R. Ostrovsky, and O. Paneth. Succinct non-interactive arguments via linear interactive proofs. In TCC, pages 315-333, 2013.
5. G. W. Brier. Verification of forecasts expressed in terms of probability. Monthly Weather Review, 78(1): 1-3, 1950.
6. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In J. Stern, editor, EUROCRYPT, Volume 1592 of Lecture Notes in Computer Science, pages 402-414. Springer, 1999.
7. R. Canetti, B. Riva, and G. N. Rothblum. Refereed delegation of computation. Inf. Comput., 226: 16-36, 2013.
8. K.-M. Chung, Y. T. Kalai, and S. P. Vadhan. Improved delegation of computation using fully homomorphic encryption. In T. Rabin, editor, CRYPTO, Volume 6223 of Lecture Notes in Computer Science, pages 483-501. Springer, 2010.
9. G. Cormode, M. Mitzenmacher, and J. Thaler. Practical verified computation with streaming interactive proofs. In S. Goldwasser, editor, ITCS, pages 90-112. ACM, 2012.
10. I. Damgård, S. Faust, and C. Hazay. Secure two-party computation with low communication. In R. Cramer, editor, TCC, Volume 7194 of Lecture Notes in Computer Science, pages 54-74. Springer, 2012.
11. C. Dwork, M. Langberg, M. Naor, K. Nissim, and O. Reingold. Succinct NP proofs and spooky interactions. Available at www.openu.ac.il/home/mikel/papers/ spooky.ps, 2004.
12. R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In T. Rabin, editor, CRYPTO, Volume 6223 of Lecture Notes in Computer Science, pages 465-482. Springer, 2010.
13. R. Gennaro, C. Gentry, B. Parno, and M. Raykova. Quadratic span programs and succinct NIZKs without PCPs. IACR Cryptology ePrint Archive, 2012: 215, 2012.
14. C. Gentry and D. Wichs. Separating succinct non-interactive arguments from all falsifiable assumptions. In L. Fortnow and S. P. Vadhan, editors, STOC, pages 99-108. ACM, 2011.
15. T. Gneiting and A. E. Raftery. Strictly proper scoring rules, prediction, and estimation. Journal of the American Statistical Association, 102: 359-378, 2007.
16. O. Goldreich, S. P. Vadhan, and A. Wigderson. On interactive proofs with a laconic prover. Computational Complexity, 11(1-2): 1-53, 2002.
17. S. Goldwasser, Y. T. Kalai, and G. N. Rothblum. Delegating computation: interactive proofs for muggles. In C. Dwork, editor, STOC, pages 113-122. ACM, 2008.
18. J. Groth. Short pairing-based non-interactive zero-knowledge arguments. In M. Abe, editor, ASIACRYPT, Volume 6477 of Lecture Notes in Computer Science, pages 321-340. Springer, 2010.
19. Y. T. Kalai and R. Raz. Probabilistically checkable arguments. In S. Halevi, editor, CRYPTO, Volume 5677 of Lecture Notes in Computer Science, pages 143-159. Springer, 2009.
20. Y. T. Kalai, R. Raz, and R. D. Rothblum. Delegation for bounded space. In D. Boneh, T. Roughgarden, and J. Feigenbaum, editors, STOC, pages 565-574. ACM, 2013.
21. J. Kilian. A note on efficient zero-knowledge proofs and arguments (extended abstract). In S. R. Kosaraju, M. Fellows, A. Wigderson, and J. A. Ellis, editors, STOC, pages 723-732. ACM, 1992.
22. G. Kol and R. Raz. Competing provers protocols for circuit evaluation. In R. D. Kleinberg, editor, ITCS, pages 473-484. ACM, 2013.
23. H. Lipmaa. Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In R. Cramer, editor, TCC, Volume 7194 of Lecture Notes in Computer Science, pages 169-189. Springer, 2012.
24. S. Micali. Computationally sound proofs. SIAM J. Comput., 30(4): 1253-1298, 2000.
25. M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. J. ACM, 51(2): 231-262, 2004.
26. B. Parno, M. Raykova, and V. Vaikuntanathan. How to delegate and verify in public: Verifiable computation from attribute-based encryption. In R. Cramer, editor, TCC, Volume 7194 of Lecture Notes in Computer Science, pages 422-439. Springer, 2012.
27. J. H. Reif and S. R. Tate. On threshold circuits and polynomial computation. SIAM J. Comput., 21(5): 896-908, 1992.
28. G. N. Rothblum, S. P. Vadhan, and A. Wigderson. Interactive proofs of proximity: delegating computation in sublinear time. In D. Boneh, T. Roughgarden, and J. Feigenbaum, editors, STOC, pages 793-802. ACM, 2013.
29. J. Thaler. Time-optimal interactive proofs for circuit evaluation. In R. Canetti and J. Garay, editors, Advances in Cryptology - CRYPTO 2013, Volume 8043 of Lecture Notes in Computer Science, pages 71-89. Springer Berlin Heidelberg, 2013.