Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations

DOI10.1007/978-3-319-63688-7_24zbMATH Open1407.94072OpenAlexW2605201962MaRDI QIDQ1675751FDOQ1675751

Pavel Raykov, Barak Arkis, Benny Applebaum, Prashant Nalini Vasudevan

Publication date: 3 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_24

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (13)

• Improved polynomial secret-sharing schemes
• On the exact round complexity of secure three-party computation
• Title not available (Why is that?)
• On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
• Measuring, simulating and exploiting the head concavity phenomenon in BKZ
• The communication complexity of private simultaneous messages, revisited
• Placing conditional disclosure of secrets in the communication complexity universe
• Some Open Problems in Information-Theoretic Cryptography
• Statistical difference beyond the polarizing regime
• Multi-party PSM, revisited: improved communication and unbalanced communication
• 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

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)