Large message homomorphic secret sharing from DCR and applications
From MaRDI portal
(Redirected from Publication:2129016)
Recommendations
Cites work
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
- Breaking the circuit size barrier for secure computation under DDH
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Foundations of homomorphic secret sharing
- Homomorphic secret sharing from Paillier encryption
- Homomorphic secret sharing from lattices without FHE
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Software protection and simulation on oblivious RAMs
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Trapdoor hash functions and their applications
Cited in
(36)- Non-interactive distributed point functions
- Homomorphic secret sharing with verifiable evaluation
- A note on low-communication secure multiparty computation via circuit depth-reduction
- Rate-1 arithmetic garbling from homomorphic secret sharing
- On homomorphic secret sharing from polynomial-modulus LWE
- 3-party distributed ORAM from oblivious set membership
- Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Sublinear-communication secure multiparty computation does not require FHE
- Foundations of homomorphic secret sharing
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
- 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
- Succinct line-point zero-knowledge arguments from homomorphic secret sharing
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
- Threshold homomorphic secret sharing: definitions and constructions
- Privately constrained PRFs from DCR: puncturing and bounded Waring rank
- Pseudorandom correlation functions for garbled circuits
- Multiparty homomorphic secret sharing and more from LPN and MQ
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
- A unified framework for succinct garbling from homomorphic secret sharing
- Improved trade-offs between amortization and download bandwidth for linear HSS
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Succinct homomorphic secret sharing
- Efficient mixed garbling from homomorphic secret sharing and GGM-tree
- Enhanced trapdoor hashing from DDH and DCR
- Multi-key homomorphic secret sharing
- Constrained pseudorandom functions from homomorphic secret sharing
- 10-party sublinear secure computation from standard assumptions
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- A characterization of optimal-rate linear homomorphic secret sharing schemes, and applications
This page was built for publication: Large message homomorphic secret sharing from DCR and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129016)
