Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ACM Symposium on Theory of Computing (STOC)

Secure computation with honest-looking parties (extended abstract)

Ran Canetti, Rafail Ostrovsky

Published May 1, 1999• 18 citations
Publisher

Abstract

Article Free Access Share on Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest? Authors: Ran Canetti IBM T.J. Watson Research Center IBM T.J. Watson Research CenterView Profile , Rafail Ostrovsky Bell Communications Research, MCC-1C365B, 445 South Street, Morristown, New Jersey Bell Communications Research, MCC-1C365B, 445 South Street, Morristown, New JerseyView Profile Authors Info & Claims STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingMay 1999Pages 255–264https://doi.org/10.1145/301250.301313Published:01 May 1999Publication History 15citation383DownloadsMetricsTotal Citations15Total Downloads383Last 12 Months19Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

DOI
10.1145/301250.301313

Related papers

Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract).

Ran Canetti, Rafail Ostrovsky

) Ran Canetti Rafail Ostrovsky y April 28, 1999 Abstract In a secure multi-party computation a set of mutually distrustful parties interact in order to evaluate a pre-defined function of their inputs, without revealing the inputs to each other. In this scenario, the trust in other parties should be minimal. In the classic formulation of this problem, most of the parties are trusted to exactly follow the prescribed protocol, except for a limited number of parties that are corrupted by a centralized adversary and are allowed to deviate from the protocol in an arbitrary way. However, an assumption of a totally honest behavior of most parties can not be verified. In particular, if an "honest-looking" party diverges from its protocol in a way that is indistinguishable from a totally honest player, it can do so with "impunity". In this paper, we consider the situation where all parties (even uncorrupted ones) may deviate from their protocol in arbitrary ways, under the sole restriction ...

•Jan 1, 1999•24 citations

Undecidability on quantum finite automata

Masami Amano, Kazuo Iwama

Article Undecidability on quantum finite automata Share on Authors: Masami Amano School of Informatics, Kyoto University, Kyata 606-8501, Japan School of Informatics, Kyoto University, Kyata 606-8501, JapanView Profile , Kazuo Iwama School of Informatics, Kyoto University, Kyata 606-8501, Japan School of Informatics, Kyoto University, Kyata 606-8501, JapanView Profile Authors Info & Claims STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingMay 1999 Pages 368–375https://doi.org/10.1145/301250.301344Online:01 May 1999Publication History 23citation442DownloadsMetricsTotal Citations23Total Downloads442Last 12 Months14Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

ACM Symposium on Theory of Computing (STOC)•May 1, 1999•53 citations

Quantum bit escrow

Dorit Aharonov, Amnon Ta‐Shma, Umesh V. Vazirani +1 more

Article Free Access Share on Quantum bit escrow Authors: Dorit Aharonov University of California, Berkeley, CA University of California, Berkeley, CAView Profile , Amnon Ta-Shma University of California, Berkeley, CA University of California, Berkeley, CAView Profile , Umesh V. Vazirani University of California, Berkeley, CA University of California, Berkeley, CAView Profile , Andrew C. Yao Princeton University, Princeton, NJ Princeton University, Princeton, NJView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 705–714https://doi.org/10.1145/335305.335404Published:01 May 2000Publication History 46citation619DownloadsMetricsTotal Citations46Total Downloads619Last 12 Months56Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

ACM Symposium on Theory of Computing (STOC)•May 1, 2000•106 citations

Unconditionally Secure Multi-Party Computation

Adrian Kent

This paper was withdrawn on 20.11.97.

arXiv:quant-ph/9711024•Nov 16, 1997•1 citation

Quantum computing

Gilles Brassard A

article Free Access Share on Quantum computing: the end of classical cryptography? Author: Gilles Brassard View Profile Authors Info & Claims ACM SIGACT NewsVolume 25Issue 4Dec. 1994 pp 15–21https://doi.org/10.1145/190616.190617Published:01 December 1994Publication History 7citation1,254DownloadsMetricsTotal Citations7Total Downloads1,254Last 12 Months190Last 6 weeks19 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

ACM SIGACT News•Dec 1, 1994•18 citations

Secure Multi-Party Computation: Theory, practice and applications

Chuan Zhao, Shengnan Zhao, Minghao Zhao +4 more

Information Sciences•Oct 16, 2018•509 citations
Article Free Access Share on Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest? Authors: Ran Canetti IBM T.J. Watson Research Center IBM T.J. Watson Research CenterView Profile , Rafail Ostrovsky Bell Communications Research, MCC-1C365B, 445 South Street, Morristown, New Jersey Bell Communications Research, MCC-1C365B, 445 South Street, Morristown, New JerseyView Profile Authors Info & Claims STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingMay 1999Pages 255–264https://doi.org/10.1145/301250.301313Published:01 May 1999Publication History 15citation383DownloadsMetricsTotal Citations15Total Downloads383Last 12 Months19Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
) Ran Canetti Rafail Ostrovsky y April 28, 1999 Abstract In a secure multi-party computation a set of mutually distrustful parties interact in order to evaluate a pre-defined function of their inputs, without revealing the inputs to each other. In this scenario, the trust in other parties should be minimal. In the classic formulation of this problem, most of the parties are trusted to exactly follow the prescribed protocol, except for a limited number of parties that are corrupted by a centralized adversary and are allowed to deviate from the protocol in an arbitrary way. However, an assumption of a totally honest behavior of most parties can not be verified. In particular, if an "honest-looking" party diverges from its protocol in a way that is indistinguishable from a totally honest player, it can do so with "impunity". In this paper, we consider the situation where all parties (even uncorrupted ones) may deviate from their protocol in arbitrary ways, under the sole restriction ...
Article Undecidability on quantum finite automata Share on Authors: Masami Amano School of Informatics, Kyoto University, Kyata 606-8501, Japan School of Informatics, Kyoto University, Kyata 606-8501, JapanView Profile , Kazuo Iwama School of Informatics, Kyoto University, Kyata 606-8501, Japan School of Informatics, Kyoto University, Kyata 606-8501, JapanView Profile Authors Info & Claims STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingMay 1999 Pages 368–375https://doi.org/10.1145/301250.301344Online:01 May 1999Publication History 23citation442DownloadsMetricsTotal Citations23Total Downloads442Last 12 Months14Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Article Free Access Share on Quantum bit escrow Authors: Dorit Aharonov University of California, Berkeley, CA University of California, Berkeley, CAView Profile , Amnon Ta-Shma University of California, Berkeley, CA University of California, Berkeley, CAView Profile , Umesh V. Vazirani University of California, Berkeley, CA University of California, Berkeley, CAView Profile , Andrew C. Yao Princeton University, Princeton, NJ Princeton University, Princeton, NJView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 705–714https://doi.org/10.1145/335305.335404Published:01 May 2000Publication History 46citation619DownloadsMetricsTotal Citations46Total Downloads619Last 12 Months56Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
article Free Access Share on Quantum computing: the end of classical cryptography? Author: Gilles Brassard View Profile Authors Info & Claims ACM SIGACT NewsVolume 25Issue 4Dec. 1994 pp 15–21https://doi.org/10.1145/190616.190617Published:01 December 1994Publication History 7citation1,254DownloadsMetricsTotal Citations7Total Downloads1,254Last 12 Months190Last 6 weeks19 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF