Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
DOI10.1137/18M1217097zbMath1459.94156OpenAlexW3119847519MaRDI QIDQ5149756
Prashant Nalini Vasudevan, Barak Arkis, Pavel Raykov, Benny Applebaum
Publication date: 8 February 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1217097
communication complexitysecret sharinginformation-theoretic cryptographyconditional disclosure of secrets
Cryptography (94A60) Information theory (general) (94A15) Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the classification of ideal secret sharing schemes
- On the size of shares for secret sharing schemes
- On the asymptotic behaviour of some towers of function fields over finite fields
- Protecting data privacy in private information retrieval schemes
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
- Towards breaking the exponential barrier for general secret sharing
- The complexity of multiparty PSM protocols and related models
- Generic transformations of predicate encodings: constructions and applications
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Conditional disclosure of secrets via non-linear reconstruction
- Linear secret-sharing schemes for forbidden graph access structures
- Optimal linear multiparty conditional disclosure of secrets protocols
- Secret-sharing schemes for general and uniform access structures
- Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
- From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
- A minimal model for secure computation (extended abstract)
- Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
- Private information retrieval
- The Pattern Matrix Method
- A complete problem for statistical zero knowledge
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- Indistinguishability Amplification
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Partial Garbling Schemes and Their Applications
- Extracting Correlations
- Breaking the circuit-size barrier in secret sharing
- Fuzzy Identity-Based Encryption
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Secure Computation from Random Error Correcting Codes
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Lower Bounds for Quantum Communication Complexity
- On the Cryptographic Complexity of the Worst Functions
- Dual System Encryption via Predicate Encodings
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- The communication complexity of private simultaneous messages, revisited
This page was built for publication: Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
