Succinct computational secret sharing
From MaRDI portal
Cites work
- A Pseudorandom Generator from any One-way Function
- An impossibility result on graph secret sharing
- Better secret sharing via robust conditional disclosure of secrets
- Breaking the circuit-size barrier in secret sharing
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- Conditional disclosure of secrets via non-linear reconstruction
- Covering a graph by complete bipartite graphs
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Dual System Encryption via Predicate Encodings
- Efficient pseudorandom correlation generators: silent OT extension and more
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Foundations of Cryptography
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- How to share a secret
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1024051 (Why is no real title available?)
- scientific article; zbMATH DE number 1024079 (Why is no real title available?)
- scientific article; zbMATH DE number 1101416 (Why is no real title available?)
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Laconic oblivious transfer and its applications
- Multiple assignment scheme for sharing secret
- On secret sharing systems
- On the classification of ideal secret sharing schemes
- On the communication complexity of secure function evaluation with long output
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the Cryptographic Complexity of the Worst Functions
- On the information rate of perfect secret sharing schemes
- On the Power of Nonlinear Secret-Sharing
- On the size of shares for secret sharing schemes
- On-line secret sharing
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Partial garbling schemes and their applications
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Progress in Cryptology - INDOCRYPT 2003
- Protecting data privacy in private information retrieval schemes
- Public-coin differing-inputs obfuscation and its applications
- Secret Sharing and Statistical Zero Knowledge
- Secret sharing lower bound: either reconstruction is hard or shares are long
- Secret sharing on the \(d\)-dimensional cube
- Secret sharing schemes for graph-based prohibited structures
- Secret sharing schemes on graphs
- Secret-sharing for NP
- Secret-sharing schemes for general and uniform access structures
- Secret-sharing schemes for very dense graphs
- Secure multiparty computation with general interaction patterns
- Some improved bounds on the information rate of perfect secret sharing schemes
- Strongly exponential lower bounds for monotone computation
- Superpolynomial lower bounds for monotone span programs
- The share size of secret-sharing schemes for almost all access structures and graphs
- The size of a share must be large
- Tight bounds on the information rate of secret sharing schemes
- Towards breaking the exponential barrier for general secret sharing
- Trapdoor hash functions and their applications
- Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ
Cited in
(16)- Cryptography from planted graphs: security with logarithmic-size messages
- Randomness recoverable secret sharing schemes
- Fully anonymous secret sharing
- How to make any computational secret sharing scheme adaptively secure
- TinyLabels: how to compress garbled circuit input labels, efficiently
- A generic approach to adaptively-secure broadcast encryption in the plain model
- Evolving secret sharing revisited: computational security and succinctness
- Secret-sharing schemes for high slices
- Reducing the share size of weighted threshold secret sharing schemes via Chow parameters approximation
- Evolving secret sharing made short
- Taming adaptive security and new access structures in evolving secret sharing
- Succinct computational secret sharing for monotone circuits
- Succinct witness encryption for batch languages and applications
- Cryptography with weak privacy
- Traceable secret sharing revisited
- Distributed monotone-policy encryption for DNFs from lattices
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)
