Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Poisoning attacks can be broadly classified into untargeted poisoning attacks and targeted poisoning attacks.
“Depending on the attacker's objective, poisoning attacks can be broadly classified into two categories: 1) untargeted poisoning attacks [123], [124], [125], [70], [67]; and 2) targeted poisoning attacks [126], [127], [35], [36], [128], [129], [130], [131].”
From Privacy and Robustness in Federated Learning: Attacks and Defenses (2024) · cites this paper as [126]
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 · see citing works
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 · see citing works
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 · see citing works
A 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 · see citing works
Bellare, M., & Rogaway, P. (1993) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/168588.168596 · Cited by 4,695 · see citing works
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,536 · see citing works
Mollin, R. A. (2005) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035087-10 · Cited by 914 · see citing works
Hiding information and signatures in trapdoor knapsacks
Merkle, R. C., & Hellman, M. E. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055927 · Cited by 825 · see citing works
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 788 · see citing works
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 674 · see citing works
Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption
Matsumoto, T., & Imai, H. (1988) · Lecture notes in computer science · doi:10.1007/3-540-45961-8_39 · Cited by 507 · see citing works
Verifiable secret-ballot elections
Benaloh, J. (1987) · Cited by 380 · see citing works
A Secure and Optimally Efficient Multi-Authority Election Scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_9 · Cited by 360 · see citing works
A new public key cryptosystem based on higher residues
Naccache, D., & Stern, J. (1998) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/288090.288106 · Cited by 350 · see citing works
A key distribution system equivalent to factoring
McCurley, K. S. (1988) · Journal of Cryptology · doi:10.1007/bf02351718 · Cited by 175 · see citing works
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
Koyama, K., Maurer, U. M., Okamoto, T., & Vanstone, S. A. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_20 · Cited by 173 · see citing works
Anderson, M., & Feil, T. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b17673-23 · Cited by 150 · see citing works
Naccache, D., & Stern, J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_3 · Cited by 119 · see citing works
Trapdoor one-way permutations and multivariate polynomials
Patarin, J., & Goubin, L. (1997) · Lecture notes in computer science · doi:10.1007/bfb0028491 · Cited by 108 · see citing works
Salomaa, A. K. (1990) · Springer eBooks · doi:10.1007/978-3-662-02627-4 · Cited by 108 · see citing works
On Software Protection via Function Hiding
Sander, T., & Tschudin, C. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49380-8_9 · Cited by 97 · see citing works
Ding, C., Pei, D., & Salomaa, A. (1996) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812779380 · Cited by 63 · see citing works
Cryptanalysis of the Ajtai-Dwork cryptosystem
Nguyen, P., & Stern, J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055731 · Cited by 53 · see citing works
Faster factoring of integers of a special form
Peralta, R., & Okamoto, E. (1996) · Cited by 38 · see citing works
Elliptic curve cryptosystems using curves of smooth order over the ring Z/sub n/
Vanstone, S. A., & Zuccherato, R. J. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.605586 · Cited by 35 · see citing works
Cryptanalysis of the Chor-Rivest cryptosystem
Vaudenay, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055732 · Cited by 32 · see citing works
Locally random reductions in interactive complexity theory
Feigenbaum, J. (1993) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/013/05 · Cited by 29 · see citing works
SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
WILLIAMS, H. C. (1985) · Cryptologia · doi:10.1080/0161-118591859942 · Cited by 24 · see citing works
Some Public-Key Crypto-Functions as Intractable as Factorization
Williams, H. C. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_7 · Cited by 18 · see citing works
On the complexity of breaking the Diffie-Hellman protocol
Maurer, U. M., & Wolf, S. (1996) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-006651578 · Cited by 10 · see citing works
KALlPHA, S. M., Sada, J. W. A., & HUSSAIN, H. A. (1990) · International Journal of Systems Science · doi:10.1080/00207729008910354 · Cited by 8 · see citing works
A Generalization of Public Key Residue Cryptosystem
Park, S.-J., & Won, D. (1993) · India Software Engineering Conference · Cited by 6 · see citing works
Flagged first, then by citations
1 of the 33 references couldn’t be matched to a known paper.
Cited by
Sorted by citations
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · see citing works
SecureML: A System for Scalable Privacy-Preserving Machine Learning
Mohassel, P., & Zhang, Y. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.12 · Cited by 1,936 · see citing works
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Kobbi Nissim, B. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,679 · see citing works
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption
Phong, L. T., Aono, Y., Hayashi, T., Wang, L., & Moriai, S. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2787987 · Cited by 1,662 · see citing works
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,466 · see citing works
A Survey on IoT Security: Application Areas, Security Threats, and Solution Architectures
Hassija, V., Chamola, V., Saxena, V., Jain, D., Goyal, P., & Sikdar, B. (2019) · IEEE Access · doi:10.1109/access.2019.2924045 · Cited by 1,445 · see citing works
A Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection
Li, Q., Wen, Z., Wu, Z., Hu, S., Wang, N., Li, Y., Liu, X., & He, B. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3124599 · Cited by 1,407 · see citing works
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 · see citing works
Efficient Private Matching and Set Intersection
Freedman, M. J., Kobbi Nissim, B., & Benny Pinkas, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_1 · Cited by 1,294 · see citing works
Popa, R. A., Redfield, C. M. S., Zeldovich, N., & Balakrishnan, H. (2011) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/2043556.2043566 · Cited by 1,166 · see citing works
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,114 · see citing works
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077 · see citing works
Federated learning on non-IID data: A survey
Zhu, H., Xu, J., Liu, S., & Jin, Y. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.07.098 · Cited by 1,062 · see citing works
Damgård, I., & Jurik, M. J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44586-2_9 · Cited by 1,058 · see citing works
A Hybrid Approach to Privacy-Preserving Federated Learning
Truex, S., Baracaldo, N., Anwar, A., Steinke, T., Ludwig, H., Zhang, R., & Zhou, Y. (2019) · Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security · doi:10.1145/3338501.3357370 · Cited by 1,029 · see citing works
Can homomorphic encryption be practical?
Naehrig, M., Lauter, K., & Vaikuntanathan, V. (2011) · Cloud Computing Security Workshop · doi:10.1145/2046660.2046682 · Cited by 1,027 · see citing works
Security and Privacy on Blockchain
Zhang, R., Xue, R., & Liu, L. (2019) · ACM Computing Surveys · doi:10.1145/3316481 · Cited by 1,024 · see citing works
Cramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 988 · see citing works
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Demmler, D., Schneider, T. H., & Zohner, M. (2015) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23113 · Cited by 841 · see citing works
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 841 · see citing works
A survey on privacy protection in blockchain system
Feng, Q., He, D., Zeadally, S., Khan, M. K., & Kumar, N. (2019) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.10.020 · Cited by 804 · see citing works
EPPA: An Efficient and Privacy-Preserving Aggregation Scheme for Secure Smart Grid Communications
Lu, R., Liang, X., Li, X., Lin, X., & Shen, X. (2012) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.86 · Cited by 769 · see citing works
Quadratic Span Programs and Succinct NIZKs without PCPs
Gennaro, R., Gentry, C., Parno, B. J., & Raykova, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9_37 · Cited by 751 · see citing works
Oblivious Neural Network Predictions via MiniONN Transformations
Liu, J., Juuti, M., Lu, Y., & Asokan, N. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3134056 · Cited by 711 · see citing works
Machine Learning Classification over Encrypted Data
Bost, R., Popa, R. A., Tu, S., & Goldwasser, S. (2015) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23241 · Cited by 683 · see citing works
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 672 · see citing works
SecureBoost: A Lossless Federated Learning Framework
Cheng, K., Fan, T., Jin, Y., Liu, Y., Chen, T., Papadopoulos, D., & Yang, Q. (2021) · IEEE Intelligent Systems · doi:10.1109/mis.2021.3082561 · Cited by 669 · see citing works
Security and Privacy for Cloud-Based IoT: Challenges
Zhou, J., Cao, Z., Dong, X., & Vasilakos, A. V. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2017.1600363cm · Cited by 667 · see citing works
Privacy-Preserving Set Operations
Kissner, L., & Song, D. X. (2005) · Lecture notes in computer science · doi:10.1007/11535218_15 · Cited by 660 · see citing works
Securing Fog Computing for Internet of Things Applications: Challenges and Solutions
Ni, J., Zhang, K., Lin, X., & Shen, X. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2762345 · Cited by 659 · see citing works
A secure federated transfer learning framework
Liu, Y., Kang, Y., Xing, C., Chen, T., & Yang, Q. (2020) · IEEE Intelligent Systems · doi:10.1109/mis.2020.2988525 · Cited by 645 · see citing works
Lossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. R. (2008) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 640 · see citing works
Yin, X., Zhu, Y., & Hu, J. (2022) · ACM Computing Surveys · doi:10.1145/3460427 · Cited by 638 · see citing works
Privacy-preserving <i>k</i> -means clustering over vertically partitioned data
Vaidya, J., & Clifton, C. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956776 · Cited by 626 · see citing works
DeepFed: Federated Deep Learning for Intrusion Detection in Industrial Cyber–Physical Systems
Li, B., Wu, Y., Song, J., Lu, R., Li, T., & Zhao, L. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3023430 · Cited by 623 · see citing works
DeepChain: Auditable and Privacy-Preserving Deep Learning with Blockchain-based Incentive
Weng, J., Weng, J., Zhang, J., Li, M., Zhang, Y., & Luo, W. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2952332 · Cited by 610 · see citing works
Privacy-Preserving Face Recognition
Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., & Toft, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03168-7_14 · Cited by 592 · see citing works
Multiparty 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 591 · see citing works
Secure Information Aggregation for Smart Grids Using Homomorphic Encryption
Li, F., Luo, B., & Liu, P. (2010) · IEEE International Conference on Smart Grid Communications (SmartGridComm) · doi:10.1109/smartgrid.2010.5622064 · Cited by 574 · see citing works
Secure Multiparty Computation for Privacy-Preserving Data Mining
Lindell, Y., & Benny Pinkas, B. (2009) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v1i1.566 · Cited by 566 · see citing works
Privacy and Robustness in Federated Learning: Attacks and Defenses
Lyu, L., Yu, H., Ma, X., Chen, C., Sun, L., Zhao, J., Yang, Q., & Yu, P. S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3216981 · Cited by 548 · see citing works
Data Security and Privacy Protection for Cloud Storage: A Survey
Yang, P., Xiong, N. N., & Ren, J. (2020) · IEEE Access · doi:10.1109/access.2020.3009876 · Cited by 545 · see citing works
Practical Verifiable Encryption and Decryption of Discrete Logarithms
Camenisch, J. L., & Shoup, V. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_8 · Cited by 543 · see citing works
A Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 541 · see citing works
Data security and privacy-preserving in edge computing paradigm: survey and open issues
Zhang, J., Chen, B., Zhao, Y., Cheng, X., & Hu, F. (2018) · IEEE Access · doi:10.1109/access.2018.2820162 · Cited by 514 · see citing works
Johnson, R. T., Molnár, D., Song, D. X., & Wagner, D. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45760-7_17 · Cited by 514 · see citing works
Gazelle: A Low Latency Framework for Secure Neural Network InferencePreprint
Juvekar, C., Vaikuntanathan, V., & Chandrakasan, A. P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.05507 · Cited by 503 · see citing works
A Survey of Homomorphic Encryption for Nonspecialists
Fontaine, C., & Galand, F. (2007) · EURASIP Journal on Information Security · doi:10.1155/2007/13801 · Cited by 491 · see citing works
A Lightweight Privacy-Preserving Data Aggregation Scheme for Fog Computing-Enhanced IoT
Lu, R., Heung, K., Lashkari, A. H., & Ghorbani, A. A. (2017) · IEEE Access · doi:10.1109/access.2017.2677520 · Cited by 478 · see citing works
Secure Federated Matrix Factorization
Chai, D., Wang, L., Chen, K., & Yang, Q. (2020) · IEEE Intelligent Systems · doi:10.1109/mis.2020.3014880 · Cited by 473 · see citing works
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
Coron, J.-S., Mandal, A., Naccache, D., & Tibouchi, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_28 · Cited by 469 · see citing works
Secure Single-Server Aggregation with (Poly)Logarithmic Overhead
Bell, J., Bonawitz, K., Gascón, A., Lepoint, T., & Raykova, M. (2020) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3372297.3417885 · Cited by 469 · see citing works
Routes for breaching and protecting genetic privacy
Erlich, Y., & Narayanan, A. (2014) · Nature Reviews Genetics · doi:10.1038/nrg3723 · Cited by 466 · see citing works
Privacy‐preserving federated learning based on multi‐key homomorphic encryption
Ma, J., Naas, S., Sigg, S., & Lyu, X. (2022) · International Journal of Intelligent Systems · doi:10.1002/int.22818 · Cited by 458 · see citing works
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records
Nikolaenko, V., Weinsberg, U., Ioannidis, S., Jóye, M., Boneh, D., & Taft, N. (2013) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2013.30 · Cited by 447 · see citing works
Coercion-resistant electronic elections
Juels, A., Catalano, D., & Jakobsson, M. (2005) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1102199.1102213 · Cited by 446 · see citing works
Keyword Search and Oblivious Pseudorandom Functions
Freedman, M. J., Ishai, Y., Benny Pinkas, B., & Reingold, O. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_17 · Cited by 444 · see citing works
Supply Chain Finance Innovation Using Blockchain
Du, M., Chen, Q., Xiao, J., Yang, H., & Ma, X. (2020) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2020.2971858 · Cited by 441 · see citing works
Hardy, S., Henecka, W., Ivey-Law, H., Nock, R., Patrini, G., Smith, G., & Thorne, B. (2017) · arXiv · doi:10.48550/arxiv.1711.10677 · Cited by 431 · see citing works
Privacy Preserving Machine Learning with Homomorphic Encryption and Federated Learning
Fang, H., & Qian, Q. (2021) · Future Internet · doi:10.3390/fi13040094 · Cited by 424 · see citing works
Anatomy of Threats to the Internet of Things
Makhdoom, I., Abolhasan, M., Lipman, J., Liu, R. P., & Ni, W. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2874978 · Cited by 418 · see citing works
Practical Private Set Intersection Protocols with Linear Complexity
Cristofaro, E. D., & Tsudik, G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14577-3_13 · Cited by 417 · see citing works
Detection of False Data Injection Attacks in Smart Grid: A Secure Federated Deep Learning Approach
Li, Y., Wei, X., Li, Y., Dong, Z. Y., & Shahidehpour, M. (2022) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2022.3204796 · Cited by 414 · see citing works
Civitas: Toward a Secure Voting System
Clarkson, M. R., Chong, S., & Myers, A. C. (2008) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2008.32 · Cited by 406 · see citing works
Securing smart grid: cyber attacks, countermeasures, and challenges
Li, X., Liang, X., Lu, R., Shen, X., Lin, X., & Zhu, H. (2012) · IEEE Communications Magazine · doi:10.1109/mcom.2012.6257525 · Cited by 405 · see citing works
Big data privacy: a technological perspective and review
Jain, P., Gyanchandani, M., & Khare, N. (2016) · Journal Of Big Data · doi:10.1186/s40537-016-0059-y · Cited by 405 · see citing works
Priced Oblivious Transfer: How to Sell Digital Goods
Aiello, B., Ishai, Y., & Reingold, O. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_8 · Cited by 397 · see citing works
Yang, Q., Liu, Y., Cheng, Y., Kang, Y., Chen, T., & Yu, H. (2019) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00960ed2v01y201910aim043 · Cited by 397 · see citing works
Secure k-nearest neighbor query over encrypted data in outsourced environments
Elmehdwi, Y., Samanthula, B. K., & Jiang, W. (2014) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2014.6816690 · Cited by 392 · see citing works
A New Randomness Extraction Paradigm for Hybrid Encryption
Kiltz, E., Pietrzak, K., Stam, M., & Yung, M. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01001-9_34 · Cited by 388 · see citing works
Verifiable Delegation of Computation over Large Datasets
Benabbas, S., Gennaro, R., & Vahlis, Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_7 · Cited by 381 · see citing works
Privacy-Friendly Energy-Metering via Homomorphic Encryption
Garcia, F. D., & Jacobs, B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22444-7_15 · Cited by 377 · see citing works
From distributed machine learning to federated learning: a survey
Liu, J., Huang, J., Zhou, Y., Li, X., Ji, S., Xiong, H., & Dou, D. (2022) · Knowledge and Information Systems · doi:10.1007/s10115-022-01664-x · Cited by 374 · see citing works
On Private Scalar Product Computation for Privacy-Preserving Data Mining
Goethals, B., Laur, S., Lipmaa, H., & Mielikäinen, T. (2005) · Lecture notes in computer science · doi:10.1007/11496618_9 · Cited by 372 · see citing works
Towards secure mobile cloud computing: a survey
Khan, A. N., Mat Kiah, M. L., Khan, S. U., & Madani, S. A. (2013) · Future Generation Computer Systems · doi:10.1016/j.future.2012.08.003 · Cited by 368 · see citing works
Efficient Privacy-Preserving Face Recognition
Sadeghi, A., Schneider, T. H., & Wehrenberg, I. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14423-3_16 · Cited by 366 · see citing works
Processing analytical queries over encrypted data
Tu, S., Kaashoek, M. F., Madden, S., & Zeldovich, N. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2535573.2488336 · Cited by 363 · see citing works
A Survey on Big Data Market: Pricing, Trading and Protection
Liang, F., Yu, W., An, D., Yang, Q., Fu, X., & Zhao, W. (2018) · IEEE Access · doi:10.1109/access.2018.2806881 · Cited by 361 · see citing works
Structure-Preserving Signatures and Commitments to Group Elements
Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., & Ohkubo, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_12 · Cited by 357 · see citing works
A Survey of Provably Secure Searchable Encryption
Bösch, C., Hartel, P., Jonker, W., & Peter, A. (2014) · ACM Computing Surveys · doi:10.1145/2636328 · Cited by 357 · see citing works
Semi-homomorphic Encryption and Multiparty Computation
Bendlin, R., Damgård, I., Orlandi, C., & Zakarias, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20465-4_11 · Cited by 356 · see citing works
Henecka, W., ögl, S. K., Sadeghi, A., Schneider, T. H., & Wehrenberg, I. (2010) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1866307.1866358 · Cited by 356 · see citing works
Luong, N. C., Hoang, D. T., Wang, P., Niyato, D. T., Kim, D. I., & Han, Z. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2582841 · Cited by 355 · see citing works
On the Exact Security of Full Domain Hash
Coron, J.-S. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_14 · Cited by 354 · see citing works
Secure and Privacy-Preserving Consensus
Ruan, M., Gao, H. B., & Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2890887 · Cited by 352 · see citing works
Privacy-Enhanced Federated Learning Against Poisoning Adversaries
Liu, X., Li, H., Xu, G., Chen, Z., Huang, X., & Lu, R. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3108434 · Cited by 351 · see citing works
Jia, B., Zhang, X., Liu, J., Zhang, Y., Huang, K., & Liang, Y. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3085960 · Cited by 351 · see citing works
Lagendijk, R. L., & Barni, M. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219653 · Cited by 334 · see citing works
Authentication Protocols for Internet of Things: A Comprehensive Survey
Ferrag, M. A., Maglaras, L. A., Janicke, H., Jiang, J., & Shu, L. (2017) · Security and Communication Networks · doi:10.1155/2017/6562953 · Cited by 331 · see citing works
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 326 · see citing works
Toward efficient and privacy-preserving computing in big data era
Lu, R., Zhu, H., Liu, X., Liu, J. K., & Shao, J. (2014) · IEEE Network · doi:10.1109/mnet.2014.6863131 · Cited by 325 · see citing works
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323 · see citing works
Security and Privacy in Device-to-Device (D2D) Communication: A Review
Haus, M., Waqas, M. M., Ding, A. Y., Li, Y., Tarkoma, S., & Ott, J. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2649687 · Cited by 318 · see citing works
Secure and practical outsourcing of linear programming in cloud computing
Wang, C., Ren, K., & Wang, J. S. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5935305 · Cited by 315 · see citing works
Robustness, Security and Privacy in Location-Based Services for Future IoT: A Survey
Chen, L., Thombre, S., Jarvinen, K., Lohan, E. S., Alen-Savikko, A., Leppakoski, H., Bhuiyan, M. Z. H., Bu-Pasha, S., Ferrara, G. N., Honkala, S., et al. (2017) · IEEE Access · doi:10.1109/access.2017.2695525 · Cited by 313 · see citing works
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
Agrawal, S., Libert, B., & Stehlé, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53015-3_12 · Cited by 312 · see citing works
Smart Meter Data Privacy: A Survey
Asghar, M. R., Dán, G., Miorandi, D., & Imrich Chlamtac, A. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2720195 · Cited by 309 · see citing works
Secure Hybrid Encryption from Weakened Key Encapsulation
Hofheinz, D., & Kiltz, E. (2007) · Springer eBooks · doi:10.1007/978-3-540-74143-5_31 · Cited by 305 · see citing works
Spatial crowdsourcing: a survey
Tong, Y., Zhou, Z., Zeng, Y., Chen, L., & Shahabi, C. (2019) · The VLDB Journal · doi:10.1007/s00778-019-00568-7 · Cited by 305 · see citing works
Privacy-Preserving Byzantine-Robust Federated Learning via Blockchain Systems
Miao, Y., Liu, Z., Li, H., Choo, K.-K. R., & Deng, R. H. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3196274 · Cited by 303 · see citing works
- Authors
- Paillier, P.
- Affiliations
- Télécom Paris (FR)
- Corresponding author
- Paillier, Pascal
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-10-10
- Pages
- 223-238
- OpenAlex
- W2132172731
- Cited by
- 7,250
- References
- 33
- Citations by year
- 2026: 199 · 2025: 370 · 2024: 434 · 2023: 429 · 2022: 445 · 2021: 493 · 2020: 476 · 2019: 469 · 2018: 493 · 2017: 447 · 2016: 398 · 2015: 363 · 2014: 336 · 2013: 344 · 2012: 263
- FWCI
- 147.26
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Springer eBooks (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Keywords
- public-key cryptography, trapdoor permutations, homomorphic encryption, probabilistic encryption, modular arithmetic, standard model security
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