Conditional disclosure of secrets via non-linear reconstruction
From MaRDI portal
Publication:1675752
DOI10.1007/978-3-319-63688-7_25zbMATH Open1407.94140OpenAlexW2741846989MaRDI QIDQ1675752FDOQ1675752
Authors: Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee
Publication date: 3 November 2017
Full work available at URL: https://hdl.handle.net/1721.1/137871
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 (26)
- Title not available (Why is that?)
- Cryptography from planted graphs: security with logarithmic-size messages
- Improved polynomial secret-sharing schemes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- 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
- Quadratic secret sharing and conditional disclosure of secrets
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- The communication complexity of private simultaneous messages, revisited
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Improved fully adaptive decentralized MA-ABE for NC1 from MDDH
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin
- Placing conditional disclosure of secrets in the communication complexity universe
- Some Open Problems in Information-Theoretic Cryptography
- On abelian and homomorphic secret sharing schemes
- Multi-party PSM, revisited: improved communication and unbalanced communication
- Succinct computational secret sharing
- Inner-product functional encryption with fine-grained access control
- A New Protocol for Conditional Disclosure of Secrets and Its Applications
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
- Optimal linear multiparty conditional disclosure of secrets protocols
- Local bounds for the optimal information ratio of secret sharing schemes
- Verification protocol for stable matching from conditional disclosure of secrets
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)