Game-Theoretic Analysis of an Incentivized Verifiable Computation System
From MaRDI portal
Publication:6166529
DOI10.1007/978-3-030-43725-1_5zbMath1519.91295OpenAlexW3012463489MaRDI QIDQ6166529
Mahmudun Nabi, Muni Venkateswarlu Kumaramangalam, Reihaneh Safavi-Naini, Sepideh Avizheh
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
Applications of game theory (91A80) Cryptography (94A60) Distributed systems (68M14) Actuarial science and mathematical finance (91G99) Computer security (68M25)
Cites Work
- Robust multiparty computation with faster verification time
- Optimal Contracts for Outsourced Computation
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Modeling Bitcoin Contracts by Timed Automata
This page was built for publication: Game-Theoretic Analysis of an Incentivized Verifiable Computation System