Olga Ohrimenko

Orcid: 0000-0002-9735-0538

Affiliations:
  • University of Melbourne, Australia
  • Microsoft Research (former)


According to our database1, Olga Ohrimenko authored at least 68 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Elephants Do Not Forget: Differential Privacy with State Continuity for Privacy Budget.
CoRR, 2024

2023
Replication Robust Payoff Allocation in Submodular Cooperative Games.
IEEE Trans. Artif. Intell., October, 2023

DDoD: Dual Denial of Decision Attacks on Human-AI Teams.
IEEE Pervasive Comput., 2023

Challenges towards the Next Frontier in Privacy.
CoRR, 2023

Certified Robustness of Learning-based Static Malware Detectors.
CoRR, 2023

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

RS-Del: Edit Distance Robustness Certificates for Sequence Classifiers via Randomized Deletion.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Tight Data Access Bounds for Private Top-k Selection.
Proceedings of the International Conference on Machine Learning, 2023

Fingerprint Attack: Client De-Anonymization in Federated Learning.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Information Leakage from Data Updates in Machine Learning Models.
Proceedings of the 16th ACM Workshop on Artificial Intelligence and Security, 2023

Protecting Global Properties of Datasets with Distribution Privacy Mechanisms.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Verifiable and Provably Secure Machine Unlearning.
CoRR, 2022

Single Round-trip Hierarchical ORAM via Succinct Indices.
CoRR, 2022

Walking to Hide: Privacy Amplification via Random Message Exchanges in Network.
CoRR, 2022

Getting a-Round Guarantees: Floating-Point Attacks on Certified Robustness.
CoRR, 2022

Are We There Yet? Timing and Floating-Point Attacks on Differential Privacy Systems.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Attribute Privacy: Framework and Mechanisms.
Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022

Efficient Oblivious Permutation via the Waksman Network.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Leakage of Dataset Properties in Multi-Party Machine Learning.
Proceedings of the 30th USENIX Security Symposium, 2021

2020
Replication-Robust Payoff-Allocation with Applications in Machine Learning Marketplaces.
CoRR, 2020

Dataset-Level Attribute Leakage in Collaborative Learning.
CoRR, 2020

Analyzing Information Leakage of Updates to Natural Language Models.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Analyzing Privacy Loss in Updates of Natural Language Models.
CoRR, 2019

Collaborative Machine Learning Markets with Data-Replication-Robust Payments.
CoRR, 2019

Custodes: Auditable Hypothesis Testing.
CoRR, 2019

Oblivious Sampling Algorithms for Private Data Analysis.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

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

2018
Verifying the consistency of remote untrusted services with conflict-free operations.
Inf. Comput., 2018

Structured Encryption and Leakage Suppression.
IACR Cryptol. ePrint Arch., 2018

Contamination Attacks and Mitigation in Multi-Party Machine Learning.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives.
IACR Cryptol. ePrint Arch., 2017

The Pyramid Scheme: Oblivious RAM for Trusted Processors.
CoRR, 2017

Strong and Efficient Cache Side-Channel Protection using Hardware Transactional Memory.
Proceedings of the 26th USENIX Security Symposium, 2017

2016
Efficient Verifiable Range and Closest Point Queries in Zero-Knowledge.
Proc. Priv. Enhancing Technol., 2016

Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data.
IACR Cryptol. ePrint Arch., 2016

Oblivious Multi-Party Machine Learning on Trusted Processors.
Proceedings of the 25th USENIX Security Symposium, 2016

Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Zero-Knowledge Accumulators and Set Algebra.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Authenticated Range \& Closest Point Queries in Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2015

Zero-Knowledge Accumulators and Set Operations.
IACR Cryptol. ePrint Arch., 2015

Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data.
IACR Cryptol. ePrint Arch., 2015

Sorting and Searching Behind the Curtain.
Proceedings of the Financial Cryptography and Data Security, 2015

Observing and Preventing Leakage in MapReduce.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Zero-Knowledge Authenticated Order Queries and Order Statistics on a List.
Proceedings of the Applied Cryptography and Network Security, 2015

2014
Data-Oblivious Algorithms for Privacy-Preserving Access to Cloud Storage.
PhD thesis, 2014

Verifiable Member and Order Queries on a List in Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2014

Sorting and Searching Behind the Curtain: Private Outsourced Sort and Frequency-Based Ranking of Search Results Over Encrypted Data.
IACR Cryptol. ePrint Arch., 2014

Verifying the Consistency of Remote Untrusted Services with Commutative Operations.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Computer Security.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

On Verifying the Consistency of Remote Untrusted Services
CoRR, 2013

Haze: privacy-preserving real-time traffic statistics.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012
Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers.
Proc. VLDB Endow., 2012

Lower bounds for randomized algorithms for online chain partitioning.
Inf. Process. Lett., 2012

Data-Oblivious Graph Drawing Model and Algorithms
CoRR, 2012

Verifying Search Results Over Web Collections
CoRR, 2012

Authenticating Email Search Results.
Proceedings of the Security and Trust Management - 8th International Workshop, 2012

Privacy-preserving group data access via stateless oblivious RAM simulation.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Practical oblivious storage.
Proceedings of the Second ACM Conference on Data and Application Security and Privacy, 2012

2011
Oblivious Storage with Low I/O Overhead
CoRR, 2011

Oblivious RAM simulation with efficient worst-case access overhead.
Proceedings of the 3rd ACM Cloud Computing Security Workshop, 2011

2009
Propagation via lazy clause generation.
Constraints An Int. J., 2009

2008
Modelling for Lazy Clause Generation.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007
Mean Field Models of Message Throughput in Dynamic Peer-to-Peer Systems
CoRR, 2007

Propagation = Lazy Clause Generation.
Proceedings of the Principles and Practice of Constraint Programming, 2007


  Loading...