Non-interactive secure computation based on cut-and-choose

DOI10.1007/978-3-642-55220-5_22MaRDI QIDQ5418707zbMATH OpenOpenAlexFDO

Authors Arash Afshar, Payman Mohassel, Benny Pinkas, 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

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

Recommendations

• Reusable non-interactive secure computation
• Non-interactive secure 2PC in the offline/online and batch settings
• Concurrently composable non-interactive secure computation
• Non-interactive secure computation from one-way functions
• Efficient secure two-party computation using symmetric cut-and-choose

Cited in

(31)

• Pattern matching on encrypted streams
• Non-interactive secure computation from one-way functions
• Multiparty reusable non-interactive secure computation from LWE
• Unbounded multi-party computation from learning with errors
• Abuse resistant law enforcement access systems
• Succinct non-interactive secure computation
• On the round complexity of black-box secure MPC
• Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
• Efficient and scalable universal circuits
• Reusable non-interactive secure computation
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Secure quantum computation with classical communication
• Blockchains enable non-interactive MPC
• On garbling schemes with and without privacy
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
• Faster secure two-party computation in the single-execution setting
• Non-interactive secure 2PC in the offline/online and batch settings
• On the exact round complexity of secure three-party computation
• Black-box reusable NISC with random oracles
• Private polynomial commitments and applications to MPC
• Actively secure garbled circuits with constant communication overhead in the plain model
• Authenticated garbling from simple correlations
• mrNISC from LWE with polynomial modulus
• Concurrently composable non-interactive secure computation
• Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
• Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
• Policy compliant secure messaging
• Authenticated BitGC for actively secure rate-one 2PC
• Bitwise garbling schemes. A model with \(\frac{3}{2}\lambda \)-bit lower bound of ciphertexts
• Non-interactive blind signatures: post-quantum and stronger security
• Non-interactive secure computation with constant communication overhead

This page was built for publication: Non-interactive secure computation based on cut-and-choose

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418707)