Secure Two-Party Computation Is Practical
From MaRDI portal
Publication:3650696
DOI10.1007/978-3-642-10366-7_15zbMath1267.94091OpenAlexW1521253015MaRDI QIDQ3650696
Stephen C. Williams, Thomas Schneider, Benny Pinkas, Nigel P. Smart
Publication date: 15 December 2009
Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_15
Related Items (35)
Three halves make a whole? Beating the half-gates lower bound for garbled circuits ⋮ Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Garbling XOR gates ``for free in the standard model ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ Adaptive security of practical garbling schemes ⋮ Garbled circuits with sublinear evaluator ⋮ Fast garbling of circuits under standard assumptions ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack ⋮ Breaking and fixing garbled circuits when a gate has duplicate input wires ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Fully homomorphic SIMD operations ⋮ On multiparty garbling of arithmetic circuits ⋮ Secure two-party computation in a quantum world ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Privacy-preserving self-helped medical diagnosis scheme based on secure two-party computation in wireless sensor networks ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ On the power of secure two-party computation ⋮ On the Power of Secure Two-Party Computation ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ ⋮ SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates ⋮ Stacked garbling. Garbled circuit proportional to longest execution path ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Hashing Garbled Circuits for Free
This page was built for publication: Secure Two-Party Computation Is Practical
