The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
On observing nondeterminism and concurrency
Hennessy, M., & Milner, R. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_79 · Cited by 4,492
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
(2000) · Choice Reviews Online · doi:10.5860/choice.37-5723 · Cited by 1,616
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Goldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
Self Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,121
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Advances in Cryptology - CRYPTO 2003
(2003) · Lecture notes in computer science · doi:10.1007/b11817 · Cited by 942
Fischlin, M., & Coron, J.-S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49896-5 · Cited by 882
(2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-26951-7 · Cited by 753
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
Cramer, R., Damgård, I., & Maurer, U. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_22 · Cited by 533
Self-citationSimplified VSS and fast-track multiparty computations with applications to threshold cryptography
Gennaro, R., Rabin, M. O., & Rabin, T. (1998) · Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 · doi:10.1145/277697.277716 · Cited by 464
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Bar-Ilan, J., & Beaver, D. (1989) · Proceedings of the eighth annual ACM Symposium on Principles of distributed computing - PODC '89 · doi:10.1145/72981.72995 · Cited by 266
A simplified approach to threshold and proactive RSA
Rabin, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055722 · Cited by 262
Ishai, Y., & Kushilevitz, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892118 · Cited by 254
A minimal model for secure computation (extended abstract)
Feige, U., Killian, J., & Naor, M. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195408 · Cited by 251
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption
Damgård, I., & Nielsen, J. B. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_15 · Cited by 201
Self-citationPerfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
Ishai, Y., & Kushilevitz, E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45465-9_22 · Cited by 165
Computing Algebraic Formulas Using a Constant Number of Registers
Ben-Or, M., & Cleve, R. (1992) · SIAM Journal on Computing · doi:10.1137/0221006 · Cited by 139
Algesheimer, J., Camenisch, J. L., & Shoup, V. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_27 · Cited by 133
Private simultaneous messages protocols with applications
Ishai, Y., & Eyal Kushilevitz, Z. (2002) · Israel Symposium on Theory and Computing Systems (ISTCS) · doi:10.1109/istcs.1997.595170 · Cited by 111
Secure Distributed Linear Algebra in a Constant Number of Rounds
Cramer, R., & Damgård, I. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_7 · Cited by 88
Self-citationA Minimal Model for Secure Computation
Feige, U., Kilian, J., & Naor, M. (2002) · Cited by 86
Secure Computation of the Mean and Related Statistics
Kiltz, E., Leander, G., & Malone-Lee, J. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_16 · Cited by 59
Self-citationMinimal-Latency Secure Function Evaluation
Beaver, D. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_23 · Cited by 37
Cited by
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Demmler, D., Schneider, T., & Zohner, M. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23113 · Cited by 827
Sharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
Self-citationSecure Multiparty Computation Goes Live
Bogetoft, P., Christensen, D. L., Damgård, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J., et al. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03549-4_20 · Cited by 539
Self-citation
Metadata
- Authors
- Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J. B., & Toft, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 285-304
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2130901615
- Cited by
- 443
- References
- 29
- FWCI
- 11.29
- 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
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.