Article

Free access

Generalized FLP impossibility result for t-resilient asynchronous computations

Authors:

Elizabeth Borowsky,

Eli GafniAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 91 - 100

https://doi.org/10.1145/167088.167119

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

Y. Afek. H. Attiya, D. Dolev, E. Gafni, M. Merritt and N. Sha.vit. "Atomic Snapshots of Shared Memory", Proc. 9th A CM Symp. on Principles of Distributed Computing, pages 1- 14, 1990.

Digital Library

Google Scholar

[2]

It. Attiya, A. Ba.r-Noy and D. Dolev, "Sharing Memory Robustly in Message Passing Systems", Proc. 9th A CM Syntp. on Principles of Distributed Computing, pages 363-375. 1990.

Digital Library

Google Scholar

[3]

H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk, "Achievable Cases in an Asynchronous Environment", Proc. 28th IEEE Symp. on Foundations of Computer Science, pages 337-346, 1987.

Digital Library

Google Scholar

[4]

O. Bira.n, S. Moran, and S. Zaks, "A Combinatorial Chara.cterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor", Proc. 7th A C3I Syrnp. on Principles of Distributed Computing, pages 263-275, 1988.

Digital Library

Google Scholar

[5]

S. Chaudhuri, "Agreement is Harder Than Consensus" Set Consensus Problems in Totally Asynchronous Systems", Proc. 9th A CM Syrup. on Principles of Distributed Computing, pages 311-324, 1990.

Digital Library

Google Scholar

[6]

M. J. Fischer, N. A. Lynch, and M. S. Paterson, "Impossibility of Distributed Consensus with One Faulty Process", Journal oJ" the A CM. Vol. 32, No. 2, pages 374-382, April 1985.

Digital Library

Google Scholar

[7]

G. N. Frederickson and N. A. Lynch, "Electing a Leader in a Synchronous Ring", Journal of A CM, Vol. 34, No. 1, pages 98-115, 1987.

Digital Library

Google Scholar

[8]

P. M. Herlihy, "Impossibility and Universality Results for Wait-Free Synchronization". Proc. 7th ACM oCy77#p, o7# Principles of Distribvted Computing, pages 276-290. 1988.

Digital Library

Google Scholar

[9]

L. Lamport, "On Interprocess Communica.- tion, Parts I and II", Distributed Computing, Vol. 1, pages 77-101, 1986.

Crossref

Google Scholar

[10]

D. Dolev, C. Dwork and L. Stockmeyer. "On the Minimal Synchronization Needed for Distributed Consensus". JACM 34. Janua.ry 1987.

Digital Library

Google Scholar

[11]

A. Afek, D. Dolev, E. Gafni, M. Merritt a.nd N. She#vit,"First-in-first-Enabled 1-Exclusion". Proc. 4th International Workshop On Distributed Algorithms, Ba.ri, Ita.ly 1990.

Digital Library

Google Scholar

[12]

F. Zaha.roglou and M. Saks," Wait-Free kset Agreement is impossible: The Topology of Public Knowledge", This Proceedings.

Google Scholar

[13]

M. Herlihy and N. Shavit," The Asynchronous Computability Theorem for t- Resilient Tusks", This Proceedings.

Digital Library

Google Scholar

[14]

P. Jayanti and S. Toueg, "Some Results on the Impossibility, Universality and Decidability of Consensus", private communication.

Google Scholar

Cited By

View all

Gay SMostefaoui APerrin MKuznetsov PGelles ROlivetti D(2024)Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing SystemsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662818(343-346)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662818
Ovens S(2024)The Space Complexity of Consensus from SwapJournal of the ACM10.1145/363139071:1(1-26)Online publication date: 11-Feb-2024
https://dl.acm.org/doi/10.1145/3631390
Chase ZChornomaz BMoran SYehudayoff AMohar BShinkar IO'Donnell R(2024)Local Borsuk-Ulam, Stability, and ReplicabilityProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649632(1769-1780)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649632
Show More Cited By

Index Terms

Generalized FLP impossibility result for t-resilient asynchronous computations

Recommendations

Intrusion-resilient identity-based signature: Security definition and construction

Traditional identity-based signatures depend on the assumption that secret keys are absolutely secure. Once a secret key is exposed, all signatures associated with this secret key have to be reissued. Therefore, limiting the impact of key exposure in ...
Leakage-resilient certificate-based encryption

Certificate-based encryption is a new cryptography primitive, which can be used to construct efficient public key infrastructure. However, side-channel attacks are not considered in certificate-based encryption. In order to capture these attacks, we ...
Leakage-resilient lossy trapdoor functions and public-key encryption
AsiaPKC '13: Proceedings of the first ACM workshop on Asia public-key cryptography

Lossy Trapdoor Functions (LTFs) was introduced by Peikert and Waters in 2008. The importance of the LTFs was justified by their numerous cryptographic applications, like the construction of injective one-way trapdoor functions, CCA-secure public-key ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

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 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

289
Total Citations
View Citations
1,705
Total Downloads

Downloads (Last 12 months)141
Downloads (Last 6 weeks)12

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gay SMostefaoui APerrin MKuznetsov PGelles ROlivetti D(2024)Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing SystemsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662818(343-346)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662818
Ovens S(2024)The Space Complexity of Consensus from SwapJournal of the ACM10.1145/363139071:1(1-26)Online publication date: 11-Feb-2024
https://dl.acm.org/doi/10.1145/3631390
Chase ZChornomaz BMoran SYehudayoff AMohar BShinkar IO'Donnell R(2024)Local Borsuk-Ulam, Stability, and ReplicabilityProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649632(1769-1780)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649632
Chaurasia BVerma AVerma P(2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks10.1016/j.comnet.2024.110432247(110432)Online publication date: Jun-2024
https://doi.org/10.1016/j.comnet.2024.110432
Taubenfeld G(2024)Reaching Agreement Among k out of n ProcessesStructural Information and Communication Complexity10.1007/978-3-031-60603-8_24(438-455)Online publication date: 23-May-2024
https://doi.org/10.1007/978-3-031-60603-8_24
Delporte-Gallet CFauconnier HRaynal MSafir M(2023)Optimal algorithms for synchronous Byzantine k-set agreementTheoretical Computer Science10.1016/j.tcs.2023.114098(114098)Online publication date: Aug-2023
https://doi.org/10.1016/j.tcs.2023.114098
Durand ARaynal MTaubenfeld G(2023)Reaching agreement in the presence of contention-related crash failuresTheoretical Computer Science10.1016/j.tcs.2023.113982966-967(113982)Online publication date: Jul-2023
https://doi.org/10.1016/j.tcs.2023.113982
Alistarh DEllen FRybicki J(2023)Wait-free approximate agreement on graphsTheoretical Computer Science10.1016/j.tcs.2023.113733948:COnline publication date: 28-Feb-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.113733
Attiya HCastañeda ARajsbaum S(2023)Locally solvable tasks and the limitations of valency argumentsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2023.02.002176(28-40)Online publication date: Jun-2023
https://doi.org/10.1016/j.jpdc.2023.02.002
Castañeda AHurault AQuéinnec PRoy M(2023)Tasks in modular proofs of concurrent algorithmsInformation and Computation10.1016/j.ic.2023.105040292(105040)Online publication date: Jun-2023
https://doi.org/10.1016/j.ic.2023.105040
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Intrusion-resilient identity-based signature: Security definition and construction

Leakage-resilient certificate-based encryption

Leakage-resilient lossy trapdoor functions and public-key encryption