| 2025 | CIAC | On The Computational Complexity of Games with Uncertainty. | Bruce M. Kapron, Koosha Samieefar |
| 2025 | SOFSEM | The Computational Complexity of Equilibria with Strategic Constraints. | Bruce M. Kapron, Koosha Samieefar |
| 2024 | LICS | Declassification Policy for Program Complexity Analysis. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2023 | ProvSec | Linicrypt in the Ideal Cipher Model. | Zahra Javar, Bruce M. Kapron |
| 2022 | FOSSACS | Complete and tractable machine-independent characterizations of second-order polytime. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2020 | LICS | A tier-based typed programming language characterizing Feasible Functionals. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2018 | LICS | Type-two polynomial-time and restricted lookahead. | Bruce M. Kapron, Florian Steinberg |
| 2017 | EuroCrypt | Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions. | Mohammad Hajiabadi, Bruce M. Kapron |
| 2016 | ISITA | On a variant of multilinear modular hashing with applications to authentication and secrecy codes. | Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, Lszl Tth |
| 2016 | PKC | On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. | Mohammad Hajiabadi, Bruce M. Kapron, Venkatesh Srinivasan |
| 2016 | TCC | Simultaneous Secrecy and Reliability Amplification for a General Channel Model. | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro |
| 2015 | CRYPTO | Reproducible Circularly-Secure Bit Encryption: Applications and Realizations. | Mohammad Hajiabadi, Bruce M. Kapron |
| 2013 | SODA | Dynamic graph connectivity in polylogarithmic worst case time. | Bruce M. Kapron, Valerie King, Ben Mountjoy |
| 2013 | TCC | Computational Soundness of Coinductive Symbolic Security under Active Attacks. | Mohammad Hajiabadi, Bruce M. Kapron |
| 2011 | ADBIS | k-Anonymization of Social Networks by Vertex Addition. | Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh |
| 2010 | CCS | Computational indistinguishability logic. | Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech |
| 2010 | LPAR | On the Equality of Probabilistic Terms. | Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech, Vincent Laporte |
| 2008 | SODA | Fast asynchronous byzantine agreement and leader election with full information. | Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani |
| 2007 | ICALP | A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). | Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh |
| 2006 | PODC | Lower bound for scalable Byzantine Agreement. | Dan Holtby, Bruce M. Kapron, Valerie King |
| 2003 | FOCS | Logics for Reasoning about Cryptographic Constructions. | Russell Impagliazzo, Bruce M. Kapron |
| 2000 | LICS | Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. | Samuel R. Buss, Bruce M. Kapron |
| 1994 | LFCS | The Parameterized Complexity of Some Problems in Logic and Linguistics. | Bruce M. Kapron, Michael R. Fellows, Rodney G. Downey, Michael T. Hallett, Harold T. Wareham |
| 1993 | FOCS | Parallel computable higher type functionals (Extended Abstract) | Peter Clote, Aleksandar Ignjatovic, Bruce M. Kapron |
| 1993 | STACS | Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. | Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski |
| 1992 | LICS | Zero-One Laws for Modal Logic | Joseph Y. Halpern, Bruce M. Kapron |
| 1991 | FOCS | A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) | Bruce M. Kapron, Stephen A. Cook |
| 1989 | FOCS | Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) | Stephen A. Cook, Bruce M. Kapron |