10-party sublinear secure computation from standard assumptions

DOI10.1007/978-3-031-68400-5_2MaRDI QIDQ6653039

Geoffroy Couteau, Naman Kumar

Publication date: 13 December 2024

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constant ciphertext-rate non-committing encryption from standard assumptions
• 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
• Trapdoor hash functions and their applications
• Efficient pseudorandom correlation generators: silent OT extension and more
• Spooky Encryption and Its Applications
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Secure Two-Party Computation with Low Communication
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Function Secret Sharing
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• QUAD: A Practical Stream Cipher with Provable Security
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Fully homomorphic encryption using ideal lattices
• Communication preserving protocols for secure function evaluation
• Pseudorandom generators with long stretch and low locality from random local one-way functions
• Distributed Point Functions and Their Applications
• Sublinear-communication secure multiparty computation does not require FHE
• 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
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN

This page was built for publication: 10-party sublinear secure computation from standard assumptions