More Books:

Distributed Computing and Cryptography
Language: en
Pages: 262
Authors: Joan Feigenbaum
Categories: Computers
Type: BOOK - Published: 1991 - Publisher: American Mathematical Soc.

This book, the second volume in the DIMACS book series and published jointly with the Association for Computing Machinery, contains the proceedings of a workshop held in Princeton, New Jersey, in October 1989. The workshop, which drew seventy-four participants from five countries, addressed a wide range of practical and theoretical
DIMACS Workshop on Distributed Computing and Cryptography
Language: en
Pages: 44
Authors: Joan Feigenbaum
Categories: Data encryption (Computer science)
Type: BOOK - Published: 1990 - Publisher:

Books about DIMACS Workshop on Distributed Computing and Cryptography
Distributed Computing and Networking
Language: en
Pages: 466
Authors: Davide Frey, Michel Raynal, Saswati Sarkar, Rudrapatna K. Shyamasundar, Prasun Sinha
Categories: Computers
Type: BOOK - Published: 2013-01-05 - Publisher: Springer

This book constitutes the refereed proceedings of the 14th International Conference on Distributed Computing and Networking, ICDCN 2013, held in Mumbai, India, during January 3-6, 2013. The 27 revised full papers, 5 short papers presented together with 7 poster papers were carefully reviewed and selected from 149 submissions. The papers
Distributed Computing and Cryptography
Language: en
Pages: 262
Authors: Joan Feigenbaum, Michael Merritt
Categories: Cryptography
Type: BOOK - Published: 1991 - Publisher:

Books about Distributed Computing and Cryptography
Distributed Computing and Cryptography with General Weak Random Sources
Language: en
Pages: 630
Authors: Xin Li (Writer on aquatic ecosystems)
Categories: Cryptography
Type: BOOK - Published: 2011 - Publisher:

The use of randomness in computer science is ubiquitous. Randomized protocols have turned out to be much more efficient than their deterministic counterparts. In addition, many problems in distributed computing and cryptography are impossible to solve without randomness. However, these applications typically require uniform random bits, while in practice almost