LEGO for Two-Party Secure Computation
From MaRDI portal
Publication:3611777
DOI10.1007/978-3-642-00457-5_22zbMath1213.94124OpenAlexW1525012278MaRDI QIDQ3611777
Claudio Orlandi, Jesper Buus Nielsen
Publication date: 3 March 2009
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_22
Related Items (22)
Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Round optimal black-box ``commit-and-prove ⋮ Garbling XOR gates ``for free in the standard model ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ Reactive Garbling: Foundation, Instantiation, Application ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ On multiparty garbling of arithmetic circuits ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Abuse resistant law enforcement access systems ⋮ How to Prove Knowledge of Small Secrets ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ The price of active security in cryptographic protocols
This page was built for publication: LEGO for Two-Party Secure Computation
