Bruce M. Kapron

According to our database, Bruce M. Kapron authored at least 60 papers between 1987 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Declassification Policy for Program Complexity Analysis.

Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux

CoRR, 2024

2023

The Computational Complexity of Equilibria with Strategic Constraints.

Bruce M. Kapron, Koosha Samieefar

CoRR, 2023

Linicrypt in the Ideal Cipher Model.

Zahra Javar, Bruce M. Kapron

Proceedings of the Provable and Practical Security, 2023

Preimage Awareness in Linicrypt.

Zahra Javar, Bruce M. Kapron

Proceedings of the 36th IEEE Computer Security Foundations Symposium, 2023

Cook's Berkeley Notes.

Bruce M. Kapron

Proceedings of the Logic, 2023

Introduction.

Bruce M. Kapron

Proceedings of the Logic, 2023

2022

A tier-based typed programming language characterizing Feasible Functionals.

Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux

Log. Methods Comput. Sci., 2022

Complete and tractable machine-independent characterizations of second-order polytime.

Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux

Proceedings of the Foundations of Software Science and Computation Structures, 2022

2020

Type-two polynomial-time and restricted lookahead.

Bruce M. Kapron, Florian Steinberg

Theor. Comput. Sci., 2020

MMH* with arbitrary modulus is always almost-universal.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

CoRR, 2020

2019

Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151).

Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg

NII Shonan Meet. Rep., 2019

A generalization of Schönemann's theorem via a graph theoretic method.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

Discret. Math., 2019

Type-two Iteration with Bounded Query Revision.

Bruce M. Kapron, Florian Steinberg

Proceedings of the Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis, 2019

2018

Anonymization and De-anonymization of Social Network Data.

Sean Chester, Bruce M. Kapron, Gautam Srivastava, Venkatesh Srinivasan, Alex Thomo

Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes.

Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, László Tóth

Int. J. Found. Comput. Sci., 2018

Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

Des. Codes Cryptogr., 2018

2017

Reproducible Circularly Secure Bit Encryption: Applications and Realizations.

Mohammad Hajiabadi, Bruce M. Kapron

J. Cryptol., 2017

Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions.

Mohammad Hajiabadi, Bruce M. Kapron

IACR Cryptol. ePrint Arch., 2017

A Survey of Classes of Primitive Recursive Functions.

Stephen A. Cook, Bruce M. Kapron

Electron. Colloquium Comput. Complex., 2017

2016

The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

IEEE Trans. Inf. Theory, 2016

MMH^⁎ with arbitrary modulus is always almost-universal.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

Inf. Process. Lett., 2016

Simultaneous Secrecy and Reliability Amplification for a General Channel Model.

Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro

IACR Cryptol. ePrint Arch., 2016

On a variant of multilinear modular hashing with applications to authentication and secrecy codes.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, László Tóth

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Semantically Non-preserving Transformations for Antivirus Evaluation.

Erkan Ersan, Lior Malka, Bruce M. Kapron

Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

Stability of certainty and opinion in influence networks.

Ariel Webster, Bruce M. Kapron, Valerie King

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

A framework for non-interactive instance-dependent commitment schemes (NIC).

Bruce M. Kapron, Lior Malka, S. Venkatesh

Theor. Comput. Sci., 2015

On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes.

Mohammad Hajiabadi, Bruce M. Kapron, S. Venkatesh

IACR Cryptol. ePrint Arch., 2015

Restricted linear congruences.

Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, Roberto Tauraso, László Tóth

IACR Cryptol. ePrint Arch., 2015

Gambling, Computational Information, and Encryption Security.

Mohammad Hajiabadi, Bruce M. Kapron

Electron. Colloquium Comput. Complex., 2015

Dynamic graph connectivity with improved worst case update time and sublinear space.

David Gibb, Bruce M. Kapron, Valerie King, Nolan Thorn

CoRR, 2015

Restricted linear congruences and an authenticated encryption scheme.

Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, Roberto Tauraso, László Tóth

CoRR, 2015

On almost-universal multilinear modular hashing with composite moduli.

Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh

CoRR, 2015

2014

Anonymization and De-anonymization of Social Network Data.

Sean Chester, Bruce M. Kapron, Gautam Srivastava, Srinivasan Venkatesh, Alex Thomo

Encyclopedia of Social Network Analysis and Mining, 2014

2013

Complexity of social network anonymization.

Sean Chester, Bruce M. Kapron, Gautam Srivastava, S. Venkatesh

Soc. Netw. Anal. Min., 2013

Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes.

Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh

Soc. Netw. Anal. Min., 2013

Dynamic graph connectivity in polylogarithmic worst case time.

Bruce M. Kapron, Valerie King, Ben Mountjoy

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Computational Soundness of Coinductive Symbolic Security under Active Attacks.

Mohammad Hajiabadi, Bruce M. Kapron

IACR Cryptol. ePrint Arch., 2012

2011

Social Network Anonymization via Edge Addition.

Bruce M. Kapron, Gautam Srivastava, S. Venkatesh

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2011

k-Anonymization of Social Networks by Vertex Addition.

Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh

Proceedings of the ADBIS 2011, 2011

2010

Fast asynchronous Byzantine agreement and leader election with full information.

Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani

ACM Trans. Algorithms, 2010

On the Equality of Probabilistic Terms.

Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech, Vincent Laporte

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Computational indistinguishability logic.

Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech

Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2008

Lower bound for scalable Byzantine Agreement.

Dan Holtby, Bruce M. Kapron, Valerie King

Distributed Comput., 2008

2007

A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC).

Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Logics for reasoning about cryptographic constructions.

Russell Impagliazzo, Bruce M. Kapron

J. Comput. Syst. Sci., 2006

2003

Erratum to "Zero-one laws for modal logic" [Ann. Pure Appl. Logic 69 (1994) 157-193].

Joseph Y. Halpern, Bruce M. Kapron

Ann. Pure Appl. Log., 2003

The modal logic of the countable random frame.

Valentin Goranko, Bruce M. Kapron

Arch. Math. Log., 2003

2002

Resource-bounded continuity and sequentiality for type-two functionals.

Samuel R. Buss, Bruce M. Kapron

ACM Trans. Comput. Log., 2002

2001

On characterizations of the basic feasible functionals (Part I).

Robert J. Irwin, James S. Royer, Bruce M. Kapron

J. Funct. Program., 2001

1999

A note on negative tagging for least fixed-point formulae.

Dilian Gurov, Bruce M. Kapron

RAIRO Theor. Informatics Appl., 1999

Feasibly Continuous Type-Two Functionals.

Bruce M. Kapron

Comput. Complex., 1999

1996

A New Characterization of Type-2 Feasibility.

Bruce M. Kapron, Stephen A. Cook

SIAM J. Comput., 1996

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

J. Comput. Syst. Sci., 1996

A modal mu-calculus and a proof system for value passing processes.

Dilian Gurov, Sergey Berezin, Bruce M. Kapron

Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996

1994

Zero-One Laws for Modal Logic.

Joseph Y. Halpern, Bruce M. Kapron

Ann. Pure Appl. Log., 1994

1993

Parallel computable higher type functionals (Extended Abstract)

Peter Clote, Aleksandar Ignjatovic, Bruce M. Kapron

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1991

Feasible computation in higher types.

Bruce M. Kapron

PhD thesis, 1991

A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract)

Bruce M. Kapron, Stephen A. Cook

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1989

Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract)

Stephen A. Cook, Bruce M. Kapron

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1987

Modal Sequents and Definability.

Bruce M. Kapron

J. Symb. Log., 1987