Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries

@article{Lindell2016FastCP,
  title={Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries},
  author={Yehuda Lindell},
  journal={Journal of Cryptology},
  year={2016},
  volume={29},
  pages={456-490}
}
  • Yehuda Lindell
  • Published 1 April 2016
  • Computer Science, Mathematics
  • Journal of Cryptology
In the setting of secure two-party computation, two parties wish to securely compute a joint function of their private inputs, while revealing only the output. One of the primary techniques for achieving efficient secure two-party computation is that of Yao’s garbled circuits (FOCS 1986). In the semi-honest model, where just one garbled circuit is constructed and evaluated, Yao’s protocol has proven itself to be very efficient. However, a malicious adversary who constructs the garbled circuit… 

Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings

This paper shows how to reduce the amortized cost of cut-and-choose based secure two-party computation to O ( s logN ) garbled circuits when N secure computations are run, and presents a number of variants of protocols that rely on the DDH assumption alone and are proven secure in the random-oracle model.

A Novel Bilateral Oblivious Transfer Protocol Based on Cut-and-Choose Technique

  • Lulu NingJian Wang
  • Computer Science, Mathematics
    2020 IEEE 14th International Conference on Big Data Science and Engineering (BigDataSE)
  • 2020
A novel CCBOT protocol with the security against malicious adversaries based on the Computational Diffie-Hellman (CDH) assumption is presented, and the correctness, efficiency and security of the constructed protocol are analyzed.

Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose

A new protocol is proposed for information-theoretically secure 3PC tolerating one malicious party with cheating probability using runs of circuit computation in the cut-and-choose paradigm, which is essentially only a small constant worse than that of state-of-the-art 3PC protocols against a semi-honest corruption.

Non-interactive Secure 2PC in the Offline/Online and Batch Settings

An efficient cut-and-choose 2PC that is round-optimal (one message from each party), but in the single-execution setting is proposed, which improves performance by an order of magnitude.

TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation

It is shown that an interactive garbling scheme combined with a Universally Composable (UC) secure oblivious transfer protocol can be used in a black-box manner to implement two-party computation (2PC) UC securely against any probabilistic polynomial time static and malicious adversary.

The Cut-and-Choose Game and Its Application to Cryptographic Protocols

A refined cost model is considered and formalize the cut-and-choose parameter selection problem as a constrained optimization problem and it is shown how this methodology can be applied to improve the efficiency of three representative categories of secure-computation protocols.

Cut-and-choose bilateral oblivious transfer protocol based on DDH assumption

A so-called cut-and-choose bilateral oblivious transfer protocol, which transfers all necessary keys of garbled circuits in one process, and the round complexity of secure two-party computation protocol can be decreased.

Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries

This work designs a highly optimized protocol in the offline/online setting that makes use of all state-of-the-art techniques, along with several new techniques that it introduces, including a new technique for enforcing consistency of the inputs used by the party who garbles the circuits.

Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ

This paper presents a constant-round multi-party secure computation protocol that is fully secure in the presence of malicious adversaries and for any number of corrupted parties and is the first version of that Protocol that is concretely efficient for the dishonest majority case.

Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ

This paper presents a constant-round multi-party secure computation protocol that is fully secure in the presence of malicious adversaries and for any number of corrupted parties and is the first version of that Protocol that is concretely efficient for the dishonest majority case.
...

References

SHOWING 1-10 OF 44 REFERENCES

Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries

A cut-and-choose protocol for secure computation based on garbled circuits, with security in the presence of malicious adversaries, that vastly improves on all previous protocols of this type and relies on the decisional Diffie–Hellman assumption.

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

A protocol for this task that follows the methodology of using cut-and-choose to boost Yao’s protocol to be secure in the presence of malicious adversaries is presented and it is demonstrated that this protocol is more efficient than any other known today.

Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation

A new security definition for 2PC is proposed that strengthens the guarantees provided by the standard covert model, and offers a smoother security vs. efficiency tradeoff to protocol designers in choosing the right deterrence factor.

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

An efficient secure two-party protocol, based on Yao’s construction, which provides security against malicious adversaries and combines techniques from folklore along with new techniques for efficiently proving consistency of inputs.

Two-Output Secure Computation with Malicious Adversaries

This work presents a method to compile Yao's two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability, and develops and analyzes new solutions to issues arising with this transformation.

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

An efficient secure two-party protocol, based on Yao’s construction, which provides security against malicious adversaries, and combines techniques from folklore along with new techniques for efficiently proving consistency of inputs.

Efficient Two-Party Secure Computation on Committed Inputs

A homomorphic, semantically secure variant of the Camenisch-Shoup verifiable cryptosystem, which uses shorter keys, is unambiguous, and allows efficient proofs that a committed plaintext is encrypted under a committed key.

Efficient Secure Two-Party Protocols: Techniques and Constructions

The authors present a comprehensive study of efficient protocols and techniques for secure two-party computation both general constructions that can be used to securely compute any functionality, and

Founding Cryptography on Oblivious Transfer - Efficiently

We present a simple and efficient compiler for transforming secure multi-party computation (MPC) protocols that enjoy security only with an honest majority into MPC protocols that guarantee security

Billion-Gate Secure Computation with Malicious Adversaries

It is shown that by incorporating the best known techniques and parallelizing almost all steps of the resulting protocol, evaluating billion-gate circuits is feasible in the malicious model.