Foundations of Homomorphic Secret Sharing
From MaRDI portal
Publication:4993284
DOI10.4230/LIPIcs.ITCS.2018.21zbMath1462.94053OpenAlexW2783978526MaRDI QIDQ4993284
Huijia Lin, Elette Boyle, Niv Gilboa, Stefano Tessaro, Yuval Ishai
Publication date: 15 June 2021
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8365/pdf/LIPIcs-ITCS-2018-21.pdf/
cryptographycommunication complexitysecure computationhomomorphic secret sharingworst-case to average-case reductions.
Authentication, digital signatures and secret sharing (94A62) Communication complexity, information complexity (68Q11)
Related Items (29)
Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Evolving homomorphic secret sharing for hierarchical access structures ⋮ Large message homomorphic secret sharing from DCR and applications ⋮ Two-round MPC: information-theoretic and black-box ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ CNF-FSS and Its Applications ⋮ From FE combiners to secure MPC and back ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Multi-client oblivious RAM with poly-logarithmic communication ⋮ Homomorphic secret sharing for low degree polynomials ⋮ An optimal distributed discrete log protocol with applications to homomorphic secret sharing ⋮ Formalisation of Bayesian concealment ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Threshold garbled circuits and ad hoc secure computation ⋮ A geometric approach to homomorphic secret sharing ⋮ BETA: biometric-enabled threshold authentication ⋮ Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(d\)-multiplicative secret sharing
- Lower bounds for linear locally decodable codes and private information retrieval
- On randomized one-round communication complexity
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
- Homomorphic secret sharing from Paillier encryption
- Security and composition of multiparty cryptographic protocols
- Computationally private randomizing polynomials and their applications
- Spooky Encryption and Its Applications
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- 2-Server PIR with Sub-Polynomial Communication
- Function Secret Sharing
- How to share a secret
- Private information retrieval
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- On the efficiency of local decoding procedures for error-correcting codes
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Fully Homomorphic Encryption over the Integers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- New directions in cryptography
- The Probabilistic Communication Complexity of Set Intersection
- Designing programs that check their work
- Communication Complexity of Simultaneous Messages
- Foundations of Cryptography
- Communication Complexity
- Average-case fine-grained hardness
- 3-query locally decodable codes of subexponential length
- Fully homomorphic encryption using ideal lattices
- Distributed Point Functions and Their Applications
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Cryptography in $NC^0$
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Pseudorandom generators without the XOR lemma
This page was built for publication: Foundations of Homomorphic Secret Sharing
