Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
- 11 February 2021
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 34 (2) , 1-45
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- A complete problem for statistical zero knowledgeJournal of the ACM, 2003
- Protecting Data Privacy in Private Information Retrieval SchemesJournal of Computer and System Sciences, 2000
- On Data Structures and Asymmetric Communication ComplexityJournal of Computer and System Sciences, 1998
- Small-Bias Probability Spaces: Efficient Constructions and ApplicationsSIAM Journal on Computing, 1993
- On the size of shares for secret sharing schemesJournal of Cryptology, 1993
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- Private vs. common random bits in communication complexityInformation Processing Letters, 1991
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- On the classification of ideal secret sharing schemesJournal of Cryptology, 1991
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988