Bounded-concurrent secure multi-party computation with a dishonest majority
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number of corrupted parties. Previous protocols for the above task either rely on set-up assumptions such as a Common Reference String, or require an honest majority. Our constructions are in the plain model and rely on standard intractability assumptions (enhanced trapdoor permutations and collision resistant hash functions). Even though our main focus is on feasibility of concurrent multi-party computation we actually obtain a protocol using only a constant number of communication rounds. As a consequence our protocol yields the first construction of constant-round phstand-alone secure multi-party computation with a dishonest majority, proven secure under standard (polynomial-time) hardness assumptions; previous solutions to this task either require logarithmic round-complexity, or subexponential hardness assumptions. The core of our protocol is a novel construction of (concurrently) simulation-sound zero-knowledge protocols, which might be of independent interest. Finally, we extend the framework constructed to give a protocol for secure multi-party (and thus two-party) computation for any number of corrupted parties, which remains secure even when arbitrary subsets of parties concurrently execute the protocol, possibly with interchangeable roles. As far as we know, for the case of two-party or multi-party protocols with a dishonest majority, this is the first positive result for any non-trivial functionality which achieves this property in the plain model.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Cited by
A survey on trust management for Internet of Things
Yan, Z., Zhang, P., & Vasilakos, A. V. (2014) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2014.01.014 · Cited by 1,155
“Note: SMC refers to the references [37-66, 67, 68, 70, 71, 74, 77, 78, 79, 80, 81, 82, 83, 85, 88, 89, 90, 91, 94, 95, 96, 97, 104, 105, 106, 107, 108, 110-114, 116, 117-118, 125, 126, 127, 129, 137, 141]”
BackgroundKasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2008) · 2008 49th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.27 · Cited by 334
Universally Composable Security with Global Setup
Canetti, R., Dodis, Y., Pass, R., & Walfish, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_4 · Cited by 331
Self-citation
Metadata
- Authors
- Pass, R.
- Venue
- Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2004-06-13
- Pages
- 232-241
- OpenAlex
- W2064265141
- Cited by
- 182
- References
- 1
- FWCI
- 6.94
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bounded-concurrent secure multi-party computation with a dishonest majority. https://app.cochat.ai/papers/10.1145/1007352.1007393
- The paper
- Pass, R. (2004). Bounded-concurrent secure multi-party computation with a dishonest majority. Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. https://doi.org/10.1145/1007352.1007393
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.