Succinct computational secret sharing
From MaRDI portal
Publication:6499321
DOI10.1145/3564246.3585127MaRDI QIDQ6499321FDOQ6499321
Authors: Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan 
Publication date: 8 May 2024
Cites Work
- How to share a secret
- A Pseudorandom Generator from any One-way Function
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Cryptography
- On the classification of ideal secret sharing schemes
- Multiple assignment scheme for sharing secret
- Some improved bounds on the information rate of perfect secret sharing schemes
- On the size of shares for secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On secret sharing systems
- An impossibility result on graph secret sharing
- Tight bounds on the information rate of secret sharing schemes
- Covering a graph by complete bipartite graphs
- The size of a share must be large
- Superpolynomial lower bounds for monotone span programs
- Secret-sharing schemes for very dense graphs
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Title not available (Why is that?)
- Secret sharing schemes on graphs
- On the Cryptographic Complexity of the Worst Functions
- Title not available (Why is that?)
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Protecting data privacy in private information retrieval schemes
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On-line secret sharing
- Public-coin differing-inputs obfuscation and its applications
- Title not available (Why is that?)
- Secret-sharing schemes for general and uniform access structures
- Title not available (Why is that?)
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- On the Power of Nonlinear Secret-Sharing
- Laconic oblivious transfer and its applications
- Dual System Encryption via Predicate Encodings
- Secret Sharing and Statistical Zero Knowledge
- Progress in Cryptology - INDOCRYPT 2003
- Secure multiparty computation with general interaction patterns
- Secret sharing schemes for graph-based prohibited structures
- Strongly exponential lower bounds for monotone computation
- Towards breaking the exponential barrier for general secret sharing
- Conditional disclosure of secrets via non-linear reconstruction
- Secret-sharing for NP
- Indistinguishability obfuscation for Turing machines with unbounded memory
- On the communication complexity of secure function evaluation with long output
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- Partial garbling schemes and their applications
- Breaking the circuit-size barrier in secret sharing
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Secret sharing on the \(d\)-dimensional cube
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Trapdoor hash functions and their applications
- The share size of secret-sharing schemes for almost all access structures and graphs
- Secret sharing lower bound: either reconstruction is hard or shares are long
- Efficient pseudorandom correlation generators: silent OT extension and more
- Better secret sharing via robust conditional disclosure of secrets
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
Cited In (2)
This page was built for publication: Succinct computational secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499321)
