Niv Gilboa

Artificial Intelligence · 1997–2019

A researcher in the Science corpus: 8 papers; trusts 39 researchers and is trusted by 9 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 108 citations into it; #11,184 of 35,345 by trust here, #17,776 by citations
• Computational Theory and Mathematics — 68 citations into it; #3,468 of 12,182 by trust here, #4,850 by citations
• Privacy & Security — 47 citations into it; #626 of 709 by trust here, #690 by citations
• Information Systems — 17 citations into it; #3,860 of 8,771 by trust here, #5,501 by citations
• Computer Networks and Communications — 11 citations into it; #3,848 of 9,886 by trust here, #7,492 by citations
• Computer Vision and Pattern Recognition — 9 citations into it
• Algorithms & Complexity — 7 citations into it
• Game & Decision Theory — 5 citations into it

Whom Niv Gilboa trusts overall

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

1. Shafi Goldwasser
2. Rafail M. Ostrovsky
3. Benny Chor
4. Silvio Micali
5. Josh Benaloh
6. Eyal Kushilevitz
7. Craig Gentry
8. Oded Goldreich
9. Dan Boneh
10. Helger Lipmaa

Who trusts Niv Gilboa overall

1. Elette Boyle
2. Yuval Ishai
3. Henry Corrigan-Gibbs
4. Daniel Demmler
5. Marcel Keller
6. Adrià Gascón
7. Carmit Hazay
8. Nitin Agrawal
9. Femi G. Olumofin
10. Ian Goldberg

Papers from Niv Gilboa's perspective

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

1. Replication is not needed: single database, computationally-private information retrieval
2. Probabilistic Encryption
3. Computationally Private Information Retrieval with Polylogarithmic Communication
4. How to share a secret
5. Security and Composition of Multiparty Cryptographic Protocols (Journal of Cryptology)
6. Private information retrieval
7. Checking computations in polylogarithmic time
8. Fair exchange with a semi-trusted third party (extended abstract)
9. Fully homomorphic encryption using ideal lattices
10. How to Prove Yourself: Practical Solutions to Identification and Signature Problems

Their papers

• Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019) — 162 citations
• Distributed Point Functions and Their Applications (2014) — 270 citations
• Function Secret Sharing: Improvements and Extensions (2016) — 417 citations
• Efficient Pseudorandom Correlation Generators: Silent OT Extension and More (2019) — 269 citations
• Function Secret Sharing (2015) — 400 citations
• Two Party RSA Key Generation (1999)
• Private Information Retrieval by Keywords (1998)
• Computationally private information retrieval (extended abstract) (1997)