A New Approach to Practical Active-Secure Two-Party Computation
From MaRDI portal
Publication:2914295
DOI10.1007/978-3-642-32009-5_40zbMath1296.94134arXiv1202.3052OpenAlexW1505629034MaRDI QIDQ2914295
Jesper Buus Nielsen, Sai Sheshank Burra, Claudio Orlandi, Peter Sebastian Nordholt
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.3052
Related Items
On various nonlinearity measures for Boolean functions ⋮ Oblivious TLS via multi-party computation ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Information-theoretic broadcast with dishonest majority for long messages ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ An efficient structural attack on NIST submission DAGS ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Actively Secure OT Extension with Optimal Overhead ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN ⋮ More efficient oblivious transfer extensions ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ The Simplest Protocol for Oblivious Transfer ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ High-throughput secure three-party computation with an honest majority ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Amortizing division and exponentiation ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ On compiling Boolean circuits optimized for secure multi-party computation ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ New cryptanalysis of LowMC with algebraic techniques ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ Secure computation with low communication from cross-checking ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Secure Multi-party Computation: Information Flow of Outputs and Game Theory ⋮ Efficient one-sided adaptively secure computation ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority ⋮ What security can we achieve within 4 rounds? ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Blazing fast OT for three-round UC OT extension ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ Network Oblivious Transfer ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ ⋮ Encryption Switching Protocols ⋮ Actively secure setup for SPDZ ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures ⋮ The price of active security in cryptographic protocols
Uses Software
