The links below point to the abstracts and the full versions of the papers. Most of the proceedings versions are available via DBLP database.

• M. Barbosa and A. Boldyreva and S. Chen and B. Warinschi.
  Provable Security Analysis of FIDO2.
  Advances in Cryptology – CRYPTO 2021.
  
  
• E. Uzun, S. P. Chung, V. Kolesnikov, A. Boldyreva and W. Lee
  Fuzzy Labeled Private Set Intersection with Applications to Private Real-Time Biometric Search.
  USENIX Security, 2021.
  
  
• A. Boldyreva and T. Tang.
  Privacy-Preserving Approximate k-Nearest-Neighbors Search that Hides Access, Query and Volume Patterns.
  PoPETS, 2021.
  
  
• S. Chen, M. Jagielski, S. Jero, A. Boldyreva and C. Nita-Rotaru.
  Secure Communication Channel Establishment: TLS 1.3 (over TCP Fast Open) vs. QUIC.
  Journal of Cryptology 34(3): 26, 2021 .
  
  
• S. Chen, M. Jagielski, S. Jero, A. Boldyreva and C. Nita-Rotaru.
  Secure Communication Channel Establishment: TLS 1.3 (over TCP Fast Open) vs. QUIC.
  ESORICS, 2019.
  
  
• A. Boldyreva, T. Tang and B. Warinschi.
  Masking Fuzzy-Searchable Public Databases.
  Applied Cryptography and Network Security (ACNS) 2019.
  
  
• A. Boldyreva, C. Patton and T. Shrimpton.
  Hedging Public-Key Encryption in the Real World.
  Advances in Cryptology – CRYPTO 2017 proceedings.
  
  
• A. Boldyreva, S. Chen, D. Pointcheval and P.-A. Dupont.
  Human Computing for Handling Strong Corruptions in Authenticated Key Exchange.
  IEEE Computer Security Foundations Symposium (CSF) 2017.
  
  
• A. Boldyreva, T. Kim, R. J. Lipton, and B. Warinschi.
  Provably-Secure Remote Memory Attestation for Heap Overflow Protection.
  Conference on Security and Cryptography for Networks (SCN) 2016.

• R. Lychev, S. Jero, A. Boldyreva and C. Nita-Rotaru.
  How Secure and Quick is QUIC? Provable Security and Performance Analyses.
  IEEE Symposium on Security and Privacy Proceedings, IEEE, 2015. The winner of IRTF Applied Networking Research Prize.

• A. Boldyreva and N. Chenette.
  Efficient Fuzzy Search on Encrypted Data.
  Fast Software Encryption 2014 Proceedings, LNCS, Springer, 2014.

• B. Lau, S. Chung, C. Song, Y. Jang, W. Lee and A. Boldyreva.
  Mimesis Aegis: A Mimicry Privacy Shield A System's Approach to Data Privacy on Public Cloud.
  USENIX Security Symposium 2014 Proceedings.

• A. Boldyreva, J. P. Degabriele, K. G. Paterson and M. Stam.
  On Symmetric Encryption with Distinguishable Decryption Failures.
  Fast Software Encryption 2013 Proceedings, LNCS, Springer, 2013.
  

• A. Boldyreva and R. Lychev.
  Provable Security of S-BGP and other Path Vector Protocols: Model, Analysis and Extensions.
  ACM Conference on Computer and Communications Security (CCS '12) Proceedings, 2012.

• A. Boldyreva, J. P. Degabriele, K. G. Paterson and M. Stam.
  Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation.
  Advances in Cryptology - Eurocrypt 2012 Proceedings, Lecture Notes in Computer Science, D. Pointcheval ed., 2012.

• A. Boldyreva and V. Kumar.
  A New Pseudorandom Generator from Collision-Resistant Hash Functions. Cryptographers' Track of the RSA Conference Proceedings (CT-RSA '12), Lecture Notes in Computer Science, 2012.

