Article

Free access

Asynchronous secure computation

Authors:

Michael Ben-Or,

Ran Canetti,

Oded GoldreichAuthors Info & Claims

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

Pages 52 - 61

https://doi.org/10.1145/167088.167109

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

B. Awerbuch, "The complexity of Network Synchronization", JACM, Vol. 32, no. #, pp. 804-823, 1985.

Digital Library

Google Scholar

[2]

M. Ben-Or, S. Goldwasser and A. Wigderson, " Completeness Theorems for Non-Cryptographic Fault- Tolerant Distributed Computation", 20th STOC, pp. 1-10, 1988.

Digital Library

Google Scholar

[3]

G. Bracha, "An Asynchronous {(n- 1)/3j-resilient Consensus Protocol", 3rd PODC, pp. 154-162, 1984.

Digital Library

Google Scholar

[4]

R. Canetti, "Asynchronous Secure Computation", Techn,cal Report no. 755, CS department, Technion, 1992.

Google Scholar

[5]

R. Canetti and T. Rabin, "Fast Asynchronous Byzantine Agreement with Optimal Resilience", these proceedings.

Digital Library

Google Scholar

[6]

D. Chaum, C. Crepeau and I. Damgard, "Multiparty unconditionally secure protocols", 20th STOC, pp. 11- 19, 1988.

Digital Library

Google Scholar

[7]

B. Chor and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", SIAM J. on Disc. Math., Vol. 4, no. 1, pp. 36-47, 1991.

Digital Library

Google Scholar

[8]

B. Chor and L. Moscovici, "Solvability in Asynchronous Environments", 30th FOGS, 1989.

Digital Library

Google Scholar

[9]

J. Edmonds, 'Paths, Trees, and Flowers", Canadian J. of Math., Vol.17, pp. 449-467, 1965.

Crossref

Google Scholar

[10]

P. Feldman, "Asynchronous Byzantine Agreement in Constant Expected Time", unpublished manuscript, 1989.

Google Scholar

[11]

M. Fischer, N. Lynch and M. Paterson, "Impossibility of Distributed Consensus with One Faulty Process", JACM, Vol. 32, no. 2, pp. 374-382, 1985.

Digital Library

Google Scholar

[12]

M.R. Garey and D. S. Johnson, "Computers and Intractability : a guide to NP-Completeness", W. H. Freeman ed., N.Y., 1979.

Digital Library

Google Scholar

[13]

O. Goldreich, S. Goldwasser, and N. Linial, "Fault- Tolerant Computation in the Full Information Model", 32nd FOCS, pp. 447-457, 1991.

Digital Library

Google Scholar

[14]

O. Goldreich, S. Micali and A. Wigderson, "How to Play any Mental Game", 19th STOC, pp. 218-229, 1987.

Digital Library

Google Scholar

[15]

S. Goldwasser and L. Levin, "Fair Computation of General Functions in Presence of Immoral Majority", CR YPTO, 1990.

Digital Library

Google Scholar

[16]

F.J. Macwiliams and N. J. A. Sloane, "The Theory of Error Correcting Codes", North-Holland, 1977.

Google Scholar

[17]

S. Micali and P. Rogaway, "Secure Computation", in preparation.

Google Scholar

[18]

S. Micali and V. Vazirani, "An O(v/#VI.IE})Algorithm for Finding Maximum Matching in General Graphs", 21at FOGS, 1980.

Google Scholar

[19]

A. Shamir, "How to share a secret", CACM, Vol. 22, No. 11, pp. 612-613, 1979.

Digital Library

Google Scholar

Cited By

