Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
From MaRDI portal
Publication:1675751
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
Cited in
(15)- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- 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
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Improved polynomial secret-sharing schemes
- On the exact round complexity of secure three-party computation
- Inner-product functional encryption with fine-grained access control
- Conditional disclosure of secrets via non-linear reconstruction
- Statistical difference beyond the polarizing regime
- Optimal linear multiparty conditional disclosure of secrets protocols
- The communication complexity of private simultaneous messages, revisited
- 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: 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 Q1675751)
