Rational proofs

DOI10.1145/2213977.2214069zbMath1286.68127OpenAlexW2294220197MaRDI QIDQ5415532

Pablo D. Azar, Silvio Micali

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/72431

zbMATH Keywords

interactive proofscounting hierarchyrational cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Fine-grained secure computation ⋮ Structural complexity of rational interactive proofs ⋮ Unnamed Item ⋮ Rational Sumchecks ⋮ Sumcheck-based delegation of quantum computing to rational server ⋮ Outsourcing computation: the minimal refereed mechanism

This page was built for publication: Rational proofs