Elette Boyle

Artificial Intelligence · 2014–2019

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

Subfields

• Artificial Intelligence — 129 citations into it; #11,699 of 35,345 by trust here, #14,181 by citations
• Computational Theory and Mathematics — 78 citations into it; #8,068 of 12,182 by trust here, #5,954 by citations
• Privacy & Security — 44 citations into it; #625 of 709 by trust here, #690 by citations
• Information Systems — 17 citations into it; #3,857 of 8,771 by trust here, #5,501 by citations
• Computer Networks and Communications — 14 citations into it
• Computer Vision and Pattern Recognition — 14 citations into it; #13,230 of 21,575 by trust here, #16,787 by citations
• Geometry and Topology — 5 citations into it
• Program Analysis & Verification — 5 citations into it

Whom Elette Boyle trusts overall

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

1. Niv Gilboa
2. Craig Gentry
3. Yuval Ishai
4. Rafail M. Ostrovsky
5. Silvio Micali
6. Oded Goldreich
7. Dan Boneh
8. Eyal Kushilevitz
9. Benny Chor
10. Shafi Goldwasser

Who trusts Elette Boyle overall

1. Amit Sahai
2. Henry Corrigan-Gibbs
3. Georgios Kaissis
4. Dan Boneh
5. David E. Evans
6. Raphael Bost
7. Sarvar Patel
8. Srinath T. V. Setty
9. Niv Gilboa
10. Sebastian Angel

Papers from Elette Boyle's perspective

Ordered by how strongly the researchers Elette Boyle 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. New Directions in Cryptography
4. Checking computations in polylogarithmic time
5. How to share a secret
6. Security and Composition of Multiparty Cryptographic Protocols (Journal of Cryptology)
7. Computationally Sound Proofs
8. How to Prove Yourself: Practical Solutions to Identification and Signature Problems
9. Probabilistic checking of proofs: a new characterization of NP
10. Private information retrieval

Their papers

• Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019) — 162 citations
• Function Secret Sharing: Improvements and Extensions (2016) — 417 citations
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (2015) — 68 citations
• Efficient Pseudorandom Correlation Generators: Silent OT Extension and More (2019) — 269 citations
• Can We Access a Database Both Locally and Privately? (2017) — 93 citations
• Function Secret Sharing (2015) — 400 citations
• Functional Signatures and Pseudorandom Functions (2014) — 437 citations