Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 539

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Secure Multiparty Computation Goes Live

Bogetoft, Peter, Christensen, Dan Lund, Damgård, Ivan, Geisler, Martin, Jakobsen, Thomas, Krøigaard, Mikkel, Nielsen, Janus Dam, Nielsen, Jesper Buus, Nielsen, Kurt, Pagter, Jakob, Schwartzbach, Michael, Toft, Tomas·2009·Lecture Notes in Computer Science

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-642-03549-4_20

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Research works printed but not linked: 19

  1. Bogetoft, P., Damgård, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A Practical Implementation of Secure Auctions based on Multiparty Integer Computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 142–147. Springer, Heidelberg (2006) · DOI
  2. Bogetoft, P., Boye, K., Neergaard-Petersen, H., Nielsen, K.: Reallocating sugar beet contracts: Can sugar production survive in Denmark? European Review of Agricultural Economics (34), 1–20 (2007) · DOI
  3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: Proc. ACM STOC 1988, pp, pp. 1–10 (1988) · DOI · Paper page
  4. Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997) · DOI · Paper page
  5. Cramer, R., Damgård, I.: Multiparty Computation, an Introduction. In: Contemporary Cryptology, Advanced courses in Mathematics CRM Barcelona. Birkhäuser, Basel · DOI
  6. Chaum, D., Crépeau, C., Damgård, I.: Multi-Party Unconditionally Secure Protocols. In: Proc. of ACM STOC 1998, pp. 11–19 (1988) · DOI · Paper page
  7. Cramer, R., Damgård, I., Maurer, U.: Multiparty Computations from Any Linear Secret Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316–334. Springer, Heidelberg (2000) · DOI · Paper page
  8. Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient Multiparty Computations With Dishonest Minority. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 311. Springer, Heidelberg (1999) · DOI · Paper page
  9. Dasgupta, P., Hammond, P., Maskin, E.: The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility. Review of Economic Studies 46, 27–42 (1979) · DOI · Paper page
  10. Damgård, I.B., Nielsen, J.B.: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 247–264. Springer, Heidelberg (2003) · DOI · Paper page
  11. Damgård, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier’s Probabilistic Public-Key System. In: Public Key Cryptography 2001, pp. 119–136 (2001) · DOI · Paper page
  12. Damgård, I.B., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285–304. Springer, Heidelberg (2006) · DOI · Paper page
  13. Damgård, I., Thorbek, R.: Non-Interactive Proofs for Integer Multiplication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 412–429. Springer, Heidelberg (2007) · DOI
  14. Gibbard, A.: Manipulation of Voting Schemes: A General Result. Econometrica 41, 587–601 (1973) · DOI · Paper page
  15. Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. In: Proc of ACM PODC 1998 (1998) · DOI · Paper page
  16. Hirt, M., Maurer, U.: Complete Characterization of Adversaries Tolerable in General Multiparty Computations. In: Proc. ACM PODC 1997, pp. 25–34 (1997) · DOI · Paper page
  17. Myerson, R.B.: Incentives Compatibility and the Bargaining Problem. Econometrica 47, 61–73 (1979) · DOI · Paper page
  18. Nielsen, J.D., Schwartzbach, M.I.: A domain-specific programming language for secure multipartycomputation. In: Proceedings of Programming Languages and Security (PLAS). ACM Press, New York (2007)
  19. Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest majority. In: Proc. ACM STOC 1989, pp. 73–85 (1989) · DOI · Paper page

Cited by

See all 539

Metadata

Authors
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., Schwartzbach, M., & Toft, T.
Venue
Lecture Notes in Computer Science
Published
2009
Pages
325-343
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1595357546
Cited by
539
References
1
FWCI
24.68
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: Secure Multiparty Computation Goes Live. https://app.cochat.ai/papers/10.1007/978-3-642-03549-4_20
The paper
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., Schwartzbach, M., & Toft, T. (2009). Secure Multiparty Computation Goes Live. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-03549-4_20

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.