Mariana Raykova
Artificial Intelligence · 2012–2020
A researcher in the Science corpus: 15 papers; trusts 100 researchers and is trusted by 69 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 712 citations into it; #3,788 of 36,961 by trust here, #2,036 by citations
- Privacy & Security — 299 citations into it; #85 of 710 by trust here, #72 by citations
- Computational Theory and Mathematics — 197 citations into it; #1,940 of 12,489 by trust here, #1,298 by citations
- Computer Networks and Communications — 168 citations into it; #1,492 of 9,996 by trust here, #1,001 by citations
- Information Systems — 134 citations into it; #3,022 of 9,233 by trust here, #2,815 by citations
- Computer Vision and Pattern Recognition — 80 citations into it
- ML Systems & Hardware — 39 citations into it
- Algorithms & Complexity — 31 citations into it
Whom Mariana Raykova trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Oded Goldreich
- Silvio Micali
- Dan Boneh
- Benny Pinkas
- Yehuda Lindell
- Amit Sahai
- Ivan Bjerre Damgård
- Pascal Paillier
- Moni Naor
Who trusts Mariana Raykova overall
- Eli Ben-Sasson
- Srinath T. V. Setty
- Rosario Gennaro
- Michael Walfish
- Shafi Goldwasser
- Alessandro Chiesa
- Riad S. Wahby
- Bryan Parno
- Dan Boneh
- Dario Fiore
Papers from Mariana Raykova's perspective
Ordered by how strongly the researchers Mariana Raykova trusts endorse each paper. Same corpus, a different order for every researcher.
- Fully homomorphic encryption using ideal lattices
- Fair exchange with a semi-trusted third party (extended abstract)
- Random oracles are practical: a paradigm for designing efficient protocols
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Protocols for secure computations
- New Directions in Cryptography
- Fairplay - Secure Two-Party Computation System
- Private information retrieval
- How to play ANY mental game
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
Their papers
- Advances and Open Problems in Federated Learning (2019) — 9,019 citations
- Privacy-Preserving Distributed Linear Regression on High-Dimensional Data (2017) — 228 citations
- On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications (2019) — 51 citations
- Secure Single-Server Aggregation with (Poly)Logarithmic Overhead (2020) — 580 citations
- Quadratic Span Programs and Succinct NIZKs without PCPs (2013) — 917 citations
- Secure two-party computation in sublinear (amortized) time (2012) — 199 citations
- PanORAMa: Oblivious RAM with Logarithmic Overhead (2018) — 97 citations
- Private Join and Compute from PIR with Default (2020) — 37 citations
- Communication-Computation Trade-offs in PIR (2019) — 130 citations
- Secure Computation for Machine Learning With SPDZ (2019) — 66 citations
- RapidChain: Scaling Blockchain via Full Sharding (2018) — 1,122 citations
- Secure Linear Regression on Vertically Partitioned Datasets (2016) — 108 citations
- Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013) — 1,329 citations
- Pinocchio: Nearly Practical Verifiable Computation (2013) — 1,238 citations
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption (2012) — 379 citations