A Randomness-Rounds Tradeoff in Private Computation
Authors:
- 13 July 2001
- book chapter
- Published by Springer Nature
- p. 397-410
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Randomness in interactive proofs2002
- On the structure of the privacy hierarchyJournal of Cryptology, 1994
- Bounds on tradeoffs between randomness and communication complexitycomputational complexity, 1993
- A communication-privacy tradeoff for modular additionInformation Processing Letters, 1993
- A Zero-One Law for Boolean PrivacySIAM Journal on Discrete Mathematics, 1991
- Non-cryptographic fault-tolerant computing in constant number of rounds of interaction1989
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Multiparty unconditionally secure protocols1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984