The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.
Ciphers for MPC and FHE
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
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
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
Linear Cryptanalysis Method for DES Cipher
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
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
Self-citationHomomorphic Evaluation of the AES Circuit
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_49 · Cited by 796
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 782
PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
Borghoff, J., Canteaut, A., Güneysu, T., Kavun, E. B., Knezevic, M., Knudsen, L. R., Leander, G., Nikov, V., Paar, C., Rechberger, C., et al. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-34961-4_14 · Cited by 750
Self-citationImproved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743
Self-citationTruncated and higher order differentials
Knudsen, L. R. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60590-8_16 · Cited by 731
Cited by
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
Acar, A., Aksu, H., Uluagac, A. S., & Conti, M. (2019) · ACM Computing Surveys · doi:10.1145/3214303 · Cited by 1,397
Status report on the second round of the NIST post-quantum cryptography standardization process
Moody, D., Alagic, G., Apon, D. C., Cooper, D. A., Dang, Q. H., Kelsey, J. M., Liu, Y.-K., Miller, C. A., Peralta, R. C., Perlner, R. A., et al. (2020) · doi:10.6028/nist.ir.8309 · Cited by 296
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Albrecht, M., Grassi, L., Rechberger, C., Roy, A., & Tiessen, T. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53887-6_7 · Cited by 258
Self-citationImplementing Grover Oracles for Quantum Key Search on AES and LowMC
Jaques, S., Naehrig, M., Roetteler, M., & Virdia, F. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-45724-2_10 · Cited by 234
Stream cipher designs: a review
Jiao, L., Hao, Y., & Feng, D. (2020) · Science China Information Sciences · doi:10.1007/s11432-018-9929-x · Cited by 67
Metadata
- Authors
- Albrecht, M. R., Rechberger, C., Schneider, T., Tiessen, T., & Zohner, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2015
- Pages
- 430-454
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W632399495
- Cited by
- 290
- References
- 66
- FWCI
- 10.23
- 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: Ciphers for MPC and FHE. https://app.cochat.ai/papers/10.1007/978-3-662-46800-5_17
- The paper
- Albrecht, M. R., Rechberger, C., Schneider, T., Tiessen, T., & Zohner, M. (2015). Ciphers for MPC and FHE. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-662-46800-5_17
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.