View all

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
Xiang AGao HTian YXiong JWang LPeng C(2024)H²CT: Asynchronous Distributed Key Generation With High-Computational Efficiency and Threshold Security in Blockchain NetworkIEEE Internet of Things Journal10.1109/JIOT.2024.343155411:20(33758-33772)Online publication date: 15-Oct-2024
https://doi.org/10.1109/JIOT.2024.3431554
Ranchal-Pedrosa AGramoli V(2024)ZLB: A Blockchain to Tolerate Colluding Majorities2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN58291.2024.00032(209-222)Online publication date: 24-Jun-2024
https://doi.org/10.1109/DSN58291.2024.00032
Show More Cited By

Index Terms

Asynchronous secure computation

Recommendations

Forward-Secure Multi-signatures
ICDCIT '08: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology

In many applications a document needs to be signed by more than one signer. When a signature depends on more than one signer we call it a multi-signature. Further, ordinary digital signatures have an inherent weakness: if the secret key is leaked, then ...
Delegatable homomorphic encryption with applications to secure outsourcing of computation
CT-RSA'12: Proceedings of the 12th conference on Topics in Cryptology

We propose a new cryptographic primitive called Delegatable Homomorphic Encryption (DHE). This allows a Trusted Authority to control/delegate the evaluation of circuits over encrypted data to untrusted workers/evaluators by issuing tokens. This ...
Secure universal designated verifier signature without random oracles

In Asiacrypt 2003, the concept of universal designated verifier signature (UDVS) was introduced by Steinfeld, Bull, Wang and Pieprzyk. In the new paradigm, any signature holder (not necessarily the signer) can designate the publicly verifiable signature ...

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

129
Total Citations
View Citations
1,644
Total Downloads

Downloads (Last 12 months)356
Downloads (Last 6 weeks)41

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

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
Xiang AGao HTian YXiong JWang LPeng C(2024)H²CT: Asynchronous Distributed Key Generation With High-Computational Efficiency and Threshold Security in Blockchain NetworkIEEE Internet of Things Journal10.1109/JIOT.2024.343155411:20(33758-33772)Online publication date: 15-Oct-2024
https://doi.org/10.1109/JIOT.2024.3431554
Ranchal-Pedrosa AGramoli V(2024)ZLB: A Blockchain to Tolerate Colluding Majorities2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN58291.2024.00032(209-222)Online publication date: 24-Jun-2024
https://doi.org/10.1109/DSN58291.2024.00032
Choudhury A(2024)Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal ResilienceTheoretical Computer Science10.1016/j.tcs.2024.114492(114492)Online publication date: Mar-2024
https://doi.org/10.1016/j.tcs.2024.114492
Shoup VSmart N(2024)Lightweight Asynchronous Verifiable Secret Sharing with Optimal ResilienceJournal of Cryptology10.1007/s00145-024-09505-637:3Online publication date: 6-Jun-2024
https://doi.org/10.1007/s00145-024-09505-6
Liu QZhang XDuan SZhang H(2024)Enhancing Permissioned Blockchains with Controlled Data AuthorizationInformation Security and Privacy10.1007/978-981-97-5101-3_1(3-23)Online publication date: 15-Jul-2024
https://doi.org/10.1007/978-981-97-5101-3_1
Goyal VLiu-Zhang CSong Y(2024)Towards Achieving Asynchronous MPC with Linear Communication and Optimal ResilienceAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_6(170-206)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68397-8_6
Ji XLi JSong Y(2024)Linear-Communication Asynchronous Complete Secret Sharing with Optimal ResilienceAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_13(418-453)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68397-8_13
Benhamouda FHalevi SKrawczyk HMa YRabin T(2024)SPRINT: High-Throughput Robust Distributed Schnorr SignaturesAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58740-5_3(62-91)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-58740-5_3
Abraham IAsharov GPatil SPatra A(2024)Perfect Asynchronous MPC with Linear Communication OverheadAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58740-5_10(280-309)Online publication date: 29-Apr-2024
https://doi.org/10.1007/978-3-031-58740-5_10
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

Forward-Secure Multi-signatures

Delegatable homomorphic encryption with applications to secure outsourcing of computation

Secure universal designated verifier signature without random oracles