• A. Boldyreva, N. Chenette, Y. Lee and A. O'Neill.
  Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions.
  Advances in Cryptology - Crypto 2011 Proceedings, Lecture Notes in Computer Science, Ph. Rogaway ed., 2011.

• A. Boldyreva, H. Imai and K. Kobara
  How to Strengthen the Security of RSA-OAEP.
  IEEE Transactions on Information Theory 56(11), pp. 5876-5886, 2010.

• A. Boldyreva, D. Cash, M. Fischlin and B. Warinschi.
  Foundations of Non-Malleable Hash and One-Way Functions.
  Advances in Cryptology - Asiacrypt 2009 Proceedings, LNCS Vol. 5912, M. Matsui ed., Springer, 2009.

• A. Boldyreva, N. Chenette, Y. Lee and A. O'Neill.
  Order-Preserving Symmetric Encryption.
  Advances in Cryptology - Eurocrypt 2009 Proceedings, Lecture Notes in Computer Science Vol. 5479, pp. 224-241, A. Joux ed., 2009.

• A. Boldyreva.
  Strengthening Security of RSA-OAEP.
  CT-RSA 2009 Conference Proceedings, Lecture Notes in Computer Science Vol. 5473, pp. 399-413, M. Fischlin ed., 2009.

• A. Boldyreva, C. Gentry, A. O'Neill and D. H. Yum.
  New Multiparty Signature Schemes for Network Routing Applications. (Corrected version)
  ACM Transactions on Information and System Security (TISSEC). Volume 12, Issue 1, pp. 1-39, October 2008.

