Vladimir Kolesnikov

Artificial Intelligence · 2008–2019

A researcher in the Science corpus: 7 papers; trusts 76 researchers and is trusted by 81 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 129 citations into it; #2,180 of 35,345 by trust here, #6,229 by citations
• Computational Theory and Mathematics — 67 citations into it; #2,860 of 12,182 by trust here, #2,489 by citations
• Privacy & Security — 46 citations into it; #57 of 709 by trust here, #252 by citations
• Computer Vision and Pattern Recognition — 18 citations into it
• Information Systems — 17 citations into it; #2,135 of 8,771 by trust here, #4,188 by citations
• Computer Networks and Communications — 13 citations into it; #241 of 9,886 by trust here, #1,570 by citations

Whom Vladimir Kolesnikov trusts overall

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

1. Benny Pinkas
2. Moni Naor
3. Oded Goldreich
4. Yuval Ishai
5. Thomas Schneider
6. Yehuda Lindell
7. Mihir Bellare
8. Dahlia Malkhi
9. Shafi Goldwasser
10. Ivan Bjerre Damgård

Who trusts Vladimir Kolesnikov overall

1. Yan Huang
2. David E. Evans
3. Thomas Schneider
4. Ahmad-Reza Sadeghi
5. Jonathan Katz
6. Ebrahim M. Songhori
7. Benny Pinkas
8. Xiao Shaun Wang
9. Mike Rosulek
10. Payman Mohassel

Papers from Vladimir Kolesnikov's perspective

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

1. Fair exchange with a semi-trusted third party (extended abstract)
2. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
3. Protocols for secure computations
4. Random oracles are practical: a paradigm for designing efficient protocols
5. Probabilistic Encryption
6. Fairplay - Secure Two-Party Computation System
7. Private information retrieval
8. How to play ANY mental game
9. How to share a secret
10. Fully homomorphic encryption using ideal lattices

Their papers

• Improved Garbled Circuit: Free XOR Gates and Applications (2008) — 851 citations
• Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima (2009) — 286 citations
• Secure two-party computation in sublinear (amortized) time (2012) — 199 citations
• A Pragmatic Introduction to Secure Multi-Party Computation (2019) — 499 citations
• Scalable Private Set Union from Symmetric-Key Techniques (2019) — 85 citations
• Practical Multi-party Private Set Intersection from Symmetric-Key Techniques (2017) — 256 citations
• Efficient Batched Oblivious PRF with Applications to Private Set Intersection (2016) — 440 citations