Secure Multi-party Computation: Information Flow of Outputs and Game Theory

DOI10.1007/978-3-662-54455-6_4zbMath1444.68014OpenAlexW2582898677MaRDI QIDQ3304808

Patrick Ah-Fat, Michael Huth

Publication date: 3 August 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10044/1/43742

zbMATH Keywords

Shannon entropyoblivious transferinformation flowinput domainpublic output

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60) Measures of information, entropy (94A17) Distributed systems (68M14) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A full proof of the BGW protocol for perfectly secure multiparty computation
• Enumeration of Nash equilibria for two-player games
• A proof of security of Yao's protocol for two-party computation
• A semantic approach to secure information flow
• Quantitative information flow as safety and liveness hyperproperties
• Cryptography made simple
• Better Preprocessing for Secure Multiparty Computation
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• How to share a secret
• Improved Garbled Circuit: Free XOR Gates and Applications
• On the Foundations of Quantitative Information Flow
• Secure Multiparty Computation Goes Live
• A lattice model of secure information flow
• Secure Multiparty Computation and Secret Sharing
• Algebraic foundations for quantitative information flow

This page was built for publication: Secure Multi-party Computation: Information Flow of Outputs and Game Theory