Game-Theoretic Analysis of an Incentivized Verifiable Computation System
DOI10.1007/978-3-030-43725-1_5zbMATH Open1519.91295OpenAlexW3012463489MaRDI QIDQ6166529FDOQ6166529
Authors: Mahmudun Nabi, Sepideh Avizheh, Muni Venkateswarlu Kumaramangalam, Reihaneh Safavi-Naini 
Publication date: 3 August 2023
Published in: Financial Cryptography and Data Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-43725-1_5
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
Applications of game theory (91A80) Cryptography (94A60) Actuarial science and mathematical finance (91G99) Distributed systems (68M14) Computer security (68M25)
Cites Work
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- How to delegate and verify in public: verifiable computation from attribute-based encryption
- Optimal contracts for outsourced computation
- Modeling Bitcoin contracts by timed automata
- 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)
