Mariana Raykova

Affiliations:
  • Google
  • Yale University (former)
  • Columbia University (former)


According to our database1, Mariana Raykova authored at least 79 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Privacy-Preserving Regular Expression Matching using Nondeterministic Finite Automata.
IACR Cryptol. ePrint Arch., 2023

Hintless Single-Server Private Information Retrieval.
IACR Cryptol. ePrint Arch., 2023

Anonymous Counting Tokens.
IACR Cryptol. ePrint Arch., 2023

UN Handbook on Privacy-Preserving Computation Techniques.
CoRR, 2023

2022
On the (in)Security of ROS.
J. Cryptol., 2022

Publicly verifiable anonymous tokens with private metadata bit.
IACR Cryptol. ePrint Arch., 2022

ACORN: Input Validation for Secure Aggregation.
IACR Cryptol. ePrint Arch., 2022

Communication Efficient Secure Logistic Regression.
IACR Cryptol. ePrint Arch., 2022

Distributed, Private, Sparse Histograms in the Two-Server Model.
IACR Cryptol. ePrint Arch., 2022

Locked Circuit Indistinguishability: A Notion of Security for Logic Locking.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

2021
Secure Poisson Regression.
IACR Cryptol. ePrint Arch., 2021

Advances and Open Problems in Federated Learning.
Found. Trends Mach. Learn., 2021

2020
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality.
IACR Cryptol. ePrint Arch., 2020

Private Join and Compute from PIR with Default.
IACR Cryptol. ePrint Arch., 2020

Anonymous Tokens with Private Metadata Bit.
IACR Cryptol. ePrint Arch., 2020

On the (in)security of ROS.
IACR Cryptol. ePrint Arch., 2020

Secure Single-Server Aggregation with (Poly)Logarithmic Overhead.
IACR Cryptol. ePrint Arch., 2020

Think Global, Act Local: Gossip and Client Audits in Verifiable Data Structures.
CoRR, 2020

On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality.
Proceedings of the IEEE European Symposium on Security and Privacy, 2020

2019
Distributed Vector-OLE: Improved Constructions and Implementation.
IACR Cryptol. ePrint Arch., 2019

Make Some ROOM for the Zeros: Data Sparsity in Secure Distributed Machine Learning.
IACR Cryptol. ePrint Arch., 2019

Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation.
IACR Cryptol. ePrint Arch., 2019

On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications.
IACR Cryptol. ePrint Arch., 2019

In Pursuit of Clarity In Obfuscation.
IACR Cryptol. ePrint Arch., 2019

Public-Key Function-Private Hidden Vector Encryption (and More).
IACR Cryptol. ePrint Arch., 2019

Communication-Computation Trade-offs in PIR.
IACR Cryptol. ePrint Arch., 2019

Advances and Open Problems in Federated Learning.
CoRR, 2019

Secure Computation for Machine Learning With SPDZ.
CoRR, 2019

PPML '19: Privacy Preserving Machine Learning.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
RapidChain: A Fast Blockchain Protocol via Full Sharding.
IACR Cryptol. ePrint Arch., 2018

PanORAMa: Oblivious RAM with Logarithmic Overhead.
IACR Cryptol. ePrint Arch., 2018

A Simple Obfuscation Scheme for Pattern-Matching with Wildcards.
IACR Cryptol. ePrint Arch., 2018

RapidChain: Scaling Blockchain via Full Sharding.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Privacy-Preserving Distributed Linear Regression on High-Dimensional Data.
Proc. Priv. Enhancing Technol., 2017

5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2017

Multi-input Inner-Product Functional Encryption from Pairings.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Low-Leakage Secure Search for Boolean Expressions.
Proceedings of the Topics in Cryptology - CT-RSA 2017, 2017

Optimal-Rate Non-Committing Encryption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs.
IACR Cryptol. ePrint Arch., 2016

Secure Linear Regression on Vertically Partitioned Datasets.
IACR Cryptol. ePrint Arch., 2016

Optimal-Rate Non-Committing Encryption in a CRS Model.
IACR Cryptol. ePrint Arch., 2016

Multi-Input Inner-Product Functional Encryption from Pairings.
IACR Cryptol. ePrint Arch., 2016

Pinocchio: nearly practical verifiable computation.
Commun. ACM, 2016

Hiding secrets in software: a cryptographic approach to program obfuscation.
Commun. ACM, 2016

Adaptive Succinct Garbled RAM or: How to Delegate Your Database.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

2015
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and Their Limitations.
IACR Cryptol. ePrint Arch., 2015

Succinct Adaptive Garbled RAM.
IACR Cryptol. ePrint Arch., 2015

Decentralized Authorization and Privacy-Enhanced Routing for Information-Centric Networks.
Proceedings of the 31st Annual Computer Security Applications Conference, 2015

2014
Private Database Access With HE-over-ORAM Architecture.
IACR Cryptol. ePrint Arch., 2014

Outsourcing Private RAM Computation.
IACR Cryptol. ePrint Arch., 2014

Garbled RAM Revisited, Part I.
IACR Cryptol. ePrint Arch., 2014

Semantically Secure Order-Revealing Encryption: Multi-Input Functional Encryption Without Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Co-Location-Resistant Clouds.
IACR Cryptol. ePrint Arch., 2014

Scaling Private Set Intersection to Billion-Element Sets.
Proceedings of the Financial Cryptography and Data Security, 2014

Garbled RAM Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Optimizing ORAM and Using it Efficiently for Secure Computation.
IACR Cryptol. ePrint Arch., 2013

Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits.
IACR Cryptol. ePrint Arch., 2013

Two-round secure MPC from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2013

Shroud: ensuring private access to large-scale data in the data center.
Proceedings of the 11th USENIX conference on File and Storage Technologies, 2013

Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Secure Computation in Heterogeneous Environments: How to Bring Multiparty Computation Closer to Practice?
PhD thesis, 2012

Efficient robust private set intersection.
Int. J. Appl. Cryptogr., 2012

Usable, Secure, Private Search.
IEEE Secur. Priv., 2012

Toward Practical Private Access to Data Centers via Parallel ORAM.
IACR Cryptol. ePrint Arch., 2012

Quadratic Span Programs and Succinct NIZKs without PCPs.
IACR Cryptol. ePrint Arch., 2012

Privacy Enhanced Access Control for Outsourced Data Sharing.
Proceedings of the Financial Cryptography and Data Security, 2012

Secure two-party computation in sublinear (amortized) time.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption.
IACR Cryptol. ePrint Arch., 2011

Parallel Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2011

Outsourcing Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2011

Secure Computation with Sublinear Amortized Work.
IACR Cryptol. ePrint Arch., 2011

Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability.
IACR Cryptol. ePrint Arch., 2011

Private search in the real world.
Proceedings of the Twenty-Seventh Annual Computer Security Applications Conference, 2011

Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications.
Proceedings of the Applied Cryptography and Network Security, 2011

2009
The Zodiac Policy Subsystem: A Policy-Based Management System for a High-Security MANET.
Proceedings of the POLICY 2009, 2009

Secure anonymous database search.
Proceedings of the first ACM Cloud Computing Security Workshop, 2009

2008
PAR: Payment for Anonymous Routing.
Proceedings of the Privacy Enhancing Technologies, 2008

2006
Permutation Reconstruction from Minors.
Electron. J. Comb., 2006


  Loading...