A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
From MaRDI portal
Publication:3460103
DOI10.1007/978-3-319-27239-9_8zbMath1376.94034OpenAlexW2394523232MaRDI QIDQ3460103
Publication date: 12 January 2016
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-27239-9_8
Cites Work
- Unnamed Item
- Unnamed Item
- Perfect implementation
- A Game-Theoretic Perspective on Oblivious Transfer
- Universally Composable Security with Local Adversaries
- Collusion-Preserving Computation
- Towards a Game Theoretic View of Secure Computation
- Collusion-Free Multiparty Computation in the Mediated Model
- Game-Theoretic Security for Bit Commitment
- Universally composable two-party and multi-party secure computation
- Collusion-free protocols
- Constructive Cryptography – A Primer
- Collusion-Free Protocols in the Mediated Model
- Foundations of Cryptography
- Bridging Game Theory and Cryptography: Recent Results and Future Directions
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
This page was built for publication: A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer