Sublinear-communication secure multiparty computation does not require FHE
From MaRDI portal
Publication:6061356
DOI10.1007/978-3-031-30617-4_6MaRDI QIDQ6061356
Pierre-Jean Meyer, Elette Boyle, Geoffroy Couteau
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62) Privacy of data (68P27) Communication complexity, information complexity (68Q11)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homomorphic secret sharing from Paillier encryption
- The size and depth of layered Boolean circuits
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Large message homomorphic secret sharing from DCR and applications
- Batch-OT with optimal rate
- Homomorphic secret sharing from lattices without FHE
- A note on the communication complexity of multiparty computation in the correlated randomness model
- Spooky Encryption and Its Applications
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Constrained Pseudorandom Functions and Their Applications
- Secure Two-Party Computation with Low Communication
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Function Secret Sharing
- An n logn Lower Bound on Synchronous Combinational Complexity
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Homomorphic Secret Sharing
- Fully homomorphic encryption using ideal lattices
- Communication preserving protocols for secure function evaluation
- Functional Signatures and Pseudorandom Functions
- Distributed Point Functions and Their Applications
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- On lattices, learning with errors, random linear codes, and cryptography
- Sublinear secure computation from new assumptions
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- An algebraic framework for silent preprocessing with trustless setup and active security
This page was built for publication: Sublinear-communication secure multiparty computation does not require FHE
