By Topic

Decentralized voting protocols

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Nakajima, A. ; IBM Res., Tokyo, Japan

Decentralized voting protocols, in which all nodes execute the same protocol and reach the same result in a decentralized and autonomous way, are proposed. When a decentralized voting protocol is implemented by using one-round message exchange, it requires n( n-1) messages, where n is the number of nodes. The number of messages can be reduced by using multiple-round message exchange. The computation in each node is described in terms of a finite-state automaton, and communication structures for it are given. It is shown that kn(n1k/ - 1) messages are sufficient when messages are exchanged in k rounds

Published in:

Autonomous Decentralized Systems, 1993. Proceedings. ISADS 93., International Symposium on

Date of Conference: