Controlled gradual disclosure schemes for random bits and their applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 435 LNCS, Issue , 1990, Pages 573-588

  Cleve, Richard ^a  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYMPTOTICALLY OPTIMAL; CRYPTOGRAPHIC PROBLEMS; PROTOCOL CANS; RANDOM BITS; RANDOM WALK; SINGLE-BIT; UNIFORM DISTRIBUTION;

CRYPTOGRAPHY;

EID: 85032862578     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/0-387-34805-0_50     Document Type: Conference Paper

References (15)

1. D. Beaver, and S. Goldwasser, “Multiparty Computation with Faulty Majority”, Advances in Cryptology — CRYPTO’ 89 Proc, these proceedings.
2. M. Blum., “How to Exchange (Secret) Keys”, Proc. 15th Ann. ACM Symp. on Theory of Computing, 1983, pp. 440-447.
3. M. Blum, and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits”, Proc. 23th Ann. IEEE Symp. on Foundations of Computer Science, 1982, pp. 112-117.
4. G. Brassard, C. Crépeau, and J.-M. Robert, “Information Theoretic Reductions Among Disclosure Problems”, Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science, 1986, pp. 168-173.
5. E. F. Brickell, D. Chaum, I. B. Damgård, and J. van de Graaf, “Gradual and Verifiable Release of a Secret”, Advances in Cryptology — CRYPTO’ 87 Proc, C. Pomerance (ed.), Lecture Notes in Computer Science 293, Springer, 1988, pp. 156-166.
6. O. Goldreich, S. Micali, and A. Wigderson, “Proofs That Yield Nothing But Their Validity and a Methodology for Cryptographic Protocol Design”, Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science, 1986, pp. 174-187.
7. O. Goldreich, S. Micali, and A. Wigderson, “How to Play Any Mental Game”, Proc. 19th Ann. ACM Symp. on Theory of Computing, 1987, pp. 218-229.
8. S. Goldwasser, S. Micali, “Probabilistic Encryption & How to Play Mental Poker, Keeping Secret All Partial Information”, Proc. 14th Ann. ACM Symp. on Theory of Computing, 1982, pp. 365-377.
9. J. Y. Halpern, and M. O. Rabin, “A Logic to Reason About Likelihood”, Proc. 15th Ann. ACM Symp. on Theory of Computing, 1983, pp. 310-319.
10. M. Luby, S. Micali, and C. Rackoff, C, “How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin”, Proc. 22nd Ann. IEEE Symp. on Foundations of Computer Science, 1983, pp. 11-21.
11. T. Tedrick, “How to Exchange Half a Bit”, Advances in Cryptology: Proc. of CRYPTO’ 83, D. Chaum (ed.), Plenum, 1984, pp. 147-151.
12. U. Vazirani, and V. Vazirani, V., “Trapdoor Pseudo-Random Number Generators, With Applications to Protocol Design”, Proc. 22nd Ann. IEEE Symp. on Foundations of Computer Science, 1983, pp. 23-30.
13. A. Yao, “Theory and Applications of Trapdoor Functions”, Proc. 21st Ann. IEEE Symp. on Foundations of Computer Science, 1982, pp. 80-91.
14. A. Yao, “Protocols for Secure Computations”, Proc. 21st Ann. IEEE Symp. on Foundations of Computer Science, 1982, pp.160-169.
15. A. Yao, “How to Generate and Exchange Secrets”, Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science, 1986, pp. 162-167.