Fast cut-and-choose-based protocols for malicious and covert adversaries
From MaRDI portal
Publication:290398
DOI10.1007/s00145-015-9198-0zbMath1355.94068OpenAlexW1986089277MaRDI QIDQ290398
Publication date: 1 June 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-015-9198-0
Related Items
Asymptotically quasi-optimal cryptography ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Scalable Multi-party Private Set-Intersection ⋮ Oblivious transfer based on single-qubit rotations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient secure two-party protocols. Techniques and constructions
- A proof of security of Yao's protocol for two-party computation
- Security and composition of multiparty cryptographic protocols
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
- Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Faster Maliciously Secure Two-Party Computation Using the GPU
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Semi-homomorphic Encryption and Multiparty Computation
- Two-Output Secure Computation with Malicious Adversaries
- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- LEGO for Two-Party Secure Computation
- Foundations of Cryptography
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient Two-Party Secure Computation on Committed Inputs
- Practical Two-Party Computation Based on the Conditional Gate
