On \(d\)-multiplicative secret sharing
From MaRDI portal
Publication:604627
DOI10.1007/s00145-010-9056-zzbMath1201.94074OpenAlexW2043307264MaRDI QIDQ604627
Enav Weinreb, Omer Barkol, Yuval Ishai
Publication date: 12 November 2010
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-010-9056-z
Related Items (8)
Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ On the (in)efficiency of non-interactive secure multiparty computation ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Foundations of Homomorphic Secret Sharing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Player simulation and general adversary structures in perfect multiparty computation
- Security and composition of multiparty cryptographic protocols
- Computationally private randomizing polynomials and their applications
- Secure multi-party computation made simple
- How to share a secret
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- A Geometric Approach to Information-Theoretic Private Information Retrieval
- Founding Cryptography on Oblivious Transfer – Efficiently
- Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
- Privacy and Communication Complexity
- Communication Complexity of Simultaneous Messages
- Foundations of Cryptography
- Secure Computation from Random Error Correcting Codes
- OT-Combiners via Secure Computation
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
- A Zero-One Law for Boolean Privacy
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
This page was built for publication: On \(d\)-multiplicative secret sharing
