World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
42
Citations
16172
World Ranking
8152
National Ranking
3493

Overview

Mariana Raykova is affiliated with Google in the United States. Their research primarily spans the field of Computer Science, with a specialized focus on Artificial Intelligence as well as related subfields such as Computational Theory and Mathematics, Information Systems, Computer Networks and Communications, and Computer Science Applications.

Their work covers several main topics, including:

  • Privacy-Preserving Technologies in Data
  • Cryptography and Data Security
  • Internet Traffic Analysis and Secure E-voting
  • Complexity and Algorithms in Graphs
  • Mobile Crowdsensing and Crowdsourcing
  • Cryptographic Implementations and Security
  • Stochastic Gradient Optimization Techniques

Mariana Raykova's recent publications include:

  • Advances and Open Problems in Federated Learning, 2020, Foundations and Trends® in Machine Learning
  • Distributed, Private, Sparse Histograms in the Two-Server Model, 2022, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • UN Handbook on Privacy-Preserving Computation Techniques, 2023, arXiv (Cornell University)
  • Think Global, Act Local: Gossip and Client Audits in Verifiable Data Structures, 2020, arXiv (Cornell University)
  • Differentially Private Ad Conversion Measurement, 2024, Proceedings on Privacy Enhancing Technologies

The frequent co-authors collaborating with Raykova include Tancrède Lepoint, Adrià Gascón, Pasin Manurangsi, Fabrice Benhamouda, and Michele Orrù.

Publications are frequently found in the following venues:

  • arXiv (Cornell University)
  • Proceedings on Privacy Enhancing Technologies
  • Foundations and Trends® in Machine Learning
  • Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • Journal of Cryptology

Best Publications

  • Advances and Open Problems in Federated Learning

    Peter Kairouz;H. Brendan McMahan;Brendan Avent;Aurélien Bellet

  • Pinocchio: nearly practical verifiable computation

    Bryan Parno;Jon Howell;Craig Gentry;Mariana Raykova

  • Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

    Sanjam Garg;Craig Gentry;Shai Halevi;Mariana Raykova

  • Advances and open problems in federated learning

    Peter Kairouz;H. Brendan McMahan;Brendan Avent;Aurélien Bellet

  • RapidChain: Scaling Blockchain via Full Sharding

    Mahdi Zamani;Mahnush Movahedi;Mariana Raykova

  • Quadratic Span Programs and Succinct NIZKs without PCPs

    Rosario Gennaro;Craig Gentry;Bryan Parno;Mariana Raykova

  • How to delegate and verify in public: verifiable computation from attribute-based encryption

    Bryan Parno;Mariana Raykova;Vinod Vaikuntanathan

  • Secure Single-Server Aggregation with (Poly)Logarithmic Overhead

    James Henry Bell;Kallista A. Bonawitz;Adrià Gascón;Tancrède Lepoint

  • Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation

    Dan Boneh;Kevin Lewi;Mariana Raykova;Amit Sahai

  • Optimizing ORAM and Using It Efficiently for Secure Computation

    Craig Gentry;Kenny A. Goldman;Shai Halevi;Charanjit Julta

  • Efficient robust private set intersection

    Dana Dachman-Soled;Tal Malkin;Mariana Raykova;Moti Yung

  • Privacy-Preserving Distributed Linear Regression on High-Dimensional Data

    Adrià Gascón;Phillipp Schoppmann;Borja Balle;Mariana Raykova

  • Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

    Sanjam Garg;Craig Gentry;Shai Halevi;Mariana Raykova

  • Outsourcing Multi-Party Computation.

    Seny Kamara;Payman Mohassel;Mariana Raykova

  • Efficient Robust Private Set Intersection

    Dana Dachman-Soled;Tal Malkin;Mariana Raykova;Moti Yung

  • Secure two-party computation in sublinear (amortized) time

    S. Dov Gordon;Jonathan Katz;Vladimir Kolesnikov;Fernando Krell

  • Two-Round Secure MPC from Indistinguishability Obfuscation

    Sanjam Garg;Craig Gentry;Shai Halevi;Mariana Raykova

  • Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations

    Jean-Sébastien Coron;Craig Gentry;Shai Halevi;Tancrède Lepoint

  • Scaling Private Set Intersection to Billion-Element Sets

    Seny Kamara;Payman Mohassel;Mariana Raykova;Seyed Saeed Sadeghian

  • Multi-input Inner-Product Functional Encryption from Pairings

    Michel Abdalla;Mariana Raykova;Hoeteck Wee

  • Pinocchio: Nearly Practical Verifiable Computation.

    Bryan Parno;Craig Gentry;Jon Howell;Mariana Raykova

Frequent Co-Authors

Craig Gentry
Craig Gentry TripleBlind
Tal Malkin
Tal Malkin Columbia University
Shai Halevi
Shai Halevi Amazon (United States)
Steven M. Bellovin
Steven M. Bellovin Columbia University
Bryan Parno
Bryan Parno Carnegie Mellon University
Moti Yung
Moti Yung Columbia University
Amit Sahai
Amit Sahai University of California, Los Angeles
Daniel Wichs
Daniel Wichs Northeastern University
Sanjam Garg
Sanjam Garg University of California, Berkeley
David Evans
David Evans University of Virginia

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing Computer Science in the USA opens a variety of online degree options that cater to different career stages and objectives. For those looking to start quickly, online associate's degree programs offer a fast track to entry-level positions and foundational knowledge in programming, networking, and systems analysis.

Mid-career professionals or recent graduates can boost their qualifications and earning potential by considering certificate programs that pay well. These often focus on specialized skills like cybersecurity, data analytics, or cloud computing, and can be completed more quickly than full degrees.

For those seeking leadership or advanced technical roles, the shortest online masters degree options allow ambitious learners to earn a respected credential without spending years in school. This can fast-track career advancement and open doors to high-paying opportunities.

If you are weighing your educational investment, exploring graduate degrees that are worth it can help you choose programs with strong demand and long-term value.

Best Scientists Citing Mariana Raykova

Trending Scientists

Recently Published Articles