scientific article; zbMATH DE number 7559047
From MaRDI portal
Publication:5090374
DOI10.4230/LIPIcs.ITCS.2019.4MaRDI QIDQ5090374
Prashant Nalini Vasudevan, Benny Applebaum
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Predicate encryption from bilinear maps and one-sided probabilistic rank ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
Cites Work
- Unnamed Item
- Unnamed Item
- On the classification of ideal secret sharing schemes
- Private vs. common random bits in communication complexity
- On data structures and asymmetric communication complexity
- On randomized one-round communication complexity
- On the size of shares for secret sharing schemes
- Protecting data privacy in private information retrieval schemes
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
- The landscape of communication complexity classes
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Conditional disclosure of secrets via non-linear reconstruction
- Linear secret-sharing schemes for forbidden graph access structures
- From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
- A minimal model for secure computation (extended abstract)
- Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
- A complete problem for statistical zero knowledge
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- Secure Multiparty Computation with Minimal Interaction
- Communication Theory of Secrecy Systems*
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Communication Complexity
- Partial Garbling Schemes and Their Applications
- Shannon Impossibility, Revisited
- Breaking the circuit-size barrier in secret sharing
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- On the Cryptographic Complexity of the Worst Functions
- Dual System Encryption via Predicate Encodings
- The communication complexity of private simultaneous messages, revisited
This page was built for publication:
