Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
From MaRDI portal
(Redirected from Publication:5149756)
Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations (scientific article; zbMATH DE number 7307640)
Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations (scientific article; zbMATH DE number 7307640)
Recommendations
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Placing conditional disclosure of secrets in the communication complexity universe
- Conditional disclosure of secrets via non-linear reconstruction
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- Optimal linear multiparty conditional disclosure of secrets protocols
Cites work
- A complete problem for statistical zero knowledge
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A minimal model for secure computation (extended abstract)
- A note on amortized branching program complexity
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Analyzing randomized search heuristics: tools from probability theory
- Breaking the circuit-size barrier in secret sharing
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- Conditional disclosure of secrets via non-linear reconstruction
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Dual System Encryption via Predicate Encodings
- Extracting correlations
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- Fuzzy Identity-Based Encryption
- Generic transformations of predicate encodings: constructions and applications
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- scientific article; zbMATH DE number 1256785 (Why is no real title available?)
- scientific article; zbMATH DE number 1024000 (Why is no real title available?)
- Impossibility of succinct quantum proofs for collision-freeness
- Indistinguishability Amplification
- Linear secret-sharing schemes for forbidden graph access structures
- Lower Bounds for Quantum Communication Complexity
- On the asymptotic behaviour of some towers of function fields over finite fields
- On the classification of ideal secret sharing schemes
- On the Cryptographic Complexity of the Worst Functions
- On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
- On the size of shares for secret sharing schemes
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Optimal linear multiparty conditional disclosure of secrets protocols
- Partial garbling schemes and their applications
- Placing conditional disclosure of secrets in the communication complexity universe
- Private information retrieval
- Protecting data privacy in private information retrieval schemes
- Quantum lower bound for the collision problem with small range
- Secret sharing with binary shares
- Secret-sharing schemes for general and uniform access structures
- Secure Computation from Random Error Correcting Codes
- The communication complexity of private simultaneous messages, revisited
- The complexity of multiparty PSM protocols and related models
- The pattern matrix method
- Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
- Towards breaking the exponential barrier for general secret sharing
- Zero-information protocols and unambiguity in Arthur-Merlin communication (extended abtract)
Cited in
(11)- On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Conditional disclosure of secrets via non-linear reconstruction
- Optimal linear multiparty conditional disclosure of secrets protocols
- Placing conditional disclosure of secrets in the communication complexity universe
- Quadratic secret sharing and conditional disclosure of secrets
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- Placing conditional disclosure of secrets in the communication complexity universe
- The communication complexity of private simultaneous messages, revisited
- Simplified PIR and CDS protocols and improved linear secret-sharing schemes
- Card-based protocols imply PSM protocols
This page was built for publication: Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149756)
