Non-Interactive Secure Computation Based on Cut-and-Choose

DOI10.1007/978-3-642-55220-5_22zbMath1332.94053OpenAlexW319908677MaRDI QIDQ5418707

Benny Pinkas, Arash Afshar, Payman Mohassel, Ben Riva

Publication date: 27 May 2014

Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_22

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (21)

On the round complexity of black-box secure MPC ⋮ Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Pattern matching on encrypted streams ⋮ Black-box reusable NISC with random oracles ⋮ Efficient and scalable universal circuits ⋮ Private polynomial commitments and applications to MPC ⋮ Authenticated garbling from simple correlations ⋮ Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Secure quantum computation with classical communication ⋮ Blockchains enable non-interactive MPC ⋮ Non-interactive secure computation from one-way functions ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ On the exact round complexity of secure three-party computation ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors ⋮ Abuse resistant law enforcement access systems ⋮ On Garbling Schemes with and Without Privacy ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Succinct non-interactive secure computation

This page was built for publication: Non-Interactive Secure Computation Based on Cut-and-Choose