Bruce M. Kapron

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 37

Top Topics

Computational Complexity

Recursive Functions

Graph Theoretic

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

Publications

Ugo Dal Lago, Davide Davoli, Bruce M. Kapron
On Separation Logic, Computational Independence, and Pseudorandomness (Extended Version). CoRR (2024)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Declassification Policy for Program Complexity Analysis. LICS (2024)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Declassification Policy for Program Complexity Analysis. CoRR (2024)
Bruce M. Kapron, Koosha Samieefar
On the Computational Complexity of Quasi-Variational Inequalities and Multi-Leader-Follower Games. AAMAS (2024)
Zahra Javar, Bruce M. Kapron
Linicrypt in the Ideal Cipher Model. IACR Cryptol. ePrint Arch. 2024 (2024)
Bruce M. Kapron, Koosha Samieefar
The Computational Complexity of Equilibria with Strategic Constraints. CoRR (2023)
Zahra Javar, Bruce M. Kapron
Preimage Awareness in Linicrypt. CSF (2023)
Zahra Javar, Bruce M. Kapron
Linicrypt in the Ideal Cipher Model. ProvSec (2023)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Complete and tractable machine-independent characterizations of second-order polytime. FoSSaCS (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Complete and tractable machine-independent characterizations of second-order polytime. CoRR (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
A tier-based typed programming language characterizing Feasible Functionals. Log. Methods Comput. Sci. 18 (1) (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
A tier-based typed programming language characterizing Feasible Functionals. CoRR (2021)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
A tier-based typed programming language characterizing Feasible Functionals. LICS (2020)
Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs. CoRR (2020)
Bruce M. Kapron, Florian Steinberg
Type-two polynomial-time and restricted lookahead. Theor. Comput. Sci. 813 (2020)
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
MMH* with arbitrary modulus is always almost-universal. CoRR (2020)
Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. CoRR (2020)
Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg
Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151). NII Shonan Meet. Rep. 2019 (2019)
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
A generalization of Schönemann's theorem via a graph theoretic method. Discret. Math. 342 (11) (2019)
Bruce M. Kapron, Florian Steinberg
Type-two Iteration with Bounded Query Revision. DICE-FOPARA@ETAPS (2019)
Bruce M. Kapron, Florian Steinberg
Type-two polynomial-time and restricted lookahead. CoRR (2018)
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. Des. Codes Cryptogr. 86 (9) (2018)
Bruce M. Kapron, Florian Steinberg
Type-two polynomial-time and restricted lookahead. LICS (2018)
Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, László Tóth
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes. Int. J. Found. Comput. Sci. 29 (3) (2018)
Mohammad Hajiabadi, Bruce M. Kapron
Reproducible Circularly Secure Bit Encryption: Applications and Realizations. J. Cryptol. 30 (4) (2017)
Stephen A. Cook, Bruce M. Kapron
A Survey of Classes of Primitive Recursive Functions. Electron. Colloquium Comput. Complex. 24 (2017)
Mohammad Hajiabadi, Bruce M. Kapron
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions. IACR Cryptol. ePrint Arch. 2017 (2017)
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
A generalization of Schönemann's theorem via a graph theoretic method. CoRR (2017)
Mohammad Hajiabadi, Bruce M. Kapron
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions. EUROCRYPT (2) (2017)
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs. IEEE Trans. Inf. Theory 62 (11) (2016)
Mohammad Hajiabadi, Bruce M. Kapron, Venkatesh Srinivasan
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. Public Key Cryptography (2) (2016)
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, László Tóth
On a variant of multilinear modular hashing with applications to authentication and secrecy codes. ISITA (2016)
Ariel Webster, Bruce M. Kapron, Valerie King
Stability of certainty and opinion in influence networks. ASONAM (2016)
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. TCC (B1) (2016)
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. IACR Cryptol. ePrint Arch. 2016 (2016)
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
with arbitrary modulus is always almost-universal. Inf. Process. Lett. 116 (7) (2016)
Erkan Ersan, Lior Malka, Bruce M. Kapron
Semantically Non-preserving Transformations for Antivirus Evaluation. FPS (2016)
Bruce M. Kapron, Lior Malka, S. Venkatesh
A framework for non-interactive instance-dependent commitment schemes (NIC). Theor. Comput. Sci. 593 (2015)
Mohammad Hajiabadi, Bruce M. Kapron
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations. CRYPTO (1) (2015)
Mohammad Hajiabadi, Bruce M. Kapron
Gambling, Computational Information, and Encryption Security. Electron. Colloquium Comput. Complex. 22 (2015)
Mohammad Hajiabadi, Bruce M. Kapron
Gambling, Computational Information and Encryption Security. ICITS (2015)
Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, László Tóth
On an almost-universal hash function family with applications to authentication and secrecy codes. IACR Cryptol. ePrint Arch. 2015 (2015)
David Gibb, Bruce M. Kapron, Valerie King, Nolan Thorn
Dynamic graph connectivity with improved worst case update time and sublinear space. CoRR (2015)
Mohammad Hajiabadi, Bruce M. Kapron
Gambling, Computational Information and Encryption Security. IACR Cryptol. ePrint Arch. 2015 (2015)
Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, Roberto Tauraso, László Tóth
Restricted linear congruences. IACR Cryptol. ePrint Arch. 2015 (2015)
Mohammad Hajiabadi, Bruce M. Kapron
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations. IACR Cryptol. ePrint Arch. 2015 (2015)
Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, Roberto Tauraso, László Tóth
Restricted linear congruences and an authenticated encryption scheme. CoRR (2015)
Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh
On almost-universal multilinear modular hashing with composite moduli. CoRR (2015)
Mohammad Hajiabadi, Bruce M. Kapron, S. Venkatesh
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. IACR Cryptol. ePrint Arch. 2015 (2015)
Sean Chester, Bruce M. Kapron, Gautam Srivastava, S. Venkatesh
Complexity of social network anonymization. Soc. Netw. Anal. Min. 3 (2) (2013)
Bruce M. Kapron, Valerie King, Ben Mountjoy
Dynamic graph connectivity in polylogarithmic worst case time. SODA (2013)
Mohammad Hajiabadi, Bruce M. Kapron
Computational Soundness of Coinductive Symbolic Security under Active Attacks. TCC (2013)
Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh
Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes. Soc. Netw. Anal. Min. 3 (3) (2013)
Mohammad Hajiabadi, Bruce M. Kapron
Computational Soundness of Coinductive Symbolic Security under Active Attacks. IACR Cryptol. ePrint Arch. 2012 (2012)
Bruce M. Kapron, Gautam Srivastava, S. Venkatesh
Social Network Anonymization via Edge Addition. ASONAM (2011)
Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh
k-Anonymization of Social Networks by Vertex Addition. ADBIS (2) (2011)
Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech
Computational indistinguishability logic. CCS (2010)
Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani
Fast asynchronous Byzantine agreement and leader election with full information. ACM Trans. Algorithms 6 (4) (2010)
Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech, Vincent Laporte
On the Equality of Probabilistic Terms. LPAR (Dakar) (2010)
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC). IACR Cryptol. ePrint Arch. 2009 (2009)
Dan Holtby, Bruce M. Kapron, Valerie King
Lower bound for scalable Byzantine Agreement. Distributed Comput. 21 (4) (2008)
Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani
Fast asynchronous byzantine agreement and leader election with full information. SODA (2008)
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). ICALP (2007)
Dan Holtby, Bruce M. Kapron, Valerie King
Lower bound for scalable Byzantine Agreement. PODC (2006)
Russell Impagliazzo, Bruce M. Kapron
Logics for reasoning about cryptographic constructions. J. Comput. Syst. Sci. 72 (2) (2006)
Russell Impagliazzo, Bruce M. Kapron
Logics for Reasoning about Cryptographic Constructions. FOCS (2003)
Valentin Goranko, Bruce M. Kapron
The modal logic of the countable random frame. Arch. Math. Log. 42 (3) (2003)
Joseph Y. Halpern, Bruce M. Kapron
Erratum to "Zero-one laws for modal logic" [Ann. Pure Appl. Logic 69 (1994) 157-193]. Ann. Pure Appl. Log. 121 (2-3) (2003)
Samuel R. Buss, Bruce M. Kapron
Resource-bounded continuity and sequentiality for type-two functionals. ACM Trans. Comput. Log. 3 (3) (2002)
Robert J. Irwin, James S. Royer, Bruce M. Kapron
On characterizations of the basic feasible functionals (Part I). J. Funct. Program. 11 (1) (2001)
Samuel R. Buss, Bruce M. Kapron
Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. LICS (2000)
Dilian Gurov, Bruce M. Kapron
A note on negative tagging for least fixed-point formulae. RAIRO Theor. Informatics Appl. 33 (4/5) (1999)
Bruce M. Kapron
Feasibly Continuous Type-Two Functionals. Comput. Complex. 8 (2) (1999)
Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. J. Comput. Syst. Sci. 53 (1) (1996)
Dilian Gurov, Sergey Berezin, Bruce M. Kapron
A modal mu-calculus and a proof system for value passing processes. INFINITY (1996)
Bruce M. Kapron, Stephen A. Cook
A New Characterization of Type-2 Feasibility. SIAM J. Comput. 25 (1) (1996)
Joseph Y. Halpern, Bruce M. Kapron
Zero-One Laws for Modal Logic. Ann. Pure Appl. Log. 69 (2-3) (1994)
Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. STACS (1993)
Peter Clote, Aleksandar Ignjatovic, Bruce M. Kapron
Parallel computable higher type functionals (Extended Abstract) FOCS (1993)
Joseph Y. Halpern, Bruce M. Kapron
Zero-One Laws for Modal Logic LICS (1992)
Bruce M. Kapron, Stephen A. Cook
A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) FOCS (1991)
Stephen A. Cook, Bruce M. Kapron
Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) FOCS (1989)
Bruce M. Kapron
Modal Sequents and Definability. J. Symb. Log. 52 (3) (1987)