Game-Theoretic Analysis of an Incentivized Verifiable Computation System
From MaRDI portal
Publication:6166529
Recommendations
- Towards a game theoretic view of secure computation
- Toward a game theoretic view of secure computation
- scientific article; zbMATH DE number 1864595
- A game-theoretic framework for specification and verification of cryptographic protocols
- The power of verification for greedy mechanism design
- Distributed computing meets game theory
- Calculus of cooperation and game-based reasoning about protocol privacy
- Convergence analysis of iterated best response for a trusted computation game
- A Note on Game Theory and Verification
Cites work
- How to delegate and verify in public: verifiable computation from attribute-based encryption
- Modeling Bitcoin contracts by timed automata
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Optimal contracts for outsourced computation
- Robust multiparty computation with faster verification time
Cited in
(3)
This page was built for publication: Game-Theoretic Analysis of an Incentivized Verifiable Computation System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166529)