Article

Free access

Computing on an anonymous ring

Authors:

Chagit Attiya,

Marc Snir,

Manfred WarmuthAuthors Info & Claims

PODC '85: Proceedings of the fourth annual ACM symposium on Principles of distributed computing

Pages 196 - 203

https://doi.org/10.1145/323596.323614

Published: 01 August 1985 Publication History

PDF eReader

References

[1]

D. Angluin, Local and global properties in networks of processors, Proceedings, 12th Annual ACM Symposium on Theory of Computing, 1980, pp. 82-93.

Digital Library

Google Scholar

[2]

C. Attiya, M. Snir and M. Warmuth, Computing on anonymous rings, Technical Report 85-2, Computer Science Dept., The Hebrew University, March 1985.

Digital Library

Google Scholar

[3]

D. Dolev, M. Klawe and M. Rodeh, An O(nlogn) unidirectional distributed algorithm for extremafinding in a circle, Journal of Algorithms, Vol. 3, No. 3, Sept 1982, pp. 245-260.

Crossref

Google Scholar

[4]

J. Pachl, E. Korach and D. Rotem, A new technique for proving lower bounds for distributed maximum-finding algorithms, Journal of the ACM, Vol. 31, No. 4, Oct 1984, pp. 905-918.

Digital Library

Google Scholar

[5]

G.L. Peterson, An O(nlg n) unidirectional algorithm for the circular extrema problem, Trans. prog. Lang. Sys. 4, 4 (1982) 758-762.

Digital Library

Google Scholar

Cited By

View all

Michail OSpirakis PTheofilatos M(2018)Simple and Fast Approximate Counting and Leader Election in PopulationsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-03232-6_11(154-169)Online publication date: 20-Oct-2018
https://doi.org/10.1007/978-3-030-03232-6_11
Spirakis PTampakas B(2011)Efficient distributed algorithms by using the archimedean time assumptionRAIRO - Theoretical Informatics and Applications10.1051/ita/198923010113123:1(113-128)Online publication date: 8-Jan-2011
https://doi.org/10.1051/ita/1989230101131
Ando EHirotaka Ono Kunihiko Sadakane Masafumi Yamashita (2008)The space complexity of the leader election in anonymous networks2008 IEEE International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2008.4536128(1-8)Online publication date: Apr-2008
https://doi.org/10.1109/IPDPS.2008.4536128
Show More Cited By

Index Terms

Computing on an anonymous ring

Recommendations

A novel privacy protection of permissioned blockchains with conditionally anonymous ring signature
Abstract
With the rapid development of permissioned blockchains, the problem of privacy leakage within permissioned blockchains is increasingly serious. In this paper, for the privacy problem in permissioned blockchains, a novel privacy protection method ...
Anonymous k-show credentials
EuroPKI'07: Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice

Privacy-preserving digital credentials are cryptographic tools that allow a user to prove a predicate about his/her identity or qualifications, without the verifying party learning additional information beyond the status of that predicate. The Identity ...
(α, k)-anonymous data publishing

Privacy preservation is an important issue in the release of data for mining purposes. The k-anonymity model has been introduced for protecting individual identification. Recent studies show that a more sophisticated model is necessary to protect the ...

Comments

Information & Contributors

Information

Published In

PODC '85: Proceedings of the fourth annual ACM symposium on Principles of distributed computing

August 1985

316 pages

ISBN:0897911687

DOI:10.1145/323596

Editors:
Michael Malcolm
Univ. of Waterloo, Waterloo, Ont., Canada
,
Ray Strong
IBM Research, San Jose, CA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1985

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC05

Sponsor:

PODC05: ACM Symposium on Principles of Distributed Computing

Ontario, Minaki, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
394
Total Downloads

Downloads (Last 12 months)86
Downloads (Last 6 weeks)27

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Michail OSpirakis PTheofilatos M(2018)Simple and Fast Approximate Counting and Leader Election in PopulationsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-03232-6_11(154-169)Online publication date: 20-Oct-2018
https://doi.org/10.1007/978-3-030-03232-6_11
Spirakis PTampakas B(2011)Efficient distributed algorithms by using the archimedean time assumptionRAIRO - Theoretical Informatics and Applications10.1051/ita/198923010113123:1(113-128)Online publication date: 8-Jan-2011
https://doi.org/10.1051/ita/1989230101131
Ando EHirotaka Ono Kunihiko Sadakane Masafumi Yamashita (2008)The space complexity of the leader election in anonymous networks2008 IEEE International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2008.4536128(1-8)Online publication date: Apr-2008
https://doi.org/10.1109/IPDPS.2008.4536128
Kranakis EKrizanc Dvan den Berg J(2005)Computing boolean functions on anonymous networksAutomata, Languages and Programming10.1007/BFb0032037(254-267)Online publication date: 27-Jun-2005
https://doi.org/10.1007/BFb0032037
Allenberg-Navony NItai AMoran S(2005)Average and randomized complexity of distributed problemsDistributed Algorithms10.1007/BFb0020442(311-325)Online publication date: 10-Jun-2005
https://doi.org/10.1007/BFb0020442
Alimonti PFlocchini PSantoro N(2005)Finding the extrema of a distributed multisetDistributed Algorithms10.1007/BFb0020432(164-178)Online publication date: 10-Jun-2005
https://doi.org/10.1007/BFb0020432
Spirakis PTampakas BTsiolis A(2005)Symmetry breaking in asynchronous rings with o(n) messagesDistributed Algorithms10.1007/3-540-51687-5_46(233-241)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-51687-5_46
Matias YAfek Y(2005)Simple and efficient election algorithms for anonymous networksDistributed Algorithms10.1007/3-540-51687-5_42(183-194)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-51687-5_42
Bhaskar SBuckley G(2005)Computations in undistinguished networksFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-18625-5_47(124-137)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-18625-5_47
Leeuwen JSantoro NUrrutia JZaks S(2005)Guessing games and distributed computations in synchronous networksAutomata, Languages and Programming10.1007/3-540-18088-5_29(347-356)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-18088-5_29
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A novel privacy protection of permissioned blockchains with conditionally anonymous ring signature

Anonymous k-show credentials

(α, k)-anonymous data publishing

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

A novel privacy protection of permissioned blockchains with conditionally anonymous ring signature

Anonymous k-show credentials

(α, k)-anonymous data publishing

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations