Sequentially Composable Rational Proofs

DOI10.1007/978-3-319-25594-1_15zbMath1448.68239OpenAlexW2237166729MaRDI QIDQ3455899

Rosario Gennaro, Matteo Campanelli

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

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

Related Items (3)

Fine-grained secure computation ⋮ Structural complexity of rational interactive proofs ⋮ Unnamed Item

This page was built for publication: Sequentially Composable Rational Proofs