Verifiably Secure Devices

DOI10.1007/978-3-540-78524-8_16MaRDI QIDQ5445511zbMATH OpenOpenAlexFDO

Authors Sergei Izmalkov, Matt Lepinski, Silvio Micali

Publication date 5 March 2008

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78524-8_16

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the power of correlated randomness in secure computation
• scientific article; zbMATH DE number 1676641
• Completely fair SFE and coalition-safe cheap talk
• Towards a game theoretic view of secure computation
• scientific article; zbMATH DE number 1304184

Cited in

(9)

• Game theoretic notions of fairness in multi-party coin toss
• A complete characterization of game-theoretically fair, multi-party coin toss
• Blackwell's comparison of experiments and discounted repeated games
• Toward a game theoretic view of secure computation
• When is a semi-honest secure multiparty computation valuable?
• Efficient rational secret sharing in standard communication networks
• Collusion-Free Protocols in the Mediated Model
• \(\log^\ast\)-round game-theoretically-fair leader election
• Perfect implementation

This page was built for publication: Verifiably Secure Devices

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