Bruce M. Kapron

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