The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
A Survey of Homomorphic Encryption for Nonspecialists
Open accessAbstract
Processing encrypted signals requires special properties of the underlying encryption scheme. A possible choice is the use of homomorphic encryption. In this paper, we propose a selection of the most important available solutions, discussing their properties and limitations.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 3×
“Security : This scheme has been showed to be unconditionally secure by Shannon [26] if and only if the keystream is truly random, has the same length as the plaintext, and is used only once.”
BackgroundInfluentialA public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Daemen, J., & Rijmen, V. (2002) · Information Security and Cryptography · doi:10.1007/978-3-662-04722-4 · Cited by 2,437
(1978) · Cited by 1,875
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_26 · Cited by 1,334
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
Damgård, I., & Jurik, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_9 · Cited by 1,063
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
Probabilistic encryption & how to play mental poker keeping secret all partial information
Goldwasser, S., & Micali, S. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802212 · Cited by 883
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Cramer, R., & Shoup, V. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_4 · Cited by 831
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
A secure and optimally efficient multi‐authority election scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080506 · Cited by 784
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
Encyclopedia of Cryptography and Security
(2011) · Springer eBooks · doi:10.1007/978-1-4419-5906-5 · Cited by 697
A new public-key cryptosystem as secure as factoring
Okamoto, T., & Uchiyama, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054135 · Cited by 673
A public-key cryptosystem with worst-case/average-case equivalence
Ajtai, M., & Dwork, C. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258604 · Cited by 642
Protecting Mobile Agents Against Malicious Hosts
Sander, T., & Tschudin, C. F. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-68671-1_4 · Cited by 596
A Computational Introduction to Number Theory and Algebra
Shoup, V. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814549 · Cited by 549
Efficient aggregation of encrypted data in wireless sensor networks
Castelluccia, C., Mykletun, E., & Tsudik, G. (2005) · The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services · doi:10.1109/mobiquitous.2005.25 · Cited by 525
Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications
Vernam, G. S. (1926) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1926.5061224 · Cited by 480
Universal Re-encryption for Mixnets
Golle, P., Jakobsson, M., Juels, A., & Syverson, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24660-2_14 · Cited by 412
Optimal Asymmetric Encryption-How to Encrypt with RSA
Bellare, M. (1995) · Cited by 382
Verifiable secret-ballot elections
Benaloh, J. (1987) · Cited by 380
A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications
Bresson, E., Catalano, D., & Pointcheval, D. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-40061-5_3 · Cited by 355
A new public key cryptosystem based on higher residues
Naccache, D., & Stern, J. (1998) · Proceedings of the 5th ACM conference on Computer and communications security · doi:10.1145/288090.288106 · Cited by 352
A buyer-seller watermarking protocol
Memon, N., & Wong, P. W. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.913598 · Cited by 321
Sharing Decryption in the Context of Voting or Lotteries
Fouque, P.-A., Poupard, G., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_7 · Cited by 312
A New Version of the Stream Cipher SNOW
Ekdahl, P., & Johansson, T. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36492-7_5 · Cited by 289
A Provably Secure Additive and Multiplicative Privacy Homomorphism*
Domingo-Ferrer, J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45811-5_37 · Cited by 281
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
Blum, M., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_23 · Cited by 262
The codebreakers : the story of secret writing
Kahn, D. L. (1996) · Cited by 189
An Efficient and Anonymous Buyer-Seller Watermarking Protocol
Lei, C.-L., Yu, P.-L., Tsai, P.-L., & Chan, M.-H. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.837553 · Cited by 176
Algorithms for Black-Box Fields and their Application to Cryptography
Boneh, D., & Lipton, R. J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_22 · Cited by 167
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
A new privacy homomorphism and applications
Domingo‐Ferrer, J. (1996) · Information Processing Letters · doi:10.1016/s0020-0190(96)00170-6 · Cited by 154
Daemen, J., & Rijmen, V. (2000) · Lecture notes in computer science · Cited by 148
Fingerprinting protocol for images based on additive homomorphic property
Kuribayashi, M., & Tanaka, H. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.859383 · Cited by 135
A uniform-complexity treatment of encryption and zero-knowledge
Goldreich, O. (1993) · Journal of Cryptology · doi:10.1007/bf02620230 · Cited by 132
A Length-Flexible Threshold Cryptosystem with Applications
Damgård, I., & Jurik, M. J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45067-x_30 · Cited by 122
Verifiable Homomorphic Oblivious Transfer and Private Equality Test
Lipmaa, H. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40061-5_27 · Cited by 105
Cryptanalysis of an Algebraic Privacy Homomorphism
Wagner, D. (2003) · Lecture notes in computer science · doi:10.1007/10958513_18 · Cited by 92
Elliptic Curve Paillier Schemes
Galbraith⋆, S. D. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0015-6 · Cited by 91
Brickell, E. F., & Yacobi, Y. (1987) · Theory and Application of Cryptographic Techniques · Cited by 60
Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
Cheon, J. H., Kim, W.-H., & Nam, H. S. (2005) · Information Processing Letters · doi:10.1016/j.ipl.2005.09.016 · Cited by 44
Cited by
Federated Learning for Healthcare Informatics
Xu, J., Glicksberg, B. S., Su, C., Walker, P., Bian, J., & Wang, F. (2021) · Journal of Healthcare Informatics Research · doi:10.1007/s41666-020-00082-4 · Cited by 1,542
“Homomorphic encryption is a public key system, where any party can encrypt its data with a known public key and perform calculations with data encrypted by others with the same public key [23].”
BackgroundFederated Learning for Healthcare Informatics
Xu, J., Glicksberg, B. S., Su, C., Walker, P., Bian, J., & Wang, F. (2019) · arXiv · doi:10.48550/arxiv.1911.06270 · Cited by 1,538
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
Deng, M., Wuyts, K., Scandariato, R., Preneel, B., & Joosen, W. (2011) · Requirements Engineering · doi:10.1007/s00766-010-0115-7 · Cited by 533
Lagendijk, R. L., & Barni, M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219653 · Cited by 336
Metadata
- Authors
- Fontaine, C., & Galand, F.
- Venue
- EURASIP Journal on Information Security
- Published
- 2007
- Volume
- 2007
- Pages
- 1-10
- ISSN
- 1687-4161 (ISSN-L)
- 1687-417X
- OpenAlex
- W2068143382
- Cited by
- 438
- References
- 54
- FWCI
- 13.00
- Type
- journal article
- Language
- en
- Open access
- gold
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.