Succinct homomorphic secret sharing
From MaRDI portal
Publication:6637573
DOI10.1007/978-3-031-58751-1_11MaRDI QIDQ6637573FDOQ6637573
Authors: Damiano Abram, Lawrence Roy, Peter Scholl 
Publication date: 13 November 2024
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- Communication preserving protocols for secure function evaluation
- On the power of correlated randomness in secure computation
- A note on the communication complexity of multiparty computation in the correlated randomness model
- Breaking the circuit size barrier for secure computation under DDH
- Sublinear-communication secure multiparty computation does not require FHE
- Trapdoor hash functions and their applications
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
- Homomorphic secret sharing from lattices without FHE
- Efficient pseudorandom correlation generators: silent OT extension and more
- Large message homomorphic secret sharing from DCR and applications
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- An algebraic framework for silent preprocessing with trustless setup and active security
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Succinct homomorphic secret sharing
Cited In (4)
This page was built for publication: Succinct homomorphic secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637573)
