Placing conditional disclosure of secrets in the communication complexity universe
type: Item
instance of: scholarly article
title: Placing conditional disclosure of secrets in the communication complexity universe
zbMATH Open document ID: 1467.94026
author: Benny Applebaum
author: Prashant Nalini Vasudevan
published in: Journal of Cryptology
publication date: 2021-06-28T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10097/
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 7363724
zbMATH Keywords: conditional disclosure of secrets
zbMATH Keywords: communication complexity
zbMATH Keywords: information-theoretic cryptography
zbMATH Keywords: secret-sharing
MaRDI profile type: Publication
OpenAlex ID: W3130707145
cites work: On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
cites work: Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
cites work: Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
cites work: Simple Constructions of Almost k-wise Independent Random Variables
cites work: The communication complexity of private simultaneous messages, revisited
cites work: Q2778845
cites work: From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
cites work: Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits
cites work: Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
cites work: On the Power of Statistical Zero Knowledge
cites work: On the classification of ideal secret sharing schemes
cites work: From laconic zero-knowledge to public-key cryptography. Extended abstract
cites work: Linear secret-sharing schemes for forbidden graph access structures
cites work: On the Cryptographic Complexity of the Worst Functions
cites work: The complexity of multiparty PSM protocols and related models
cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
cites work: Optimal linear multiparty conditional disclosure of secrets protocols
cites work: On the size of shares for secret sharing schemes
cites work: On the randomness complexity of efficient sampling
cites work: Shannon Impossibility, Revisited
cites work: A minimal model for secure computation (extended abstract)
cites work: Q4341773
cites work: Protecting data privacy in private information retrieval schemes
cites work: Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
cites work: The knowledge complexity of interactive proof-systems
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Three XOR-Lemmas — An Exposition
cites work: Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
cites work: The landscape of communication complexity classes
cites work: On the Randomness of Independent Experiments
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Secure Multiparty Computation with Minimal Interaction
cites work: Partial Garbling Schemes and Their Applications
cites work: Communication Complexity
cites work: On randomized one-round communication complexity
cites work: Watermarking cryptographic functionalities from standard lattice assumptions
cites work: Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
cites work: Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
cites work: Breaking the circuit-size barrier in secret sharing
cites work: Conditional disclosure of secrets via non-linear reconstruction
cites work: Towards breaking the exponential barrier for general secret sharing
cites work: On data structures and asymmetric communication complexity
cites work: Private vs. common random bits in communication complexity
cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications
cites work: Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
cites work: Communication Theory of Secrecy Systems*
cites work: A complete problem for statistical zero knowledge
cites work: Dual System Encryption via Predicate Encodings
DOI: 10.1007/S00145-021-09376-1
description: scientific article; zbMATH DE number 7363724