The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“, Shamir [33], Benaloh-Leichter [5], Ito et al.”
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
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
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
Verifiable secret sharing and multiparty protocols with honest majority
Rabin, T., & Ben-Or, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73014 · Cited by 930
Secure schemes for secret sharing and key distribution
Beimel, A. (1996) · Medical Entomology and Zoology · Cited by 779
Verifiable secret sharing and achieving simultaneity in the presence of faults
Chor, B., Goldwasser, S., Micali, S., & Awerbuch, B. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.64 · Cited by 771
Secret sharing scheme realizing general access structure
Ito, M., Saito, A., & Nishizeki, T. (1989) · Electronics and Communications in Japan (Part III: Fundamental Electronic Science) · doi:10.1002/ecjc.4430720906 · Cited by 681
Generalized Secret Sharing and Monotone Functions
Benaloh, J., & Leichter, J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_3 · Cited by 677
Adaptively secure multi-party computation
Canetti, R., Feige, U., Goldreich, O., & Naor, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.238015 · Cited by 548
Karchmer, M., & Wigderson, A. (2002) · [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference · doi:10.1109/sct.1993.336536 · Cited by 486
Some Ideal Secret Sharing Schemes
Brickell, E. F. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_45 · Cited by 474
Simplified 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
Foundations of Secure Interactive Computing
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_31 · Cited by 277
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
Hirt, M., & Maurer, U. (2000) · Journal of Cryptology · doi:10.1007/s001459910003 · Cited by 233
Self-citationEfficient Multiparty Computations Secure Against an Adaptive Adversary
Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_22 · Cited by 220
Self-citationMicali, S. M., & Rogaway, P. (1991) · International Cryptology Conference · Cited by 164
Micali, S. M., & Rogaway, P. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_32 · Cited by 162
Committed Oblivious Transfer and Private Multi-Party Computation
Crépeau, C., van de Graaf, J., & Tapp, A. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_9 · Cited by 160
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?
Cramer, R., & Damgård, I. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055745 · Cited by 159
Self-citationRobust sharing of secrets when the dealer is honest or cheating
Rabin, T. (1994) · Journal of the ACM · doi:10.1145/195613.195621 · Cited by 98
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
Galil, Z., Haber, S., & Yung, M. M. (1987) · International Cryptology Conference · Cited by 89
A construction of practical secret sharing schemes using linear block codes
Bertilsson, M., & Ingemarsson, I. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57220-1_53 · Cited by 80
Efficient Byzantine agreement secure against general adversaries
Fitzi, M., & Maurer, U. M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056479 · Cited by 60
Self-citationGalil, Z., Haber, S., & Yung, M. M. (1988) · Lecture notes in computer science · doi:10.1007/3-540-48184-2_10 · Cited by 52
On the complexity of verifiable secret sharing and multiparty computation
Cramer, R., Damgård, I., & Dziembowski, S. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335343 · Cited by 52
Self-citationSecret key sharing and secret key generation
Dijk, V. M. M. (1997) · TU/e Research Portal · doi:10.6100/ir501451 · Cited by 25
Cited by
Private Circuits: Securing Hardware against Probing Attacks
Ishai, Y., Sahai, A., & Wagner, D. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_27 · Cited by 1,073
Secret-Sharing Schemes: A Survey
Beimel, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20901-7_2 · Cited by 652
Privacy-Preserving Set Operations
Kissner, L., & Song, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_15 · Cited by 648
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
Self-citationMultiparty Computation from Threshold Homomorphic Encryption
Cramer, R., Damgård, I., & Nielsen, J. B. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_18 · Cited by 578
Self-citation
Metadata
- Authors
- Cramer, R., Damgård, I., & Maurer, U.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 316-334
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1556155774
- Cited by
- 533
- References
- 27
- FWCI
- 8.17
- 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.