Yuriy Polyakov
Artificial Intelligence · 2019–2022
A researcher in the Science corpus: 3 papers; trusts 10 researchers and is trusted by 9 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 37 citations into it; #13,880 of 35,345 by trust here, #23,731 by citations
- Computational Theory and Mathematics — 22 citations into it
- Information Systems — 15 citations into it; #2,620 of 8,771 by trust here, #5,303 by citations
- Privacy & Security — 11 citations into it
Whom Yuriy Polyakov trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Zvika Brakerski
- Junfeng Fan
- David Harvey
- Shai Halevi
- Frederik Vercauteren
- Vinod Vaikuntanathan
- Hao Chen
- Chris Peikert
- Oded Regev
Who trusts Yuriy Polyakov overall
Papers from Yuriy Polyakov's perspective
Ordered by how strongly the researchers Yuriy Polyakov trusts endorse each paper. Same corpus, a different order for every researcher.
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- A fully homomorphic encryption scheme
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Homomorphic Encryption over the Integers
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- On Ideal Lattices and Learning with Errors over Rings
Their papers
- OpenFHE: Open-Source Fully Homomorphic Encryption Library (2022) — 451 citations
- An Improved RNS Variant of the BFV Homomorphic Encryption Scheme (2019) — 245 citations
- Implementation and Performance Evaluation of RNS Variants of the BFV Homomorphic Encryption Scheme (2019) — 132 citations