Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Having particular address related cryptography
Reexamination Certificate
2005-10-18
2005-10-18
Revak, Christopher (Department: 2131)
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Having particular address related cryptography
C713S176000, C380S028000, C708S250000, C714S004110, C714S010000
Reexamination Certificate
active
06957331
ABSTRACT:
Byzantine Agreement requires a set of parties in a distributed system to agree on a value even if some parties are corrupted. The invention comprises a method for achieving agreement among participating network devices in an asynchronous network is disclosed that makes use of cryptography, specifically of threshold digital signatures and a distributed coin-tossing protocol.
REFERENCES:
patent: 6754845 (2004-06-01), Kursawe et al.
patent: 2002/0129087 (2002-09-01), Cachin et al.
patent: 2004/0156507 (2004-08-01), Dellow et al.
patent: 2004/0254967 (2004-12-01), Cachin
Feldman et al, “Optimal Algorithms for Byzantine Agreement” 1998, ACM, pp 148-161.
Krings et al, “A Byzantine Resilient Approach to Network Security” 1999, pp 1-2.
Zamsky, “A Randomized Agreement Protocol with Constant Expected Time and Guaranteed Termination in Optimal (Deterministic) Time”, 1996, ACM, pp 201-208.
Cachin et al, “Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography”, Aug. 14, 2000, 19thACM Symposium on Principles of Distributed Computing, pp 1-26.
Bellare et al, “Distributed Pseudo-Random Bit Generators—A New Way to Speed-Up Shared Coin Tossing” 1996, 15thAnnual ACM Symposium on the Principles of Distributed Computing, pp 1-16.
Cachin et al, “Secure and Efficient Asynchronous Broadcast Protocols,” Mar. 7, 2001, IBM Research, pp 1-49.
Cachin Christian
Kursawe Klaus
Shoup Victor
Cameron Douglas W.
Dougherty Anne Vachon
International Business Machines - Corporation
Revak Christopher
LandOfFree
Method of achieving multiple processor agreement in... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of achieving multiple processor agreement in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of achieving multiple processor agreement in... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3439829