default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam O'Neill
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c35]Dana Dachman-Soled, Julian Loss, Adam O'Neill:
Breaking RSA Generically Is Equivalent to Factoring, with Preprocessing. ITC 2024: 8:1-8:24- [i33]Gavin Cho, Georg Fuchsbauer, Adam O'Neill:
Schnorr Signatures are Tightly Secure in the ROM under a Non-interactive Assumption. IACR Cryptol. ePrint Arch. 2024: 1528 (2024) - 2023
- [c34]Suvradip Chakraborty, Harish Karthikeyan, Adam O'Neill, C. Pandu Rangan:
Forward Security Under Leakage Resilience, Revisited. CANS 2023: 3-27 - 2022
- [c33]Alice Murphy, Adam O'Neill, Mohammad Zaheri:
Instantiability of Classical Random-Oracle-Model Encryption Transforms. ASIACRYPT (4) 2022: 323-352 - [c32]Georg Fuchsbauer, Riddhi Ghosal, Nathan Hauke, Adam O'Neill:
Approximate Distance-Comparison-Preserving Symmetric Encryption. SCN 2022: 117-144 - [c31]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Adam O'Neill:
Beyond Uber: Instantiating Generic Groups via PGGs. TCC (3) 2022: 212-242 - [i32]Dana Dachman-Soled, Julian Loss, Adam O'Neill, Nikki Sigurdson:
Breaking RSA Generically is Equivalent to Factoring, with Preprocessing. IACR Cryptol. ePrint Arch. 2022: 1261 (2022) - [i31]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Adam O'Neill:
Beyond Uber: Instantiating Generic Groups via PGGs. IACR Cryptol. ePrint Arch. 2022: 1502 (2022) - [i30]Alice Murphy, Adam O'Neill, Mohammad Zaheri:
Instantiability of Classical Random-Oracle-Model Encryption Transforms. IACR Cryptol. ePrint Arch. 2022: 1584 (2022) - 2021
- [c30]Dmytro Bogatov, Georgios Kellaris, George Kollios
, Kobbi Nissim, Adam O'Neill:
εpsolute: Efficiently Querying Databases While Providing Differential Privacy. CCS 2021: 2262-2276 - [c29]Adam O'Neill, Mohammad Zaheri:
On Selective-Opening Security of Deterministic Primitives. Public Key Cryptography (2) 2021: 147-172 - [i29]Georg Fuchsbauer, Riddhi Ghosal, Nathan Hauke, Adam O'Neill:
Approximate Distance-Comparison-Preserving Symmetric Encryption. IACR Cryptol. ePrint Arch. 2021: 1666 (2021) - 2020
- [c28]Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, Justin Thaler:
Ad Hoc Multi-Input Functional Encryption. ITCS 2020: 40:1-40:41 - [c27]Nairen Cao, Adam O'Neill, Mohammad Zaheri:
Toward RSA-OAEP Without Random Oracles. Public Key Cryptography (1) 2020: 279-308 - [i28]Mohammad Zaheri, Adam O'Neill:
On Selective-Opening Security of Deterministic Primitives. IACR Cryptol. ePrint Arch. 2020: 174 (2020) - [i27]Suvradip Chakraborty, Harish Karthikeyan, Adam O'Neill, C. Pandu Rangan:
Forward-Security Under Continual Leakage with Deterministic Key Updates. IACR Cryptol. ePrint Arch. 2020: 736 (2020)
2010 – 2019
- 2019
- [j6]Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage Resilience from Program Obfuscation. J. Cryptol. 32(3): 742-824 (2019) - [i26]Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, Justin Thaler:
Ad Hoc Multi-Input Functional Encryption. IACR Cryptol. ePrint Arch. 2019: 356 (2019) - 2018
- [j5]Angelo De Caro, Vincenzo Iovino, Adam O'Neill:
Receiver- and sender-deniable functional encryption. IET Inf. Secur. 12(3): 207-216 (2018) - [c26]David Cash, Feng-Hao Liu, Adam O'Neill, Mark Zhandry, Cong Zhang:
Parameter-Hiding Order Revealing Encryption. ASIACRYPT (1) 2018: 181-210 - [c25]Craig Gentry, Adam O'Neill, Leonid Reyzin:
A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures. Public Key Cryptography (2) 2018: 34-57 - [i25]Craig Gentry, Adam O'Neill, Leonid Reyzin:
A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures. IACR Cryptol. ePrint Arch. 2018: 70 (2018) - [i24]David Cash, Feng-Hao Liu, Adam O'Neill, Mark Zhandry, Cong Zhang:
Parameter-Hiding Order Revealing Encryption. IACR Cryptol. ePrint Arch. 2018: 698 (2018) - [i23]Nairen Cao, Adam O'Neill, Mohammad Zaheri:
Towards RSA-OAEP without Random Oracles. IACR Cryptol. ePrint Arch. 2018: 1170 (2018) - 2017
- [j4]Eike Kiltz, Adam O'Neill, Adam D. Smith:
Instantiability of RSA-OAEP Under Chosen-Plaintext Attack. J. Cryptol. 30(3): 889-919 (2017) - [j3]Yuankai Zhang, Adam O'Neill, Micah Sherr, Wenchao Zhou:
Privacy-preserving Network Provenance. Proc. VLDB Endow. 10(11): 1550-1561 (2017) - [c24]Mihir Bellare, Adam O'Neill, Igors Stepanovs:
Forward-Security Under Continual Leakage. CANS 2017: 3-26 - [i22]Georgios Kellaris, George Kollios, Kobbi Nissim, Adam O'Neill:
Accessing Data while Preserving Privacy. CoRR abs/1706.01552 (2017) - [i21]Mihir Bellare, Adam O'Neill, Igors Stepanovs:
Forward-Security under Continual Leakage. IACR Cryptol. ePrint Arch. 2017: 476 (2017) - 2016
- [c23]Viet Tung Hoang, Jonathan Katz, Adam O'Neill, Mohammad Zaheri:
Selective-Opening Security in the Presence of Randomness Failures. ASIACRYPT (2) 2016: 278-306 - [c22]Vipul Goyal, Aayush Jain, Adam O'Neill:
Multi-input Functional Encryption with Unbounded-Message Security. ASIACRYPT (2) 2016: 531-556 - [c21]Georgios Kellaris, George Kollios, Kobbi Nissim, Adam O'Neill:
Generic Attacks on Secure Outsourced Databases. CCS 2016: 1329-1340 - [c20]Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage-Resilient Public-Key Encryption from Obfuscation. Public Key Cryptography (2) 2016: 101-128 - [c19]Angelo De Caro, Vincenzo Iovino, Adam O'Neill:
Deniable Functional Encryption. Public Key Cryptography (1) 2016: 196-222 - [i20]David Cash, Feng-Hao Liu, Adam O'Neill, Cong Zhang:
Reducing the Leakage in Practical Order-Revealing Encryption. IACR Cryptol. ePrint Arch. 2016: 661 (2016) - [i19]Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage-Resilient Public-Key Encryption from Obfuscation. IACR Cryptol. ePrint Arch. 2016: 730 (2016) - [i18]Viet Tung Hoang, Jonathan Katz, Adam O'Neill, Mohammad Zaheri:
Selective-Opening Security in the Presence of Randomness Failures. IACR Cryptol. ePrint Arch. 2016: 868 (2016) - 2015
- [j2]Benjamin Fuller, Adam O'Neill, Leonid Reyzin:
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy. J. Cryptol. 28(3): 671-717 (2015) - [c18]Charalampos Mavroforakis, Nathan Chenette, Adam O'Neill, George Kollios, Ran Canetti:
Modular Order-Preserving Encryption, Revisited. SIGMOD Conference 2015: 763-777 - [i17]Vipul Goyal, Aayush Jain, Adam O'Neill:
Multi-Input Functional Encryption with Unbounded-Message Security. IACR Cryptol. ePrint Arch. 2015: 1113 (2015) - [i16]Angelo De Caro, Vincenzo Iovino, Adam O'Neill:
Deniable Functional Encryption. IACR Cryptol. ePrint Arch. 2015: 1205 (2015) - 2014
- [c17]Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill:
Enhanced Chosen-Ciphertext Security and Applications. Public Key Cryptography 2014: 329-344 - 2013
- [c16]Mihir Bellare, Adam O'Neill:
Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition. CANS 2013: 218-234 - [c15]Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O'Neill, Omer Paneth, Giuseppe Persiano:
On the Achievability of Simulation-Based Security for Functional Encryption. CRYPTO (2) 2013: 519-535 - [c14]Mark Lewko, Adam O'Neill, Adam D. Smith:
Regularity of Lossy RSA on Subdomains and Its Applications. EUROCRYPT 2013: 55-75 - [i15]Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O'Neill, Omer Paneth, Giuseppe Persiano:
On the Achievability of Simulation-Based Security for Functional Encryption. IACR Cryptol. ePrint Arch. 2013: 364 (2013) - 2012
- [c13]Michael Gerbush, Allison B. Lewko, Adam O'Neill, Brent Waters:
Dual Form Signatures: An Approach for Proving Security from Static Assumptions. ASIACRYPT 2012: 25-42 - [c12]Benjamin Fuller, Adam O'Neill, Leonid Reyzin:
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy. TCC 2012: 582-599 - [i14]Benjamin Fuller, Adam O'Neill, Leonid Reyzin:
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy. IACR Cryptol. ePrint Arch. 2012: 5 (2012) - [i13]Michael Gerbush, Allison B. Lewko, Adam O'Neill, Brent Waters:
Dual Form Signatures: An Approach for Proving Security from Static Assumptions. IACR Cryptol. ePrint Arch. 2012: 261 (2012) - [i12]Mihir Bellare, Adam O'Neill:
Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition. IACR Cryptol. ePrint Arch. 2012: 515 (2012) - [i11]Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill:
Enhanced Chosen-Ciphertext Security and Applications. IACR Cryptol. ePrint Arch. 2012: 543 (2012) - [i10]Alexandra Boldyreva, Nathan Chenette, Younho Lee, Adam O'Neill:
Order-Preserving Symmetric Encryption. IACR Cryptol. ePrint Arch. 2012: 624 (2012) - [i9]Alexandra Boldyreva, Nathan Chenette, Adam O'Neill:
Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions. IACR Cryptol. ePrint Arch. 2012: 625 (2012) - 2011
- [c11]Adam O'Neill, Chris Peikert, Brent Waters:
Bi-Deniable Public-Key Encryption. CRYPTO 2011: 525-542 - [c10]Alexandra Boldyreva, Nathan Chenette, Adam O'Neill:
Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions. CRYPTO 2011: 578-595 - [c9]Vipul Goyal, Adam O'Neill, Vanishree Rao:
Correlated-Input Secure Hash Functions. TCC 2011: 182-200 - [i8]Vipul Goyal, Adam O'Neill, Vanishree Rao:
Correlated-Input Secure Hash Functions. IACR Cryptol. ePrint Arch. 2011: 233 (2011) - [i7]Adam O'Neill, Chris Peikert, Brent Waters:
Bi-Deniable Public-Key Encryption. IACR Cryptol. ePrint Arch. 2011: 352 (2011) - [i6]Eike Kiltz, Adam O'Neill, Adam D. Smith:
Instantiability of RSA-OAEP under Chosen-Plaintext Attack. IACR Cryptol. ePrint Arch. 2011: 559 (2011) - 2010
- [b1]Adam O'Neill:
Stronger security notions for trapdoor functions and applications. Georgia Institute of Technology, Atlanta, GA, USA, 2010 - [c8]Eike Kiltz, Adam O'Neill, Adam D. Smith:
Instantiability of RSA-OAEP under Chosen-Plaintext Attack. CRYPTO 2010: 295-313 - [c7]Eike Kiltz, Payman Mohassel, Adam O'Neill:
Adaptive Trapdoor Functions and Chosen-Ciphertext Security. EUROCRYPT 2010: 673-692 - [i5]Adam O'Neill:
Definitional Issues in Functional Encryption. IACR Cryptol. ePrint Arch. 2010: 556 (2010)
2000 – 2009
- 2009
- [c6]Alexandra Boldyreva, Nathan Chenette, Younho Lee, Adam O'Neill:
Order-Preserving Symmetric Encryption. EUROCRYPT 2009: 224-241 - 2008
- [j1]Alexandra Boldyreva, Craig Gentry, Adam O'Neill, Dae Hyun Yum:
New Multiparty Signature Schemes for Network Routing Applications. ACM Trans. Inf. Syst. Secur. 12(1): 3:1-3:39 (2008) - [c5]Alexandra Boldyreva, Serge Fehr, Adam O'Neill:
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles. CRYPTO 2008: 335-359 - [c4]Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas Ristenpart:
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. CRYPTO 2008: 360-378 - [i4]Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas Ristenpart:
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. IACR Cryptol. ePrint Arch. 2008: 267 (2008) - [i3]Alexandra Boldyreva, Serge Fehr, Adam O'Neill:
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles. IACR Cryptol. ePrint Arch. 2008: 352 (2008) - 2007
- [c3]Alexandra Boldyreva, Craig Gentry, Adam O'Neill, Dae Hyun Yum:
Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. CCS 2007: 276-285 - [c2]Mihir Bellare, Alexandra Boldyreva, Adam O'Neill:
Deterministic and Efficiently Searchable Encryption. CRYPTO 2007: 535-552 - [c1]Georgios Amanatidis, Alexandra Boldyreva, Adam O'Neill:
Provably-Secure Schemes for Basic Query Support in Outsourced Databases. DBSec 2007: 14-30 - [i2]Alexandra Boldyreva, Craig Gentry, Adam O'Neill, Dae Hyun Yum:
Ordered Multisignatures and Identity-Based Sequential Aggregate Signatures, with Applications to Secure Routing. IACR Cryptol. ePrint Arch. 2007: 438 (2007) - 2006
- [i1]Mihir Bellare, Alexandra Boldyreva, Adam O'Neill:
Deterministic and Efficiently Searchable Encryption. IACR Cryptol. ePrint Arch. 2006: 186 (2006)
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 02:25 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:
