Her primary areas of study are Theoretical computer science, Scheme, Secure two-party computation, Homomorphic encryption and Computation. The Theoretical computer science study combines topics in areas such as Cryptography, Class, Verifiable computing, Encryption and Ciphertext indistinguishability. She has researched Scheme in several fields, including Algorithm, mmap and Cryptanalysis.
Her biological study spans a wide range of topics, including Tree, Range query, Binary search algorithm and Security parameter. Mariana Raykova mostly deals with Oblivious ram in her studies of Computation. Her research in Computer security focuses on subjects like Private set intersection, which are connected to Cryptographic protocol.
Her primary scientific interests are in Theoretical computer science, Encryption, Computer security, Cryptography and Computation. Mariana Raykova combines subjects such as Scheme, Homomorphic encryption, Secure multi-party computation, Obfuscation and Functional encryption with her study of Theoretical computer science. She has included themes like Discrete mathematics, Multiple encryption, Compiler and Ciphertext indistinguishability in her Functional encryption study.
Her Encryption research incorporates themes from Overhead, Distributed computing and Bloom filter. Her Cryptography research is multidisciplinary, incorporating perspectives in Verifiable computing and Key. The Computation study which covers Delegate that intersects with Attribute-based encryption and Verifiable secret sharing.
Mariana Raykova mainly investigates Protocol, Computer network, Computer security, Cryptography and Secure multi-party computation. Her studies in Protocol integrate themes in fields like Shuffling and Correctness. As a part of the same scientific family, Mariana Raykova mostly works in the field of Computer network, focusing on Blockchain and, on occasion, Database transaction and Payment.
Her Computer security study frequently links to adjacent areas such as Metadata. Many of her studies involve connections with topics such as Homomorphic encryption and Cryptography. The various areas that she examines in her Secure multi-party computation study include Oblivious transfer, Secret sharing, Artificial intelligence, Bloom filter and Machine learning.
Her scientific interests lie mostly in Computer network, Protocol, Blockchain, Computation and Mobile device. Her study in Computer network is interdisciplinary in nature, drawing from both Secure computing, Graph and Correctness. Her Protocol study incorporates themes from Degree, Differential privacy and Cryptography.
Her work deals with themes such as Scalability, Payment and Database transaction, which intersect with Blockchain. In the field of Computation, her study on Secure multi-party computation overlaps with subjects such as Trade offs. Her Mobile device study combines topics in areas such as Orchestration, Training set and Federated learning.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Advances and open problems in federated learning
Peter Kairouz;H. Brendan McMahan;Brendan Avent;Aurélien Bellet.
Foundations and Trends® in Machine Learning (2021)
Advances and Open Problems in Federated Learning
Peter Kairouz;H. Brendan McMahan;Brendan Avent;Aurélien Bellet.
arXiv: Learning (2019)
Pinocchio: nearly practical verifiable computation
Bryan Parno;Jon Howell;Craig Gentry;Mariana Raykova.
Communications of The ACM (2016)
Quadratic Span Programs and Succinct NIZKs without PCPs
Rosario Gennaro;Craig Gentry;Bryan Parno;Mariana Raykova.
theory and application of cryptographic techniques (2013)
RapidChain: Scaling Blockchain via Full Sharding
Mahdi Zamani;Mahnush Movahedi;Mariana Raykova.
computer and communications security (2018)
How to delegate and verify in public: verifiable computation from attribute-based encryption
Bryan Parno;Mariana Raykova;Vinod Vaikuntanathan.
theory of cryptography conference (2012)
Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
Dan Boneh;Kevin Lewi;Mariana Raykova;Amit Sahai.
theory and application of cryptographic techniques (2015)
Efficient robust private set intersection
Dana Dachman-Soled;Tal Malkin;Mariana Raykova;Moti Yung.
International Journal of Applied Cryptography (2012)
Optimizing ORAM and Using It Efficiently for Secure Computation
Craig Gentry;Kenny A. Goldman;Shai Halevi;Charanjit Julta.
privacy enhancing technologies (2013)
Outsourcing Multi-Party Computation.
Seny Kamara;Payman Mohassel;Mariana Raykova.
IACR Cryptology ePrint Archive (2011)
If you think any of the details on this page are incorrect, let us know.
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:
Algorand Foundation
Columbia University
Algorand Foundation
Columbia University
Carnegie Mellon University
University of California, Los Angeles
Columbia University
Northeastern University
University of California, Berkeley
University of Virginia
Åbo Akademi University
University of Alberta
Fraunhofer Society
Spanish National Research Council
Izmir Institute of Technology
Iowa State University
Technical University of Munich
University of Oulu
University of Copenhagen
UCB Pharma (Belgium)
University of Exeter
University of Alberta
Tohoku University
Monash University
University of Leeds
University of British Columbia