On the Security of the “Free-XOR” Technique (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
A protocol issue for the malicious case of Yao's garbled circuit construction
Berry Schoenmakers, Mehmet Sabir Kiraz
27th Symposium on Information Theory in the …, 2006
A New Approach to Practical Active-Secure Two-Party Computation
Lecture Notes in Computer Science, 2012
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits
IACR Cryptol. ePrint Arch., 2018
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
Theory of Cryptography, 2013
A Domain-Specific Language for Constructing and Reasoning About the Security of Garbled Circuits
2017
Efficient Two-Party Secure Computation on Committed Inputs
Lecture Notes in Computer Science, 2007
On the Power of Correlated Randomness in Secure Computation
Lecture Notes in Computer Science, 2013
Concurrent Secure Computation via Non-Black Box Simulation
Lecture Notes in Computer Science, 2015
Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions)
Theory of Cryptography, 2018
An efficient protocol for fair secure two-party computation
Berry Schoenmakers, Mehmet Sabir Kiraz
Topics in CryptologyCT-RSA 2008, 2008
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security
Improved Black-Box Constructions of Composable Secure Computation
2020
Constant-round protocols of stronger security via relaxed set-up assumptions
On the communication complexity of zero-knowledge proofs
Journal of Cryptology, 1993
MISC: Multi-Input Secure Two-Party Computation
The ISC International Journal of Information Security, 2023
Limits on the Power of Garbling Techniques for Public-Key Encryption
Lecture Notes in Computer Science, 2018
Block ciphers, pseudorandom functions, and Natural Proofs
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
Lecture Notes in Computer Science, 2006
Impossibility Results for Static Input Secure Computation
Lecture Notes in Computer Science, 2012
Zero-Knowledge Proofs from Secure Multiparty Computation
SIAM Journal on Computing, 2009
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
Advances in Cryptology – EUROCRYPT 2010, 2010
Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF
Information Security and Privacy, 2021
Secure Computation Based on Leaky Correlations: High Resilience Setting
Advances in Cryptology – CRYPTO 2017, 2017
On Perfectly Secure 2PC in the OT-Hybrid Model
Springer International Publishing eBooks, 2021
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
Advances in Cryptology – EUROCRYPT 2014, 2014
Journal of Cryptology, 1990
Committed Oblivious Transfer and Private Multi-Party Computation
Lecture Notes in Computer Science, 1995
2010