PODC 2002
Author: Symposium on Principles of Distributed Computing. 21, 2002, Monterey, Calif..
Publisher:
Published: 2002
Total Pages: 298
ISBN-13: 9781581134858
DOWNLOAD EBOOK →Author: Symposium on Principles of Distributed Computing. 21, 2002, Monterey, Calif..
Publisher:
Published: 2002
Total Pages: 298
ISBN-13: 9781581134858
DOWNLOAD EBOOK →Author:
Publisher:
Published: 2003
Total Pages: 388
ISBN-13:
DOWNLOAD EBOOK →This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of parties. Given two numbers x and e, the protocol computes y such that ye=x (mod N). A synchronous protocol for this task has been presented by Catalano, Gennaro, and Halevi (Eurocrypt 2000), but the standard approach for turning this into an asynchronous protocol would require a Byzantine-agreement sub-protocol. Our protocol adopts their approach, but exploits a feature of the problem in order to avoid the use of a Byzantine agreement primitive. Hence, it leads to efficient asynchronous protocols for threshold signatures and for Byzantine agreement based on the strong RSA assumption, without the use of random oracles.
Author: Teruo Higashino
Publisher: Springer Science & Business Media
Published: 2005-07-20
Total Pages: 470
ISBN-13: 3540273247
DOWNLOAD EBOOK →This book constitutes the thoroughly refereed post-proceedings of the 8th International Conference on Principles of Distributed Systems, OPODIS 2004, held at Grenoble, France, in December 2004. The 30 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on design of distributed systems, ad-hoc networks and mobile agents, grid and networks, security, distributed algorithms, self-stabilization, sensor networks, and task/resource allocation.
Author:
Publisher: Association for Computing Machinery (ACM)
Published: 1997
Total Pages: 316
ISBN-13:
DOWNLOAD EBOOK →Author: Gadi Taubenfeld
Publisher: Springer Science & Business Media
Published: 2008-09-10
Total Pages: 536
ISBN-13: 3540877789
DOWNLOAD EBOOK →DISC, the International Symposium on Distributed Computing, is an annual forum for presentation of research on all aspects of distributed computing, - cluding the theory, design, implementation and applications of distributed - gorithms, systems and networks. The 22nd edition of DISC was held during September 22-24, 2008, in Arcachon, France. There were 101 submissions submitted to DISC this year and this volume contains 33 15-page-long regular papers selected by the Program Committee among these submissions. Every submitted paper was read and evaluated by ProgramCommittee membersassistedby externalreviewers.The ?nal decisions regarding acceptance or rejection of each paper were made during the electronic Program Committee meeting held during June 2008. Revised and expanded versions of a few best selected papers will be considered for publication in a special issue of the journal Distributed Computing. The Program Committee selected Robert Danek and Wojciech Golab as the recipientsofthis year'sBestPaperAwardfortheir paper “Closingthe Compl- ity Gap Between FCFS Mutual Exclusion and Mutual Exclusion.”The Program Committee selected Wojciech Wawrzyniak as the recipient of this year's Best Student Paper Award for the paper “Fast Distributed Approximations in P- nar Graphs” coauthored with Andrzej Czygrinow and Michal Han´ ´ckowiak.
Author: Marcos K. Aguilera
Publisher: Springer
Published: 2012-10-14
Total Pages: 465
ISBN-13: 3642336515
DOWNLOAD EBOOK →This book constitutes the refereed proceedings of the 26th International Symposium on Distributed Computing, DISC 2012, held in Salvador, Brazil, in October 2012. The 27 revised full papers presented together with 24 brief announcements were carefully reviewed and selected from 119 submissions. The papers are organized in topical sections on shared memory, mobile agents and overlay networks, wireless and multiple access channel networks, dynamic networks, distributed graph algorithms, wireless and loosely connected networks, robots, and lower bounds and separation.