Article

Free access

Asynchronous secure computations with optimal resilience (extended abstract)

Authors:

Michael Ben-Or,

Boaz Kelmer,

Tal RabinAuthors Info & Claims

PODC '94: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing

Pages 183 - 192

https://doi.org/10.1145/197917.198088

Published: 14 August 1994 Publication History

PDF eReader

References

[1]

M. Ben-Or, R. Canetti, and O. Goldreich. "Asynchronous Secure Computations". In Proceeding 25th Annual Symposium on lhe Theory of Computing, pages 52-61. ACM, 1993.

Digital Library

Google Scholar

[2]

M. Ben-Or, S. Goldwasser, and A. Wigderson. "Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations". In Proceeding 20th Annual Symposium on lhe Theory of Computing, pages 1-10. ACM, 1988.

Digital Library

Google Scholar

[3]

M. Ben-Or and R. E1-Yaniv. "interactive Consistency in Constant Time". Submitted for publication, 1991.

Google Scholar

[4]

G. Bracha. "An Asynchronous {(n- 1)/3J- resilient Consensus Protocol". In 3rd Proceeding of Distributed Computing, pages 154-162. ACM, 1984.

Crossref

Google Scholar

[5]

R. Canetti. "Asynchronous Secure Computations''. Technical Report 755, Department of Computer Science, Technion Haifa, 1993.

Google Scholar

[6]

D. Chaum, C. Crepau, and I. Damgard. "Multiparty Unconditionally Secure Protocols". In Proceeding 20th Annual Symposium on the Theory of Computing, pages 11-19. ACM, 1988.

Digital Library

Google Scholar

[7]

R. Canetti and T. Rabin. "Fast Asynchronous Byzantine Agreement with Optimal Resilience". In Proceeding ~5th Annual Symposium on the Theory of Computing, pages 42-51. ACM, 1993.

Digital Library

Google Scholar

[8]

P. Feldrnan. "Asynchronous Byzantine Agreement in Constant Expected Time". Manuscript, 1989.

Google Scholar

[9]

P. Feldman and S. Micali. "An Optimal Algorithm for Synchronous Byzantine Agreement''. In Proceeding 20th Annual Symposium on the Theory of Computing, pages 148-161. ACM, 1988.

Digital Library

Google Scholar

[10]

S. Micali and P. Rogoway. "Secure Computations''. In preparation.

Google Scholar

[11]

M. Pease, R. Shostak, and L. Lamport. "Reaching Agreement in the Presence of Faults". Journal of the A CM, 27(2):228- 234, 1980.

Digital Library

Google Scholar

[12]

T. Rabin. "Robust Sharing of Secrets When the Dealer is Honest or Faulty". Master's thesis, Hebrew University, Jerusalem, 1989.

Google Scholar

[13]

T. Rabin. "Asynchronous Secret $harings and Implementations". PhD thesis, Hebrew University, Jerusalem, 1994.

Google Scholar

[14]

T. Rabin and M. Ben-Or. "Verifiable Secret Sharing and Multiparty Protocols with Honest Majority". In Proceeding 21st Annual Symposium on the Theory of Computing, pages 73-85. ACM, 1989.

Digital Library

Google Scholar

Cited By

View all

Appan AChandramouli AChoudhury A(2025)Network Agnostic Perfectly Secure Multiparty Computation Against General AdversariesIEEE Transactions on Information Theory10.1109/TIT.2024.347051371:1(644-682)Online publication date: Jan-2025
https://doi.org/10.1109/TIT.2024.3470513
Ji ZZhang XHu JLu YLiu J(2024)A Review of Asynchronous Byzantine Consensus ProtocolsSensors10.3390/s2424792724:24(7927)Online publication date: 11-Dec-2024
https://doi.org/10.3390/s24247927
Das SDuan SLiu SMomose ARen LShoup VLuo BLiao XXu JKirda ELie D(2024)Asynchronous Consensus without Trusted Setup or Public-Key CryptographyProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670327(3242-3256)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3670327
Show More Cited By

Index Terms

Asynchronous secure computations with optimal resilience (extended abstract)
1. Networks
  1. Network protocols
    1. Protocol correctness
      1. Protocol testing and verification

