{"id":7,"date":"2019-07-02T18:20:11","date_gmt":"2019-07-02T18:20:11","guid":{"rendered":"https:\/\/groups.cs.umass.edu\/oneill\/?page_id=7"},"modified":"2025-09-23T21:03:36","modified_gmt":"2025-09-23T21:03:36","slug":"publications","status":"publish","type":"page","link":"https:\/\/groups.cs.umass.edu\/oneill\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<h3>Conference Papers<\/h3>\n<nav class=\"publ\"><\/nav>\n<p>O. Acharya, W. Feng, R. Langrehr, A. O&#8217;Neill<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2024\/1857\">Access-Controlled Inner Product Function-Revealing Encryption<\/a><br \/>\nCIC 2025<\/p>\n<p>O. Acharya, S. Biswas, W. Feng, A. O&#8217;Neill, A. Yerukhimovich<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2025\/420\">Non-interactive Verifiable Aggregation<\/a><br \/>\nPETS 2025<\/p>\n<p>G. Cho, G. Fuchsbauer, A. O&#8217;Neill, M. Sefranek<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2024\/1528\">Schnorr Signatures are Tightly Secure in the ROM under a Non-Interactive Assumption<\/a><br \/>\nCRYPTO 2025<\/p>\n<p>M. Hajiabadi, A. O&#8217;Neill, R. Langrehr, M. Wang<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2024\/1877\">On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption<\/a><br \/>\nTCC 2024<\/p>\n<p>D. Dachman-Soled, J. Loss, A. O&#8217;Neill<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2022\/1261\">Breaking RSA is Generically Equivalent to Factoring, with Preprocessing<\/a><br \/>\nITC 2024<\/p>\n<p>S. <span class=\"this-person\">Chakraborty<\/span>, H. Karthikeyan, A. O&#8217;Neill, C. Pandu Rangan<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2020\/736\">Forward Security Under Leakage Resilience, Revisited<\/a><br \/>\nCANS 2023<\/p>\n<p>B. Bauer, P. Farshim, P. Harasser, A. O&#8217;Neill<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2022\/1502\">Beyond Uber: Instantiating Generic Groups via PGGs<\/a><br \/>\nTCC 2022<\/p>\n<p>A. Murphy, A. O&#8217;Neill, M. Zaheri<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2022\/1584\">Instantiability of Classical Random-Oracle-Model Encryption Transforms<\/a><br \/>\nASIACRYPT 2022<\/p>\n<p>G. Fuchsbauer, R. Ghosal, N. Hauke, A. O&#8217;Neill<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2021\/1666.pdf\">Approximate-Distance-Preserving Symmetric Encryption<\/a><br \/>\nSCN 2022<\/p>\n<p>D. Bogatov, G. Kellaris, G. Kollios. K.Nissim, A. O&#8217;Neill<br \/>\n<a href=\"https:\/\/arxiv.org\/pdf\/1706.01552.pdf\">\u03b5psolute: Efficiently Querying Databases While Providing Differential Privacy<\/a><br \/>\nCCS 2021<\/p>\n<p>A. O&#8217;Neill, M. Zaheri<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2020\/174\">On Selective-Opening Security of Deterministic Primitives<\/a><br \/>\nPKC 2021<\/p>\n<p>S. Agrawal, M. Clear, O. Frieder, S. Garg, A. O&#8217;Neill, J. Thaler<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2019\/356\">Ad hoc Multi-Input Functional Encryption<\/a><br \/>\nITCS 2020<\/p>\n<p>N. Cao, A. O&#8217;Neill, M. Zaheri<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2018\/1170\">Toward RSA-OAEP without Random Oracles<\/a><br \/>\nPKC 2020<\/p>\n<p>D. Cash, F.H. Liu, A. O&#8217;Neill, M. Zhandry, C. Zhang<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2018\/698\"> Parameter-Hiding Order Revealing Encryption<\/a><br \/>\nASIACRYPT 2018<\/p>\n<p>C. Gentry, A. O&#8217;Neill, L. Reyzin<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2018\/070\"> A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures<\/a><br \/>\nPKC 2018<\/p>\n<p>M. Bellare, A. O&#8217;Neill, I. Stepanovs<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2017\/476\"> Forward-Security under Continual Leakage<\/a><br \/>\nCANS 2017<\/p>\n<p>Y. Zhang, A. O&#8217;Neill, M. Sherr, W. Zhou<br \/>\n<a href=\"http:\/\/people.cs.georgetown.edu\/~adam\/ppnp.pdf\">Privacy-Preserving Network Provenance<\/a><br \/>\nPVLDB 2017<\/p>\n<p>V.T. Hoang, J. Katz, A. O&#8217;Neill, M. Zaheri<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2016\/868\">Selective-Opening Security in the Presence of Randomness Failures<\/a><br \/>\nASIACRYPT 2016<\/p>\n<p>V. Goyal, A. Jain, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2015\/1113\">Multi-Input Functional Encryption with Unbounded-Message Security<\/a><br \/>\nASIACRYPT 2016<\/p>\n<p>G. Kellaris, G. Kollios, K. Nissim, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/scholar.harvard.edu\/files\/gkellaris\/files\/genericattacks.pdf\">Generic Attacks on Secure Outsourced Databases<\/a><br \/>\nCCS 2016<\/p>\n<p>A. De Caro, V. Iovino, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2015\/1205\">Deniable Functional Encryption<\/a><br \/>\nPKC 2016<\/p>\n<p>D. Dachman-Soled, S.D. Gordon, F.H. Liu, A. O&#8217;Neill, H.S. Zhou<br \/>\n<a href=\"http:\/\/eprint.iacr.org\"> Leakage-Resilient Public-Key Encryption from Obfuscation<\/a><br \/>\nPKC 2016<\/p>\n<p>C. Mavroforakis, N. Chenette, A. O&#8217;Neill, G. Kollios, R. Canetti<br \/>\n<a href=\"http:\/\/www.cs.bu.edu\/~gkollios\/Papers\/modf581-mavroforakis.pdf\">Modular Order-Preserving Encryption, Revisited<\/a><br \/>\nSIGMOD 2015<\/p>\n<p>D. Dachman-Soled, G. Fuchsbauer, P. Mohassel, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2012\/543\">Enhanced Chosen-Ciphertext Security and Applications<\/a><br \/>\nPKC 2014<\/p>\n<p>M. Bellare, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2012\/515\">Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition<\/a><br \/>\nCANS 2013<\/p>\n<p>A. De Caro, V. Iovino, A. Jain, A. O&#8217;Neill, O. Paneth, G. Persiano<br \/>\n<a href=\"https:\/\/eprint.iacr.org\/2013\/364\">On the Achievability of Simulation-Based Security for Functional Encryption<\/a><br \/>\nCRYPTO 2013<\/p>\n<p>M. Lewko, A. O&#8217;Neill, A. Smith<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/\">Regularity of Lossy RSA on Subdomains and its Applications<\/a><br \/>\nEUROCRYPT 2013<\/p>\n<p><em>M. Gerbush, A. Lewko, A. O&#8217;Neill, B. Waters<\/em><br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2012\/261\">Dual Form Signatures: An Approach for Proving Security from Static Assumptions<\/a><br \/>\nASIACRYPT 2012<\/p>\n<p><em>B. Fuller, A. O&#8217;Neill, L. Reyzin<\/em><br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2012\/005\">A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy<\/a><br \/>\nTCC 2012<\/p>\n<p>A. O&#8217;Neill, C. Peikert, B. Waters<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2011\/352\">Bideniable Public-Key Encryption<\/a><br \/>\nCRYPTO 2011<\/p>\n<p>A. Boldyreva, N. Chenette, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/www.cc.gatech.edu\/%7Eaboldyre\/papers\/operev.pdf\">Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions<\/a><br \/>\nCRYPTO 2011<\/p>\n<p>V. Goyal, A. O&#8217;Neill, V. Rao<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2011\/233\">Correlated-Input Secure Hash Functions<\/a><br \/>\nTCC 2011<\/p>\n<p>E. Kiltz, A. O&#8217;Neill, A. Smith<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2011\/559\">Instantiability of RSA-OAEP under Chosen-Plaintext Attack<\/a><br \/>\nCRYPTO 2010<\/p>\n<p>E. Kiltz, P. Mohassel, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/pages.cpsc.ucalgary.ca\/~pmohasse\/ATDF.pdf\">Adaptive Trapdoor Functions and Chosen-Ciphertext Security<\/a><br \/>\nEUROCRYPT 2010<\/p>\n<p>A. Boldyreva, N. Chenette, Y. Lee, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/www.cc.gatech.edu\/%7Eaboldyre\/papers\/bclo.pdf\">Order-Preserving Symmetric Encryption<\/a><br \/>\nEUROCRYPT 2009<\/p>\n<p>A. Boldyreva, S. Fehr, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2008\/352\">On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles<\/a><br \/>\nCRYPTO 2008<\/p>\n<p>M. Bellare, M. Fischlin, A. O&#8217;Neill, T. Ristenpart<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2008\/267\">Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles<\/a><br \/>\nCRYPTO 2008<\/p>\n<p>A. Boldyreva, C. Gentry, A. O&#8217;Neill, D. H. Yum<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2007\/438\">Ordered Multisignatures and Identity-Based Sequential Aggregate Signatures, with Applications to Secure Routing<\/a><br \/>\nCCS 2007<\/p>\n<p>M. Bellare, A. Boldyreva, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2006\/186\">Deterministic and Efficiently Searchable Encryption<\/a><br \/>\nCRYPTO 2007<\/p>\n<p>G. Amanatidis, A. Boldyreva, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/www.cc.gatech.edu\/%7Eaboldyre\/papers\/abo.pdf\">Provably-Secure Schemes for Basic Query Support in Outsourced Databases<\/a><br \/>\nDBSEC 2007<\/p>\n<p>P. Blair, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/www.csun.edu\/cod\/conf\/2005\/proceedings\/2346.htm\"> An Architecture to Enable Community-Based Wayfinding for the Blind<\/a><br \/>\nTechnology and Persons with Disabilities Conference 2005 (See also <a href=\"http:\/\/www.calit2.net\/newsroom\/article.php?id=460\">here<\/a>)<\/p>\n<h3>Journal Papers<\/h3>\n<p>D. Dachman-Soled, S.D. Gordon, F.H. Liu, A. O&#8217;Neill, H.S. Zhou<br \/>\n<a href=\"https:\/\/link.springer.com\/article\/10.1007\/s00145-018-9286-z\">Leakage Resilience from Program Obfuscation<\/a><br \/>\nJ. Cryptology 2019<\/p>\n<p>A. De Caro, V. Iovino, A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/orbilu.uni.lu\/handle\/10993\/31154\">Receiver and Sender Deniable Functional Encryption<\/a><br \/>\nIET Information Security 2017<\/p>\n<p>E. Kiltz, A. O&#8217;Neill, A. Smith<br \/>\n<a href=\"https:\/\/link.springer.com\/article\/10.1007%2Fs00145-016-9238-4\">Instantiability of RSA-OAEP under Chosen-Plaintext Attack<\/a><br \/>\nJ. Cryptology 2017<\/p>\n<p>B. Fuller, A. O&#8217;Neill, L. Reyzin<br \/>\n<a href=\"https:\/\/link.springer.com\/article\/10.1007%2Fs00145-013-9174-5\">A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy <\/a><br \/>\nJ. Cryptology 2015<\/p>\n<p>A. Boldyreva, C. Gentry. A. O&#8217;Neill, D.H. Yum<br \/>\n<a href=\"http:\/\/dl.acm.org\/citation.cfm?doid=1410234.1410237\">New Multiparty Signature Schemes for Network Routing Applications<\/a><br \/>\nACM TISSEC 2008<\/p>\n<h3>Manuscripts<\/h3>\n<p>G. Kellaris, G. Kollios, K. Nissim, A. O&#8217;Neill<br \/>\n<a href=\"https:\/\/arxiv.org\/abs\/1706.01552\">Accessing Data while Preserving Privacy<\/a><br \/>\narVix 2017<\/p>\n<p>A. O&#8217;Neill<br \/>\n<a href=\"http:\/\/eprint.iacr.org\/2010\/556\">Definitional Issues in Functional Encryption<\/a><br \/>\nePrint 2010<\/p>\n<h3>Patents<\/h3>\n<p>M. Chase, A. O&#8217;Neill<br \/>\n<a href=\"https:\/\/patents.google.com\/patent\/US8527766B2\/en\">Reducing Leakage of Information from Cryptographic Systems<\/a><br \/>\nUS Patent 8527766, Assignee: Microsoft Corporation<\/p>\n<h3>Thesis<\/h3>\n<p>A. O&#8217;Neill<br \/>\n<a href=\"https:\/\/smartech.gatech.edu\/handle\/1853\/37109\">Stronger Security Notions for Trapdoor Functions and Applications<\/a><br \/>\nGeorgia Institute of Technology 2010<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Conference Papers O. Acharya, W. Feng, R. Langrehr, A. O&#8217;Neill Access-Controlled Inner Product Function-Revealing Encryption CIC 2025 O. Acharya, S. Biswas, W. Feng, A. O&#8217;Neill, A. Yerukhimovich Non-interactive Verifiable Aggregation PETS 2025 G. Cho, G. Fuchsbauer, A. O&#8217;Neill, M. Sefranek Schnorr Signatures are Tightly Secure in the ROM under a Non-Interactive Assumption CRYPTO 2025 M. &hellip; <a href=\"https:\/\/groups.cs.umass.edu\/oneill\/publications\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Publications&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-7","page","type-page","status-publish","hentry","hfeed"],"_links":{"self":[{"href":"https:\/\/groups.cs.umass.edu\/oneill\/wp-json\/wp\/v2\/pages\/7","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/groups.cs.umass.edu\/oneill\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/groups.cs.umass.edu\/oneill\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/groups.cs.umass.edu\/oneill\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/groups.cs.umass.edu\/oneill\/wp-json\/wp\/v2\/comments?post=7"}],"version-history":[{"count":31,"href":"https:\/\/groups.cs.umass.edu\/oneill\/wp-json\/wp\/v2\/pages\/7\/revisions"}],"predecessor-version":[{"id":171,"href":"https:\/\/groups.cs.umass.edu\/oneill\/wp-json\/wp\/v2\/pages\/7\/revisions\/171"}],"wp:attachment":[{"href":"https:\/\/groups.cs.umass.edu\/oneill\/wp-json\/wp\/v2\/media?parent=7"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}