Placing conditional disclosure of secrets in the communication complexity universe

DOI10.1007/s00145-021-09376-1zbMath1467.94026OpenAlexW3130707145MaRDI QIDQ2035998

Benny Applebaum, Prashant Nalini Vasudevan

Publication date: 28 June 2021

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10097/

zbMATH Keywords

communication complexity secret-sharing information-theoretic cryptography conditional disclosure of secrets

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Communication theory (94A05)

Related Items (2)

Quadratic secret sharing and conditional disclosure of secrets ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers

Cites Work

Unnamed Item
Unnamed Item
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
From laconic zero-knowledge to public-key cryptography. Extended abstract
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
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
Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
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
The complexity of multiparty PSM protocols and related models
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
Optimal linear multiparty conditional disclosure of secrets protocols
Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
A minimal model for secure computation (extended abstract)
On the randomness complexity of efficient sampling
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
Three XOR-Lemmas — An Exposition
Small-Bias Probability Spaces: Efficient Constructions and Applications
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*
Simple Constructions of Almost k-wise Independent Random Variables
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
The knowledge complexity of interactive proof-systems
Communication Complexity
Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits
On the Power of Statistical Zero Knowledge
Partial Garbling Schemes and Their Applications
Shannon Impossibility, Revisited
Breaking the circuit-size barrier in secret sharing
On the Randomness of Independent Experiments
Advances in Cryptology - EUROCRYPT 2004
Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
On the Cryptographic Complexity of the Worst Functions
Dual System Encryption via Predicate Encodings
The communication complexity of private simultaneous messages, revisited
Watermarking cryptographic functionalities from standard lattice assumptions

This page was built for publication: Placing conditional disclosure of secrets in the communication complexity universe