Rational proofs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 1017-1028

  Azar, Pablo Daniel ^a   Micali, Silvio ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

counting hierarchy; interactive proofs; rational cryptography

Indexed keywords

CLASSICAL COUNTERPART; COUNTING HIERARCHY; INTERACTIVE PROOFS; POLYNOMIAL-TIME VERIFIERS; PROOF SYSTEM; PROPER SCORING RULES;

POLYNOMIAL APPROXIMATION; PROGRAMMABLE LOGIC CONTROLLERS;

COMPUTATION THEORY;

EID: 84862599114     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214069     Document Type: Conference Paper

References (43)

1. Eric W. Allender and Klaus W. Wagner. Counting hierarchies: Polynomial time and constant depth circuits, 1990.
2. B. Applebaum, Y. Ishai, and E. Kushilevitz. Computationally private randomizing polynomials and their applications. Computational Complexity, 15(2):115-162, 2006. (Pubitemid 43938398)
3. Crescenzi P. Gambosi G. Kann V. Marchetti-Spaccamela A. Ausiello, G. and M. Protasi. Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer Verlag, 1999.
4. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational complexity, 1(1):3-40, 1991.
5. L. Babai and S. Moran. Arthur-merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36(2):254-276, 1988. (Pubitemid 18623335)
6. M. Babaioff, L. Blumrosen, N.S. Lambert, and O. Reingold. Only valuable experts can be valued. In Proceedings of the 12th ACM conference on Electronic commerce, pages 221-222. ACM, 2011.
7. B. Barak and O. Goldreich. Universal arguments and their applications. ccc, page 0194, 2002.
8. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 113-131. ACM, 1988.
9. S. Benabbas, R. Gennaro, and Y. Vahlis. Verifiable delegation of computation over large datasets. 2011.
10. Nir Bitansky, Ran Canetti, Alessandro Chiesa, and Eran Tromer. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. 3rd Innovations in Theoretial Computer Science, 2012.
11. R.B. Boppana and J. Hastad Stathis. Does-np have short interactive proofs? Information Processing Letters, 25(2):127-132, 1987.
12. G.W. Brier. Verification of forecasts expressed in terms of probability. Monthly weather review, 1950.
13. R. Canetti, B. Riva, and G.N. Rothblum. Practical delegation of computation using multiple servers. In Proceedings of the 18th ACM conference on Computer and communications security, pages 445-454. ACM, 2011.
14. Y. Chen, S. Dimitrov, R. Sami, D.M. Reeves, D.M. Pennock, R.D. Hanson, L. Fortnow, and R. Gonen. Gaming prediction markets: Equilibrium strategies with a market maker. Algorithmica, 58(4):930-969, 2009.
15. K.M. Chung, Y. Kalai, and S. Vadhan. Improved delegation of computation using fully homomorphic encryption. Advances in Cryptology-CRYPTO 2010, pages 483-501, 2010.
16. G. Cormode, J. Thaler, and K. Yi. Verifying computations with streaming interactive proofs.
17. Ivan Damgård, Sebastian Faust, and Carmit Hazay. Secure two-party computation with low communication. Cryptology ePrint Archive, Report 2011/508, 2011.
18. U. Feige and J. Kilian. Making games short. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 506-516. ACM, 1997.
19. L. Fortnow, J. Rompel, and M. Sipser. On the power of multi-prover interactive protocols. Theoretical Computer Science, 134(2):545-557, 1994.
20. L. Fortnow and R.V. Vohra. The complexity of forecast testing. Econometrica, 77(1):93-105, 2009.
21. Lance Fortnow and Michael Sipser. Are there interactive protocols for co-np languages? Information Processing Letters, 28:249-251, 1988.
22. R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. Advances in Cryptology-CRYPTO 2010, pages 465-482, 2010.
23. T. Gneiting and A.E. Raftery. Strictly proper scoring rules, prediction, and estimation. Journal of the American Statistical Association, 102(477):359-378, 2007.
24. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Foundations of Computer Science, 1986., 27th Annual Symposium on, pages 174-187. IEEE, 1988.
25. S. Goldwasser, Y.T. Kalai, and G.N. Rothblum. Delegating computation: interactive proofs for muggles. In Proceedings of the 40th annual ACM symposium on Theory of computing, pages 113-122. ACM, 2008.
26. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. In Proceedings of the seventeenth annual ACM symposium on Theory of computing, pages 291-304. ACM, 1985.
27. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In Proceedings of the eighteenth annual ACM symposium on Theory of computing, pages 59-68. ACM, 1986.
28. I.J. Good. Rational decisions. Journal of the Royal Statistical Society. Series B (Methodological), pages 107-114, 1952.
29. J. Halpern and V. Teague. Rational secret sharing and multiparty computation. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 623-632. ACM, 2004.
30. R. Impagliazzo and A. Wigderson. P= bpp if e requires exponential circuits: Derandomizing the xor lemma. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 220-229. ACM, 1997.
31. Y. Kalai and R. Raz. Probabilistically checkable arguments. Advances in Cryptology-CRYPTO 2009, pages 143-159, 2009.
32. J. Katz. Bridging game theory and cryptography: Recent results and future directions. Theory of Cryptography, pages 251-272, 2008.
33. J. Kilian. A note on efficient zero-knowledge proofs and arguments. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pages 723-732. ACM, 1992.
34. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM (JACM), 39(4):859-868, 1992. (Pubitemid 23600385)
35. S. Micali. Computationally sound proofs. SIAM Journal on Computing, 30(4):1253-1298, 2001. (Pubitemid 32837894)
36. C. Papamanthou, R. Tamassia, and N. Triandopoulos. Optimal verification of operations on dynamic sets. In Proc. International Cryptology Conference (CRYPTO), 2011.
37. A. Sandroni. The reproducible properties of correct forecasts. International Journal of Game Theory, 32(1):151-159, 2003. (Pubitemid 37550825)
38. Aviad Rubinstein Shaff Goldwasser, Huijia Lin. Delegation of computation without rejection problem from designated verifier cs-proofs. Cryptology ePrint Archive, Report 2011/456, 2011.
39. A. Shamir. Ip= pspace. Journal of the ACM (JACM), 39(4):869-877, 1992.
40. Y. Shoham and M. Tennenholtz. Non-cooperative computation: Boolean functions with correctness and exclusivity. Theoretical Computer Science, 343(1-2):97-113, 2005. (Pubitemid 41360147)
41. S. Toda. Pp is as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 20:865, 1991.
42. J. Torán. Complexity classes defined by counting quantifiers. Journal of the ACM (JACM), 38(3):752-773, 1991.
43. K.W. Wagner. The complexity of combinatorial problems with succinct input representation. Acta Informatica, 23(3):325-356, 1986.