Andrey Kim

Artificial Intelligence · 2017–2022

A researcher in the Science corpus: 5 papers; trusts 26 researchers and is trusted by 10 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 75 citations into it; #9,804 of 35,345 by trust here, #12,761 by citations
• Computational Theory and Mathematics — 40 citations into it; #3,828 of 12,182 by trust here, #3,448 by citations
• Privacy & Security — 25 citations into it
• Information Systems — 13 citations into it; #2,011 of 8,771 by trust here, #2,471 by citations
• Computer Vision and Pattern Recognition — 11 citations into it; #19,663 of 21,575 by trust here, #18,266 by citations

Whom Andrey Kim trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Craig Gentry
2. Zvika Brakerski
3. Shai Halevi
4. Jung Hee Cheon
5. Nigel P. Smart
6. Yurii E. Nesterov
7. Vinod Vaikuntanathan
8. Miran Kim
9. Vadim Lyubashevsky
10. Chris Peikert

Who trusts Andrey Kim overall

1. Hao Chen
2. M. Sadegh Riazi
3. Kim Laine
4. Wei Dai
5. Miran Kim
6. Yongsoo Song
7. Jinhyun So
8. Blake Pelton
9. Jung Hee Cheon
10. Zhicong Huang

Papers from Andrey Kim's perspective

Ordered by how strongly the researchers Andrey Kim trusts endorse each paper. Same corpus, a different order for every researcher.

1. Fully homomorphic encryption using ideal lattices
2. On Ideal Lattices and Learning with Errors over Rings
3. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
4. A fully homomorphic encryption scheme
5. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
6. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
7. SecureML: A System for Scalable Privacy-Preserving Machine Learning
8. Efficient Fully Homomorphic Encryption from (Standard) LWE
9. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (Annual International Cryptology Conference)
10. Better Key Sizes (and Attacks) for LWE-Based Encryption

Their papers

• Bootstrapping for Approximate Homomorphic Encryption (2018) — 436 citations
• Homomorphic Encryption for Arithmetic of Approximate Numbers (2017) — 2,700 citations
• OpenFHE: Open-Source Fully Homomorphic Encryption Library (2022) — 451 citations
• A Full RNS Variant of Approximate Homomorphic Encryption (2018) — 476 citations
• Logistic regression model training based on the approximate homomorphic encryption (2018) — 242 citations