default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlga Ohrimenko
Olya Ohrimenko
Person information
- affiliation: University of Melbourne, Australia
- affiliation (former): Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2014
[b1]Olga Ohrimenko:
Data-Oblivious Algorithms for Privacy-Preserving Access to Cloud Storage. Brown University, USA, 2014
Journal Articles
- 2023
- [j7]Benjamin Tag
, Niels van Berkel, Sunny Verma, Benjamin Zi Hao Zhao, Shlomo Berkovsky, Dali Kaafar, Vassilis Kostakos, Olga Ohrimenko:
DDoD: Dual Denial of Decision Attacks on Human-AI Teams. IEEE Pervasive Comput. 22(1): 77-84 (2023) - [j6]Dongge Han, Michael J. Wooldridge, Alex Rogers, Olga Ohrimenko, Sebastian Tschiatschek:
Replication Robust Payoff Allocation in Submodular Cooperative Games. IEEE Trans. Artif. Intell. 4(5): 1114-1128 (2023) - 2018
- [j5]Christian Cachin, Olga Ohrimenko:
Verifying the consistency of remote untrusted services with conflict-free operations. Inf. Comput. 260: 72-88 (2018) - 2016
- [j4]Esha Ghosh, Olga Ohrimenko, Roberto Tamassia:
Efficient Verifiable Range and Closest Point Queries in Zero-Knowledge. Proc. Priv. Enhancing Technol. 2016(4): 373-388 (2016) - 2012
- [j3]Claire Mathieu, Olga Ohrimenko:
Lower bounds for randomized algorithms for online chain partitioning. Inf. Process. Lett. 112(17-18): 663-666 (2012) - [j2]Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, Cristina Videira Lopes:
Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers. Proc. VLDB Endow. 5(10): 920-931 (2012) - 2009
- [j1]Olga Ohrimenko, Peter J. Stuckey, Michael Codish:
Propagation via lazy clause generation. Constraints An Int. J. 14(3): 357-391 (2009)
Conference and Workshop Papers
- 2024
- [c37]William L. Holland, Olga Ohrimenko, Anthony Wirth:
Single Round-trip Hierarchical ORAM via Succinct Indices. AsiaCCS 2024 - [c36]Pengbo Yan, Toby Murray, Olga Ohrimenko, Van-Thuan Pham, Robert Sison:
Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms. FM (1) 2024: 188-205 - 2023
- [c35]Michelle Chen, Olga Ohrimenko:
Protecting Global Properties of Datasets with Distribution Privacy Mechanisms. AISTATS 2023: 7472-7491 - [c34]Tian Hui, Farhad Farokhi, Olga Ohrimenko:
Information Leakage from Data Updates in Machine Learning Models. AISec@CCS 2023: 35-41 - [c33]Qiongkai Xu, Trevor Cohn, Olga Ohrimenko:
Fingerprint Attack: Client De-Anonymization in Federated Learning. ECAI 2023: 2792-2801 - [c32]Hao Wu, Olga Ohrimenko, Anthony Wirth:
Tight Data Access Bounds for Private Top-k Selection. ICML 2023: 37635-37655 - [c31]Zhuoqun Huang, Neil G. Marchant, Keane Lucas, Lujo Bauer, Olga Ohrimenko, Benjamin I. P. Rubinstein:
RS-Del: Edit Distance Robustness Certificates for Sequence Classifiers via Randomized Deletion. NeurIPS 2023 - 2022
- [c30]William L. Holland, Olga Ohrimenko, Anthony Wirth:
Efficient Oblivious Permutation via the Waksman Network. AsiaCCS 2022: 771-783 - [c29]Wanrong Zhang, Olga Ohrimenko, Rachel Cummings:
Attribute Privacy: Framework and Mechanisms. FAccT 2022: 757-766 - [c28]Olga Ohrimenko, Anthony Wirth, Hao Wu:
Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data. PODS 2022: 237-249 - [c27]Jiankai Jin, Eleanor McMurtry, Benjamin I. P. Rubinstein, Olga Ohrimenko:
Are We There Yet? Timing and Floating-Point Attacks on Differential Privacy Systems. SP 2022: 473-488 - 2021
- [c26]Wanrong Zhang, Shruti Tople, Olga Ohrimenko:
Leakage of Dataset Properties in Multi-Party Machine Learning. USENIX Security Symposium 2021: 2687-2704 - 2020
- [c25]Santiago Zanella Béguelin, Lukas Wutschitz, Shruti Tople, Victor Rühle, Andrew Paverd, Olga Ohrimenko, Boris Köpf, Marc Brockschmidt:
Analyzing Information Leakage of Updates to Natural Language Models. CCS 2020: 363-375 - 2019
- [c24]Borja Balle, Adrià Gascón, Olya Ohrimenko, Mariana Raykova, Phillipp Schoppmann, Carmela Troncoso:
PPML '19: Privacy Preserving Machine Learning. CCS 2019: 2717-2718 - [c23]Sajin Sasy, Olga Ohrimenko:
Oblivious Sampling Algorithms for Private Data Analysis. NeurIPS 2019: 6492-6503 - [c22]Joshua Allen, Bolin Ding, Janardhan Kulkarni, Harsha Nori, Olga Ohrimenko, Sergey Yekhanin:
An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors. NeurIPS 2019: 13635-13646 - 2018
- [c21]Seny Kamara, Tarik Moataz, Olga Ohrimenko:
Structured Encryption and Leakage Suppression. CRYPTO (1) 2018: 339-370 - [c20]Jamie Hayes, Olga Ohrimenko:
Contamination Attacks and Mitigation in Multi-Party Machine Learning. NeurIPS 2018: 6604-6616 - 2017
- [c19]Raphaël Bost, Brice Minaud, Olga Ohrimenko:
Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives. CCS 2017: 1465-1482 - [c18]Daniel Gruss, Julian Lettner, Felix Schuster, Olga Ohrimenko, István Haller, Manuel Costa:
Strong and Efficient Cache Side-Channel Protection using Hardware Transactional Memory. USENIX Security Symposium 2017: 217-233 - 2016
- [c17]Esha Ghosh, Olga Ohrimenko, Dimitrios Papadopoulos, Roberto Tamassia, Nikos Triandopoulos:
Zero-Knowledge Accumulators and Set Algebra. ASIACRYPT (2) 2016: 67-100 - [c16]Dario Fiore, Cédric Fournet, Esha Ghosh, Markulf Kohlweiss, Olga Ohrimenko, Bryan Parno:
Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data. CCS 2016: 1304-1316 - [c15]Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees. SCN 2016: 216-236 - [c14]Olga Ohrimenko, Felix Schuster, Cédric Fournet, Aastha Mehta, Sebastian Nowozin, Kapil Vaswani, Manuel Costa:
Oblivious Multi-Party Machine Learning on Trusted Processors. USENIX Security Symposium 2016: 619-636 - 2015
- [c13]Esha Ghosh, Olga Ohrimenko, Roberto Tamassia:
Zero-Knowledge Authenticated Order Queries and Order Statistics on a List. ACNS 2015: 149-171 - [c12]Olga Ohrimenko, Manuel Costa, Cédric Fournet, Christos Gkantsidis, Markulf Kohlweiss, Divya Sharma:
Observing and Preventing Leakage in MapReduce. CCS 2015: 1570-1581 - [c11]Foteini Baldimtsi, Olga Ohrimenko:
Sorting and Searching Behind the Curtain. Financial Cryptography 2015: 127-146 - 2014
- [c10]Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal:
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. ICALP (2) 2014: 556-567 - [c9]Christian Cachin, Olga Ohrimenko:
Verifying the Consistency of Remote Untrusted Services with Commutative Operations. OPODIS 2014: 1-16 - 2013
- [c8]Joshua W. S. Brown, Olga Ohrimenko, Roberto Tamassia:
Haze: privacy-preserving real-time traffic statistics. SIGSPATIAL/GIS 2013: 530-533 - 2012
- [c7]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Practical oblivious storage. CODASPY 2012: 13-24 - [c6]Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage. GD 2012: 43-54 - [c5]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Privacy-preserving group data access via stateless oblivious RAM simulation. SODA 2012: 157-167 - [c4]Olga Ohrimenko, Hobart Reynolds, Roberto Tamassia:
Authenticating Email Search Results. STM 2012: 225-240 - 2011
- [c3]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Oblivious RAM simulation with efficient worst-case access overhead. CCSW 2011: 95-100 - 2008
- [c2]Olga Ohrimenko, Peter J. Stuckey:
Modelling for Lazy Clause Generation. CATS 2008: 27-37 - 2007
- [c1]Olga Ohrimenko, Peter J. Stuckey, Michael Codish:
Propagation = Lazy Clause Generation. CP 2007: 544-558
Reference Works
- 2013
- [r1]Olga Ohrimenko, Charalampos Papamanthou, Bernardo Palazzi:
Computer Security. Handbook of Graph Drawing and Visualization 2013: 653-679
Informal and Other Publications
- 2024
- [i46]Jiankai Jin, Chitchanok Chuengsatiansup, Toby Murray, Benjamin I. P. Rubinstein, Yuval Yarom, Olga Ohrimenko:
Elephants Do Not Forget: Differential Privacy with State Continuity for Privacy Budget. CoRR abs/2401.17628 (2024) - [i45]Aref Miri Rekavandi, Olga Ohrimenko, Benjamin I. P. Rubinstein:
RS-Reg: Probabilistic and Robust Certified Regression Through Randomized Smoothing. CoRR abs/2405.08892 (2024) - [i44]Pengbo Yan, Toby Murray, Olga Ohrimenko, Van-Thuan Pham, Robert Sison:
Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms (Extended Version). CoRR abs/2407.00514 (2024) - [i43]Zhuoqun Huang, Neil G. Marchant, Olga Ohrimenko, Benjamin I. P. Rubinstein:
CERT-ED: Certifiably Robust Text Classification for Edit Distance. CoRR abs/2408.00728 (2024) - 2023
- [i42]David W. Archer, Borja de Balle Pigem, Dan Bogdanov, Mark Craddock, Adrià Gascón, Ronald Jansen, Matjaz Jug, Kim Laine, Robert McLellan, Olga Ohrimenko, Mariana Raykova, Andrew Trask, Simon Wardley:
UN Handbook on Privacy-Preserving Computation Techniques. CoRR abs/2301.06167 (2023) - [i41]Hao Wu, Olga Ohrimenko, Anthony Wirth:
Tight Data Access Bounds for Private Top-$k$ Selection. CoRR abs/2301.13347 (2023) - [i40]Zhuoqun Huang, Neil G. Marchant, Keane Lucas, Lujo Bauer, Olga Ohrimenko, Benjamin I. P. Rubinstein:
Certified Robustness of Learning-based Static Malware Detectors. CoRR abs/2302.01757 (2023) - [i39]Rachel Cummings, Damien Desfontaines, David Evans, Roxana Geambasu, Matthew Jagielski, Yangsibo Huang, Peter Kairouz, Gautam Kamath, Sewoong Oh, Olga Ohrimenko, Nicolas Papernot, Ryan Rogers, Milan Shen, Shuang Song, Weijie J. Su, Andreas Terzis, Abhradeep Thakurta, Sergei Vassilvitskii, Yu-Xiang Wang, Li Xiong, Sergey Yekhanin, Da Yu, Huanyu Zhang, Wanrong Zhang:
Challenges towards the Next Frontier in Privacy. CoRR abs/2304.06929 (2023) - [i38]Tian Hui, Farhad Farokhi, Olga Ohrimenko:
Information Leakage from Data Updates in Machine Learning Models. CoRR abs/2309.11022 (2023) - [i37]Qiongkai Xu, Trevor Cohn, Olga Ohrimenko:
Fingerprint Attack: Client De-Anonymization in Federated Learning. CoRR abs/2310.05960 (2023) - 2022
- [i36]Jiankai Jin, Olga Ohrimenko, Benjamin I. P. Rubinstein:
Getting a-Round Guarantees: Floating-Point Attacks on Certified Robustness. CoRR abs/2205.10159 (2022) - [i35]Hao Wu, Olga Ohrimenko, Anthony Wirth:
Walking to Hide: Privacy Amplification via Random Message Exchanges in Network. CoRR abs/2206.09519 (2022) - [i34]Michelle Chen, Olga Ohrimenko:
Protecting Global Properties of Datasets with Distribution Privacy Mechanisms. CoRR abs/2207.08367 (2022) - [i33]William L. Holland, Olga Ohrimenko, Anthony Wirth:
Single Round-trip Hierarchical ORAM via Succinct Indices. CoRR abs/2208.07489 (2022) - [i32]Thorsten Eisenhofer, Doreen Riepel, Varun Chandrasekaran, Esha Ghosh, Olga Ohrimenko, Nicolas Papernot:
Verifiable and Provably Secure Machine Unlearning. CoRR abs/2210.09126 (2022) - [i31]Benjamin Tag, Niels van Berkel, Sunny Verma, Benjamin Zi Hao Zhao, Shlomo Berkovsky, Dali Kaafar, Vassilis Kostakos, Olga Ohrimenko:
DDoD: Dual Denial of Decision Attacks on Human-AI Teams. CoRR abs/2212.03980 (2022) - 2021
- [i30]Jiankai Jin, Eleanor McMurtry, Benjamin I. P. Rubinstein, Olga Ohrimenko:
Are We There Yet? Timing and Floating-Point Attacks on Differential Privacy Systems. CoRR abs/2112.05307 (2021) - [i29]Olga Ohrimenko, Anthony Wirth, Hao Wu:
Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data. CoRR abs/2112.12279 (2021) - 2020
- [i28]Wanrong Zhang, Shruti Tople, Olga Ohrimenko:
Dataset-Level Attribute Leakage in Collaborative Learning. CoRR abs/2006.07267 (2020) - [i27]Dongge Han, Shruti Tople, Alex Rogers, Michael J. Wooldridge, Olga Ohrimenko, Sebastian Tschiatschek:
Replication-Robust Payoff-Allocation with Applications in Machine Learning Marketplaces. CoRR abs/2006.14583 (2020) - [i26]Wanrong Zhang, Olga Ohrimenko, Rachel Cummings:
Attribute Privacy: Framework and Mechanisms. CoRR abs/2009.04013 (2020) - [i25]Sajin Sasy, Olga Ohrimenko:
Oblivious Sampling Algorithms for Private Data Analysis. CoRR abs/2009.13689 (2020) - 2019
- [i24]Jamie Hayes, Olga Ohrimenko:
Contamination Attacks and Mitigation in Multi-Party Machine Learning. CoRR abs/1901.02402 (2019) - [i23]Sacha Servan-Schreiber, Olga Ohrimenko, Tim Kraska, Emanuel Zgraggen:
Custodes: Auditable Hypothesis Testing. CoRR abs/1901.10875 (2019) - [i22]Olga Ohrimenko, Shruti Tople, Sebastian Tschiatschek:
Collaborative Machine Learning Markets with Data-Replication-Robust Payments. CoRR abs/1911.09052 (2019) - [i21]Shruti Tople, Marc Brockschmidt, Boris Köpf, Olga Ohrimenko, Santiago Zanella Béguelin:
Analyzing Privacy Loss in Updates of Natural Language Models. CoRR abs/1912.07942 (2019) - 2018
- [i20]Joshua Allen, Bolin Ding, Janardhan Kulkarni, Harsha Nori, Olga Ohrimenko, Sergey Yekhanin:
An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors. CoRR abs/1807.00736 (2018) - [i19]Seny Kamara, Tarik Moataz, Olga Ohrimenko:
Structured Encryption and Leakage Suppression. IACR Cryptol. ePrint Arch. 2018: 551 (2018) - 2017
- [i18]Manuel Costa, Lawrence Esswood, Olga Ohrimenko, Felix Schuster, Sameer Wagh:
The Pyramid Scheme: Oblivious RAM for Trusted Processors. CoRR abs/1712.07882 (2017) - [i17]Raphael Bost, Brice Minaud, Olga Ohrimenko:
Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives. IACR Cryptol. ePrint Arch. 2017: 805 (2017) - 2016
- [i16]Dario Fiore, Cédric Fournet, Esha Ghosh, Markulf Kohlweiss, Olga Ohrimenko, Bryan Parno:
Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data. IACR Cryptol. ePrint Arch. 2016: 985 (2016) - 2015
- [i15]Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data. IACR Cryptol. ePrint Arch. 2015: 283 (2015) - [i14]Esha Ghosh, Olga Ohrimenko, Dimitrios Papadopoulos, Roberto Tamassia, Nikos Triandopoulos:
Zero-Knowledge Accumulators and Set Operations. IACR Cryptol. ePrint Arch. 2015: 404 (2015) - [i13]Esha Ghosh, Olga Ohrimenko, Roberto Tamassia:
Authenticated Range \& Closest Point Queries in Zero-Knowledge. IACR Cryptol. ePrint Arch. 2015: 1183 (2015) - 2014
- [i12]Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal:
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. CoRR abs/1402.5524 (2014) - [i11]Esha Ghosh, Olga Ohrimenko, Roberto Tamassia:
Verifiable Member and Order Queries on a List in Zero-Knowledge. CoRR abs/1408.3843 (2014) - [i10]Esha Ghosh, Olga Ohrimenko, Roberto Tamassia:
Verifiable Member and Order Queries on a List in Zero-Knowledge. IACR Cryptol. ePrint Arch. 2014: 632 (2014) - [i9]Foteini Baldimtsi, Olga Ohrimenko:
Sorting and Searching Behind the Curtain: Private Outsourced Sort and Frequency-Based Ranking of Search Results Over Encrypted Data. IACR Cryptol. ePrint Arch. 2014: 1017 (2014) - 2013
- [i8]Christian Cachin, Olga Ohrimenko:
On Verifying the Consistency of Remote Untrusted Services. CoRR abs/1302.4808 (2013) - [i7]Joshua W. S. Brown, Olga Ohrimenko, Roberto Tamassia:
Haze: Privacy-Preserving Real-Time Traffic Statistics. CoRR abs/1309.3515 (2013) - 2012
- [i6]Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, Cristina Videira Lopes:
Verifying Search Results Over Web Collections. CoRR abs/1204.5446 (2012) - [i5]Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Data-Oblivious Graph Drawing Model and Algorithms. CoRR abs/1209.0756 (2012) - 2011
- [i4]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation. CoRR abs/1105.4125 (2011) - [i3]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Oblivious RAM Simulation with Efficient Worst-Case Access Overhead. CoRR abs/1107.5093 (2011) - [i2]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Oblivious Storage with Low I/O Overhead. CoRR abs/1110.1851 (2011) - 2007
- [i1]Aaron Harwood, Olga Ohrimenko:
Mean Field Models of Message Throughput in Dynamic Peer-to-Peer Systems. CoRR abs/0705.2065 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
