Rational proofs

DOI10.1145/2213977.2214069MaRDI QIDQ5415532zbMATH OpenOpenAlexFDO

Authors Pablo 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

counting hierarchyinteractive proofsrational cryptography

Mathematics Subject Classification ID

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

Recommendations

• Rational proofs with multiple provers
• Logic of proofs
• scientific article; zbMATH DE number 2113552
• Logic of proofs and provability
• Rationality Proofs by Curve Counting
• scientific article; zbMATH DE number 5840915
• Proofs of irrationality

Cited in

(14)

• Rational responses and rational conjectures
• Fine-grained secure computation
• Socratic proofs
• Rational sumchecks
• Rational proofs with multiple provers
• Sequentially composable rational proofs
• Rationality authority for provable rational behavior
• scientific article; zbMATH DE number 2113552 (Why is no real title available?)
• Non-cooperative rational interactive proofs
• Rationality Proofs by Curve Counting
• Sumcheck-based delegation of quantum computing to rational server
• Structural complexity of rational interactive proofs
• How to make rational arguments practical and extractable
• Outsourcing computation: the minimal refereed mechanism

This page was built for publication: Rational proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415532)