Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN

DOI10.1007/978-3-031-38545-2_11OpenAlexW4385654331MaRDI QIDQ6186715FDOQ6186715

Authors: Quang Dao, Yuval Ishai, Aayush Jain, Huijia Lin 

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_11

zbMATH Keywords

homomorphic secret sharingsparse learning parity with noise

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Fully homomorphic encryption with polylog overhead
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Fully homomorphic encryption using ideal lattices
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Relations between average case complexity and approximation complexity
• (Leveled) fully homomorphic encryption without bootstrapping
• Circular-Secure Encryption from Decision Diffie-Hellman
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Public-key cryptography from different assumptions
• Candidate one-way functions based on expander graphs
• Cryptography with constant computational overhead
• Title not available (Why is that?)
• On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
• On Pseudorandom Generators with Linear Stretch in NC0
• Communication preserving protocols for secure function evaluation
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Homomorphic secret sharing from Paillier encryption
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Threshold cryptosystems from threshold fully homomorphic encryption
• Secure arithmetic computation with constant computational overhead
• Spooky Encryption and Its Applications
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Function Secret Sharing
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• Foundations of Homomorphic Secret Sharing
• Two Round Multiparty Computation via Multi-key FHE
• Distributed Point Functions and Their Applications
• Worst-case hardness for LPN and cryptographic hashing via code smoothing
• Sum of squares lower bounds for refuting any CSP
• Homomorphic secret sharing for low degree polynomials
• Sublinear-communication secure multiparty computation does not require FHE
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
• Homomorphic secret sharing from lattices without FHE
• Efficient pseudorandom correlation generators: silent OT extension and more
• Algebraic attacks against random local functions and their countermeasures
• A geometric approach to homomorphic secret sharing
• Universally Composable Oblivious Transfer Based on a Variant of LPN
• Large message homomorphic secret sharing from DCR and applications
• Indistinguishability obfuscation from well-founded assumptions
• An algebraic framework for silent preprocessing with trustless setup and active security
• Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error

Cited In (5)

• Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
• Succinct homomorphic secret sharing
• A systematic study of sparse LWE
• Lossy cryptography from code-based assumptions
• 10-party sublinear secure computation from standard assumptions

This page was built for publication: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN

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