Asynchronous Perfectly Secure Communication over One-Time Pads
暂无分享,去创建一个
[1] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[2] Alexander A. Shvartsman,et al. Efficient parallel algorithms can be made robust , 1989, PODC '89.
[3] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[4] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[5] Dariusz R. Kowalski,et al. Performing work with asynchronous processors: message-delay-sensitive bounds , 2003, PODC '03.
[6] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[7] Moti Yung,et al. Time-optimal message-efficient work performance in the presence of faults , 1994, PODC '94.
[8] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[9] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[10] Prabhakar Ragde,et al. Parallel Algorithms with Processor Failures and Delays , 1996, J. Algorithms.
[11] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .
[12] Joseph Y. Halpern,et al. Performing Work Efficiently in the Presence of Faults , 1998, SIAM J. Comput..
[13] Richard J. Anderson,et al. Algorithms for the Certified Write-All Problem , 1997, SIAM J. Comput..
[14] James Aspnes,et al. Randomized protocols for asynchronous consensus , 2002, Distributed Computing.
[15] Jan Friso Groote,et al. An algorithm for the asynchronous Write-All problem based on process collision , 2001, Distributed Computing.
[16] Michael Luby,et al. Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.