Fast cut-and-choose-based protocols for malicious and covert adversaries
From MaRDI portal
Publication:290398
DOI10.1007/S00145-015-9198-0zbMATH Open1355.94068OpenAlexW1986089277MaRDI QIDQ290398FDOQ290398
Authors: Yehuda Lindell 
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
Recommendations
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Secure two-party computation via cut-and-choose oblivious transfer
- Secure two-party computation via cut-and-choose oblivious transfer
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Two-output secure computation with malicious adversaries
Cites Work
- Title not available (Why is that?)
- A proof of security of Yao's protocol for two-party computation
- Security and composition of multiparty cryptographic protocols
- Multiparty Computation from Somewhat Homomorphic Encryption
- A new approach to practical active-secure two-party computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Cryptography
- Efficient Two-Party Secure Computation on Committed Inputs
- 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
- 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
- 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
- Practical Two-Party Computation Based on the Conditional Gate
- Efficient secure two-party protocols. Techniques and constructions
Cited In (29)
- Scalable multi-party private set-intersection
- Fast garbling of circuits under standard assumptions
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
- On the leakage of corrupted garbled circuits
- Efficient Two-Party Secure Computation on Committed Inputs
- Efficient covert two-party computation
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
- Efficient three-party computation from cut-and-choose
- Parallel coin-tossing and constant-round secure two-party computation
- Faster secure two-party computation in the single-execution setting
- MiniLEGO: efficient secure two-party computation from general assumptions
- Secure two-party computation via cut-and-choose oblivious transfer
- Two-output secure computation with malicious adversaries
- The IPS compiler: optimizations, variants and concrete efficiency
- Asymptotically quasi-optimal cryptography
- Efficient secure two-party computation using symmetric cut-and-choose
- Garbled circuits checking garbled circuits: more efficient and secure two-party computation
- Faster maliciously secure two-party computation using the GPU
- Toward malicious constant-rate 2PC via arithmetic garbling
- Secure two-party computation via cut-and-choose oblivious transfer
- Cross and clean: amortized garbled circuits with constant overhead
- Mixed-technique multi-party computations composed of two-party computations
- On cut-and-choose oblivious transfer and its variants
- Oblivious transfer based on single-qubit rotations
- Title not available (Why is that?)
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- JIMU: faster LEGO-based secure computation using additive homomorphic hashes
- Actively secure garbled circuits with constant communication overhead in the plain model
- LEGO for Two-Party Secure Computation
This page was built for publication: Fast cut-and-choose-based protocols for malicious and covert adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290398)
