Tal Malkin
Artificial Intelligence · 2000–2019
A researcher in the Science corpus: 9 papers; trusts 33 researchers and is trusted by 22 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 103 citations into it; #8,327 of 35,345 by trust here, #8,210 by citations
- Computational Theory and Mathematics — 37 citations into it; #2,638 of 12,182 by trust here, #1,379 by citations
- Privacy & Security — 37 citations into it
- Computer Networks and Communications — 25 citations into it
- Computer Vision and Pattern Recognition — 21 citations into it; #13,223 of 21,575 by trust here, #17,757 by citations
- Hardware and Architecture — 15 citations into it; #750 of 1,551 by trust here, #828 by citations
- Electrical and Electronic Engineering — 12 citations into it
- Statistics and Probability — 7 citations into it
Whom Tal Malkin trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Oded Goldreich
- Yuval Ishai
- Eyal Kushilevitz
- Ran Canetti
- Piotr Indyk
- Julien P. Stern
- Craig Gentry
- Amos Beimel
- Clément Louis Canonne
- Amit Chakrabarti
Who trusts Tal Malkin overall
- Yuval Ishai
- Amos Beimel
- François-Xavier Standaert
- Assi Barak
- Houssem Maghrebi
- Marcel Keller
- David P. Woodruff
- Lejla Batina
- Sarvar Patel
- Eyal Kushilevitz
Papers from Tal Malkin's perspective
Ordered by how strongly the researchers Tal Malkin trusts endorse each paper. Same corpus, a different order for every researcher.
- Probabilistic Encryption
- Replication is not needed: single database, computationally-private information retrieval
- Fair exchange with a semi-trusted third party (extended abstract)
- How To Exchange Secrets with Oblivious Transfer
- Security and Composition of Multiparty Cryptographic Protocols (Journal of Cryptology)
- Private information retrieval
- How to play ANY mental game
- Computationally Private Information Retrieval with Polylogarithmic Communication
- Completeness theorems for non-cryptographic fault-tolerant distributed computation
- Fully homomorphic encryption using ideal lattices
Their papers
- Secure multiparty computation of approximations (2001) — 208 citations
- Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing (2004) — 231 citations
- Secure two-party computation in sublinear (amortized) time (2012) — 199 citations
- Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing (2000) — 52 citations
- Garbling Gadgets for Boolean and Arithmetic Circuits (2016) — 80 citations
- Two Party Distribution Testing: Communication and Security (2018) — 15 citations
- Garbled Neural Networks are Practical (2019) — 52 citations
- BiTR: Built-in Tamper Resilience (2011) — 577 citations
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks (extended version) (2009) — 993 citations