Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
From MaRDI portal
Recommendations
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- Revisiting the Efficiency of Malicious Two-Party Computation
- Public Key Cryptography - PKC 2006
- Efficiently making secure two-party computation fair
- Two-output secure computation with malicious adversaries
- An Efficient Protocol for Fair Secure Two-Party Computation
- Efficient Two-Party Secure Computation on Committed Inputs
- On the Power of Secure Two-Party Computation
Cites work
- A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
- Advances in Cryptology - EUROCRYPT 2004
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient oblivious transfer protocols
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient Two-Party Secure Computation on Committed Inputs
- Foundations of Cryptography
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- Public Key Cryptography - PKC 2006
- Revisiting the Efficiency of Malicious Two-Party Computation
- Secure multiparty computation goes live
- Security and composition of multiparty cryptographic protocols
- Smooth Projective Hashing and Two-Message Oblivious Transfer
Cited in
(20)- High-performance multi-party computation for binary circuits based on oblivious transfer
- Adaptive security of practical garbling schemes
- Asymptotically quasi-optimal cryptography
- On the power of secure two-party computation
- Fast garbling of circuits under standard assumptions
- On the Power of Secure Two-Party Computation
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- Garbling XOR gates ``for free in the standard model
- Efficient implementation of the Orlandi protocol
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
- Secure two-party computation is practical
- Recursive hiding of biometrics-based secret sharing scheme using adversary structure
- Garbled circuits as randomized encodings of functions: a primer
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Faster secure two-party computation in the single-execution setting
- Revisiting the Efficiency of Malicious Two-Party Computation
- Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender
- One-Sided Adaptively Secure Two-Party Computation
- Breaking and fixing garbled circuits when a gate has duplicate input wires
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
This page was built for publication: Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540034)
