A protocol issue for the malicious case of Yao's garbled circuit construction (original) (raw)
Related papers
Securing Yao's garbled circuit construction against active adversaries
… Proceedings of 1st Benelux Workshop on …, 2006
Foundations of Garbled Circuits
Efficient Secure Computation with Garbled Circuits
Garbled Circuits via Structured Encryption
Faster Secure Two-Party Computation Using Garbled Circuits
An efficient protocol for fair secure two-party computation
Berry Schoenmakers, Mehmet Sabir Kiraz
Topics in CryptologyCT-RSA 2008, 2008
A Domain-Specific Language for Constructing and Reasoning About the Security of Garbled Circuits
2017
Committed Oblivious Transfer and Private Multi-Party Computation
Lecture Notes in Computer Science, 1995
Efficient committed oblivious transfer of bit strings
Berry Schoenmakers, Mehmet Sabir Kiraz
Information Security, 2007
Weakening Security Assumptions and Oblivious Transfer (Abstract)
International Cryptology Conference, 1988
Efficient Two-Party Secure Computation on Committed Inputs
Lecture Notes in Computer Science, 2007
Adaptively secure garbling with applications to one-time programs and secure outsourcing
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits
IACR Cryptol. ePrint Arch., 2018
A New Approach to Practical Active-Secure Two-Party Computation
Lecture Notes in Computer Science, 2012
Secure Two-Party Computation via Leaky Generalized Oblivious Transfer
An Efficient Secure Oblivious Transfer
Quid-Pro-Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution
2012
On the Security of the “Free-XOR” Technique
Ranjit Kumaresan, Hong-Sheng Zhou
Lecture Notes in Computer Science, 2012
Weakening Security Assumptions and Oblivious Transfer
Lecture Notes in Computer Science
Efficient and Universally Composable Committed Oblivious Transfer and Applications
Lecture Notes in Computer Science, 2004
Constant-round secure two-party computation from a linear number of oblivious transfer
Achieving oblivious transfer using weakened security assumptions
Limits on the Power of Garbling Techniques for Public-Key Encryption
Lecture Notes in Computer Science, 2018
A Note on an . . . Cryptographic Protocol Insecurity
2008
Lecture Notes in Computer Science, 2009
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
Theory of Cryptography, 2014
Proceedings 41st Annual Symposium on Foundations of Computer Science
MISC: Multi-Input Secure Two-Party Computation
The ISC International Journal of Information Security, 2023
Efficient computational oblivious transfer using interactive hashing
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security - ASIACCS '11, 2011
Reducing Complexity Assumptions for Oblivious Transfer
2009
Extending Oblivious Transfers Efficiently
Lecture Notes in Computer Science, 2003