• A. Boldyreva, V. Goyal and V. Kumar.
  Identity-based Encryption with Efficient Revocation.
  ACM Conference on Computer and Communications Security (CCS '08) Proceedings, pp. 417-426, 2008.

• A. Boldyreva, S. Fehr and A. O'Neill.
  On Notions of Security for Deterministic Encryption, and Efficient Constructions Without Random Oracles.
  Advances in Cryptology - Crypto 2008 Proceedings, Lecture Notes in Computer Science Vol. 5157, pp. 335-359, D. Wagner ed., 2008.

• A. Boldyreva, C. Gentry, A. O'Neill and D. H. Yum.
  Ordered Multisignatures and Identity-Based Sequential Aggregate Signatures, with Applications to Secure Routing. (Corrected version)
  ACM Conference on Computer and Communications Security (CCS '07) Proceedings, pp. 276-285, 2007.

• M. Bellare, A. Boldyreva, K. Kurosawa and J. Staddon.
  Multi-Recipient Encryption Schemes: How to Save on Bandwidth and Computation without Sacrificing Security.
  IEEE Transactions on Information Theory, Volume 53, Number 11, pp. 3927-3943, November 2007.

• M. Bellare, A. Boldyreva and A. O'Neill.
  Deterministic and Efficiently Searchable Encryption.
  Advances in Cryptology - Crypto 2007 Proceedings, Lecture Notes in Computer Science Vol. 4622, pp. 535-552, A. Menezes ed., 2007.

• G. Amanatidis, A. Boldyreva and A. O'Neill.
  Provably-Secure Schemes for Basic Query Support in Outsourced Databases.
  Working Conference on Data and Applications Security 2007 Proceedings, Lecture Notes in Computer Science Vol. 4602, pp. 14-30, Springer-Verlag, 2007.

• A. Boldyreva and V. Kumar.
  Provable-Security Analysis of Authenticated Encryption in Kerberos.
  IEEE Security and Privacy 2007 Proceedings, pp. 92-100, IEEE, 2007.

• A. Boldyreva, M. Fischlin, A. Palacio and B. Warinschi.
  A Closer Look at PKI: Security and Efficiency.
  Public Key Cryptography 2007 Proceedings, Lecture Notes in Computer Science Vol. 4450, pp. 458-475, T. Okamoto, X. Wang eds, Springer-Verlag, 2007.

• A. Boldyreva and M. Fischlin.
  On the Security of OAEP.
  Advances in Cryptology - Asiacrypt 2006 Proceedings, Lecture Notes in Computer Science Vol. 4284, pp. 210-225, X. Lai ed., 2006.

• W. Shi, H.-H. S. Lee, R. M. Yoo, and A. Boldyreva.
  A Digital Rights Enabled Graphics Processing System.
  ACM SIGGRAPH/Eurographics Workshop of Graphics Hardware Proceedings, 2006.

• A. Boldyreva and M. Fischlin.
  Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes.
  Advances in Cryptology - Crypto 2005 Proceedings, Lecture Notes in Computer Science Vol. 3621, pp. 412-429, V. Shoup ed., 2005.

• W. Shi, H.-H. S. Lee, M. Ghosh, C. Lu and A. Boldyreva.
  High Efficiency Counter Mode Security Architecture via Prediction and Precomputation.
  Proceedings of the 32nd International Symposium on Computer Architecture (ISCA), pp. 14-24, 2005.

• M. Bellare, A. Boldyreva and A. Palacio.
  An Un-Instantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem.
  Advances in Cryptology - Eurocrypt 2004 Proceedings, Lecture Notes in Computer Science Vol. 3027, pp. 171-188, C. Cachin and J. Camenisch ed., 2004.

• A. Boldyreva and N. Taesombut.
  On-line Encryption Schemes: New Security Notions and Constructions.
  CT-RSA 2004 Conference Proceedings, Lecture Notes in Computer Science Vol. 2964, pp. 1-14, T. Okamoto ed., 2004.

• A. Boldyreva.
  Efficient Threshold Signatures, Multisignatures and Blind Signatures based on the Gap-Diffie-Hellman-Group Signature Scheme.
  Public Key Cryptography 2003 Proceedings, Lecture Notes in Computer Science Vol. 2567, pp. 31-46, Y. Desmedt ed, Springer-Verlag, 2003.

• M. Bellare, A. Boldyreva and J. Staddon.
  Randomness Re-use in Multi-Recipient Encryption Schemes.
  Public Key Cryptography 2003 Proceedings, Lecture Notes in Computer Science Vol. 2567, pp. 85-99, Y. Desmedt ed, Springer-Verlag, 2003

• A. Boldyreva and M. Jakobsson.
  Theft-protected proprietary certificates.
  Security and Privacy in Digital Rights Management (DRM) ACM Workshop 2002 Proceedings, LNCS Vol. 2696, J. Feigenbaum ed., Springer-Verlag, 2003.

• M. Bellare, A. Boldyreva, A. Desai and D. Pointcheval.
  Key-Privacy in Public-Key Encryption.
  Advances in Cryptology - Asiacrypt 2001 Proceedings, Lecture Notes in Computer Science Vol. 2248, pp. 2248, C.Boyd ed, Springer-Verlag, 2001.

• M. Bellare, A. Boldyreva, L. Knudsen and C. Namprempre.
  On-Line Ciphers and the Hash-CBC Constructions.
  Advances in Cryptology - Crypto 2001 Proceedings, Lecture Notes in Computer Science Vol. 2139, pp. 292-309, J. Kilian ed, Springer-Verlag, 2001.

• M. Bellare and A. Boldyreva.
  The Security of Chaffing and Winnowing.
  Advances in Cryptology - Asiacrypt 2000 Proceedings, Lecture Notes in Computer Science Vol. 1976, pp. 517-530, T. Okamoto ed, Springer-Verlag, 2000.

• M. Bellare, A. Boldyreva and S. Micali.
  Public-key Encryption in a Multi-User Setting: Security Proofs and Improvements.
  Advances in Cryptology - Eurocrypt 2000 Proceedings, Lecture Notes in Computer Science Vol. 1807, pp. 259-274, B. Preneel ed, Springer-Verlag, 2000.

Manuscripts

• A. Boldyreva, A. Palacio and B. Warinschi.
  Secure Proxy Signature Schemes for Delegation of Signing Rights.
  IACR ePrint Archive: Report 2003/096.