![]() |
Adam O'Neill Email: |
I am a Ph.D. student in cryptography, in the Theory Group at the College of Computing, Georgia Tech. My primary research interests are in the design and analysis of practical, provably secure cryptographic primitives such as encryption schemes, digital signatures, and hash functions. My advisor is Sasha Boldyreva.
A. Boldyreva, N. Chenette, Y. Lee, A. O'Neill
Order-Preserving Symmetric Encryption
Advances in Cryptology -
Eurocrypt 2009.
A. Boldyreva, S. Fehr, A. O'Neill
On Notions of Security for
Deterministic Encryption, and Efficient Constructions without Random Oracles
Advances in Cryptology -
Crypto
2008.
M. Bellare, M. Fischlin, A. O'Neill, T. Ristenpart
Deterministic Encryption:
Definitional Equivalences and Constructions without Random Oracles
Advances in Cryptology -
Crypto
2008.
A. Boldyreva, C. Gentry, A. O'Neill, D. H. Yum
Ordered Multisignatures and Identity-Based Sequential Aggregate Signatures, with
Applications to Secure Routing
ACM Conference on Computer and Communications Security -
CCS
2007.
Full version: [.pdf]
Note: As pointed out by
Hwang et al. there is a serious error in one of the schemes proposed in this paper. We are currently in the process of correcting and revising the paper. In the meantime please contact me for details.
M. Bellare, A. Boldyreva, A. O'Neill
Deterministic and Efficiently Searchable
Encryption
Advances in Cryptology -
Crypto 2007.
Full version: [.pdf]
G. Amanatidis, A. Boldyreva, A. O'Neill
Provably-Secure Schemes for Basic Query Support in Outsourced Databases
Working Conference on Data and Applications Security - DBSEC
2007.
P. Blair, A. O'Neill
An Architecture to Enable Community-Based Wayfinding for the Blind
Technology and Persons with Disabilities Conference, 2005. (See also here)
E. Kiltz, A. O'Neill, A. Smith
Lossiness of RSA and the Chosen-Plaintext Security of OAEP without Random
Oracles
E. Kiltz, P. Mohassel, A. O'Neill
Adaptive Trapdoor Functions and Chosen-Ciphertext Secure Public-Key Encryption
A. O'Neill, A. Sangwan
Rational Secret Sharing with Honest and Malicious Players
Last Modified: . This page is always under construction!