Sequentially composable rational proofs

DOI10.1007/978-3-319-25594-1_15MaRDI QIDQ3455899zbMATH OpenOpenAlexFDO

Authors Matteo Campanelli, Rosario Gennaro

Publication date 11 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-25594-1_15

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Applications of game theory (91A80) Cryptography (94A60)

Recommendations

• Rational proofs with multiple provers
• Efficient rational proofs for space bounded computations
• Efficient rational proofs with strong utility-gap guarantees
• Rational proofs
• Rational sumchecks

Cited in

(8)

• Fine-grained secure computation
• Rational sumchecks
• Rational proofs with multiple provers
• scientific article; zbMATH DE number 2090535 (Why is no real title available?)
• Non-cooperative rational interactive proofs
• 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: Sequentially composable rational proofs

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