Conditional disclosure of secrets via non-linear reconstruction
From MaRDI portal
Publication:1675752
Recommendations
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Optimal linear multiparty conditional disclosure of secrets protocols
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Placing conditional disclosure of secrets in the communication complexity universe
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
Cited in
(28)- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- On the inner product predicate and a generalization of matching vector families
- Placing conditional disclosure of secrets in the communication complexity universe
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
- Local bounds for the optimal information ratio of secret sharing schemes
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Succinct computational secret sharing
- Verification protocol for stable matching from conditional disclosure of secrets
- On abelian and homomorphic secret sharing schemes
- A New Protocol for Conditional Disclosure of Secrets and Its Applications
- Cryptography from planted graphs: security with logarithmic-size messages
- Improved polynomial secret-sharing schemes
- Improved fully adaptive decentralized MA-ABE for NC1 from MDDH
- Towards breaking the exponential barrier for general secret sharing
- Inner-product functional encryption with fine-grained access control
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Optimal linear multiparty conditional disclosure of secrets protocols
- Quadratic secret sharing and conditional disclosure of secrets
- The communication complexity of private simultaneous messages, revisited
- Threshold secret sharing requires a linear-size alphabet
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs
- Multi-party PSM, revisited: improved communication and unbalanced communication
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- scientific article; zbMATH DE number 7559047 (Why is no real title available?)
- Some open problems in information-theoretic cryptography
This page was built for publication: Conditional disclosure of secrets via non-linear reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675752)