Recommendations

On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience
Abstract
Secure multi-party computation (MPC) is a fundamental problem in secure distributed computing. An MPC protocol allows a set of n mutually distrusting parties with private inputs to securely compute any publicly known function of their inputs, by ... $^{}^{}$
Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract)
Progress in Cryptology – INDOCRYPT 2020
Abstract
We study perfectly-secure Multiparty Computation (MPC) in the asynchronous communication setting, tolerating a generalized non-threshold adversary, characterized by an adversary structure. Ashwin Kumar et al. (ACISP2002) presented a condition ...
Asynchronous Byzantine Agreement with optimal resilience

We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving $$n = 3t+1$$n=3t+1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting ...

Comments

Information & Contributors

Information

Published In

PODC '94: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing

August 1994

406 pages

ISBN:0897916549

DOI:10.1145/197917

Chairmen:
James Anderson
Univ. of North Carolina at Chapel Hill
,
David Peleg
Weizmann Institute & IBM T.J. Watson
,
Elizabeth Borowsky
Univ. of California at Los Angeles

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: 14 August 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC94

Sponsor:

PODC94: 13th Annual ACM Symposium on Principles of Distributed Computing

August 14 - 17, 1994

California, Los Angeles, USA

Acceptance Rates

PODC '94 Paper Acceptance Rate 67 of 133 submissions, 50%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

127
Total Citations
View Citations
1,964
Total Downloads

Downloads (Last 12 months)480
Downloads (Last 6 weeks)112

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Appan AChandramouli AChoudhury A(2025)Network Agnostic Perfectly Secure Multiparty Computation Against General AdversariesIEEE Transactions on Information Theory10.1109/TIT.2024.347051371:1(644-682)Online publication date: Jan-2025
https://doi.org/10.1109/TIT.2024.3470513
Ji ZZhang XHu JLu YLiu J(2024)A Review of Asynchronous Byzantine Consensus ProtocolsSensors10.3390/s2424792724:24(7927)Online publication date: 11-Dec-2024
https://doi.org/10.3390/s24247927
Das SDuan SLiu SMomose ARen LShoup VLuo BLiao XXu JKirda ELie D(2024)Asynchronous Consensus without Trusted Setup or Public-Key CryptographyProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670327(3242-3256)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3670327
Wang BLiu SDong HWang XXu WZhang JZhong PZhang Y(2024)Bandle: Asynchronous State Machine Replication Made EfficientProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650091(265-280)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650091
Liu CHou CJiang TNing JQiao HWu Y(2024)FACOS: Enabling Privacy Protection Through Fine-Grained Access Control With On-Chain and Off-Chain SystemIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.342731119(7060-7074)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3427311
Yang GChen CChen QJiang JLi JHe D(2024)Sweeper: Breaking the Validity-Latency Tradeoff in Asynchronous Common SubsetIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.338260219(4534-4546)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3382602
Zhao LDecouchant JLiu JLu QYu J(2024)Trusted Hardware-Assisted Leaderless Byzantine Fault Tolerance ConsensusIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.335752121:6(5086-5097)Online publication date: Nov-2024
https://doi.org/10.1109/TDSC.2024.3357521
Dolev SGuo BNiu JWang Z(2024)SodsBC: A Post-Quantum by Design Asynchronous Blockchain FrameworkIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.324358821:1(47-62)Online publication date: Jan-2024
https://doi.org/10.1109/TDSC.2023.3243588
Shahryari MSohani SAllahbakhsh MAmintoosi H(2024)A Study Framework for Blockchain Consensus Algorithms2024 8th International Conference on Smart Cities, Internet of Things and Applications (SCIoT)10.1109/SCIoT62588.2024.10570122(149-155)Online publication date: 14-May-2024
https://doi.org/10.1109/SCIoT62588.2024.10570122
Barat MLi SDu CHou YLou W(2024)SoK: Public Blockchain Sharding2024 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)10.1109/ICBC59979.2024.10634422(766-783)Online publication date: 27-May-2024
https://doi.org/10.1109/ICBC59979.2024.10634422
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

On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience

Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract)

Asynchronous Byzantine Agreement with optimal resilience