Bruce M. Kapron

ScholarGPS® ID: 22916689058765

Affiliation

University of Victoria, Greater Victoria, Canada

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Metrics Summary

Publication Count

Predicted Citations

1,168

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Preimage Awareness in Linicrypt (conference) Javar, Zahra \| Kapron, Bruce M. 2023 IEEE 36th Computer Security Foundations Symposium (CSF) (2023) Dubrovnik, Croatia 10.1109/CSF57540.2023.00017 Cite \| Source
Authentication of variable length messages in quantum key distribution (journal article) Bibak, Khodakhast \| Kapron, Bruce M. \| Srinivasan, Venkatesh EPJ Quantum Technology, volume 9, issue 1 (2022). 10.1140/epjqt/s40507-022-00127-0 Cited by (5) \| Cite \| Source
A tier-based typed programming language characterizing Feasible Functionals (journal article) Hainry, Emmanuel \| Kapron, Bruce M. \| Marion, Jean-Yves \| Péchoux, Romain Logical Methods in Computer Science, volume Volume 18, Issue 1 (2022). 10.46298/lmcs-18(1:33)2022 Cited by (1) \| Cite \| Source
Complete and tractable machine-independent characterizations of second-order polytime (book chapter) In Foundations of Software Science and Computation Structures Hainry, Emmanuel \| Kapron, Bruce M. \| Marion, Jean-Yves \| Péchoux, Romain Springer International Publishing (2022) 10.1007/978-3-030-99253-8_19 Cited by (2) \| Cite \| Source
A tier-based typed programming language characterizing Feasible Functionals (conference) Hainry, Emmanuel \| Kapron, Bruce M. \| Marion, Jean-Yves \| Péchoux, Romain LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science (2020) Saarbrücken Germany 10.1145/3373718.3394768 Cited by (4) \| Cite \| Source
Type-two polynomial-time and restricted lookahead (journal article) Kapron, Bruce M. \| Steinberg, Florian Theoretical Computer Science, volume 813 (2020). 10.1016/j.tcs.2019.07.003 Cited by (1) \| Cite \| Source
A generalization of Schönemann’s theorem via a graph theoretic method (journal article) Bibak, Khodakhast \| Kapron, Bruce M. \| Srinivasan, Venkatesh Discrete Mathematics, volume 342, issue 11, pages 3057-3061 (2019). 10.1016/j.disc.2019.06.016 Cited by (3) \| Cite \| Source
Type-two Iteration with Bounded Query Revision (journal article) Kapron, Bruce M. \| Steinberg, Florian Electronic Proceedings in Theoretical Computer Science, volume 298 (2019). 10.4204/EPTCS.298.5 Cited by (2) \| Cite \| Source
Unweighted linear congruences with distinct coordinates and the Varshamov–Tenengolts codes (journal article) Bibak, Khodakhast \| Kapron, Bruce M. \| Srinivasan, Venkatesh Designs, Codes and Cryptography, volume 86, issue 9, pages 1893-1904 (2018). 10.1007/s10623-017-0428-3 Cited by (8) \| Cite \| Source
Type-two polynomial-time and restricted lookahead (conference) Kapron, Bruce M. \| Steinberg, Florian LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (2018) Oxford United Kingdom 10.1145/3209108.3209124 Cited by (4) \| Cite \| Source \| Open Access
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes (journal article) Bibak, Khodakhast \| Kapron, Bruce M. \| Srinivasan, Venkatesh \| Tóth, László International Journal of Foundations of Computer Science, volume 29, issue 03, pages 357-375 (2018). 10.1142/S0129054118500089 Cited by (10) \| Cite \| Source \| Open Access
Anonymization and De-anonymization of Social Network Data (book chapter) In Encyclopedia of Social Network Analysis and Mining Chester, Sean \| Kapron, Bruce M. \| Srivastava, Gautam \| Srinivasan, Venkatesh \| Thomo, Alex Springer New York (2018) 10.1007/978-1-4939-7131-2_22 Cited by (1) \| Cite \| Source
Anonymization and De-anonymization of Social Network Data (book chapter) In Encyclopedia of Social Network Analysis and Mining Chester, Sean \| Kapron, Bruce M. \| Srivastava, Gautam \| Srinivasan, Venkatesh \| Thomo, Alex Springer New York (2018) 10.1007/978-1-4614-7163-9_22-1 Cite \| Source
Reproducible Circularly Secure Bit Encryption: Applications and Realizations (journal article) Hajiabadi, Mohammad \| Kapron, Bruce M. Journal of Cryptology, volume 30, issue 4, pages 1187-1237 (2017). 10.1007/s00145-016-9246-4 Cite \| Source
Restricted linear congruences (journal article) Bibak, Khodakhast \| Kapron, Bruce M. \| Srinivasan, Venkatesh \| Tauraso, Roberto \| Tóth, László Journal of Number Theory, volume 171 (2017). 10.1016/j.jnt.2016.07.018 Cited by (13) \| Cite \| Source \| Open Access
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (book chapter) In Advances in Cryptology – EUROCRYPT 2017 Hajiabadi, Mohammad \| Kapron, Bruce M. Springer International Publishing (2017) 10.1007/978-3-319-56614-6_19 Cited by (3) \| Cite \| Source
Semantically Non-preserving Transformations for Antivirus Evaluation (book chapter) In Foundations and Practice of Security Ersan, Erkan \| Malka, Lior \| Kapron, Bruce M. Springer International Publishing (2017) 10.1007/978-3-319-51966-1_18 Cited by (2) \| Cite \| Source
On a restricted linear congruence (journal article) Bibak, Khodakhast \| Kapron, Bruce M. \| Srinivasan, Venkatesh International Journal of Number Theory, volume 12, issue 08, pages 2167-2171 (2016). 10.1142/S179304211650130X Cited by (5) \| Cite \| Source \| Open Access
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs (journal article) Bibak, Khodakhast \| Kapron, Bruce M. \| Srinivasan, Venkatesh IEEE Transactions on Information Theory, volume 62, issue 11, pages 6355-6358 (2016). 10.1109/TIT.2016.2595778 Cited by (6) \| Cite \| Source
Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT (journal article) Bibak, Khodakhast \| Kapron, Bruce M. \| Srinivasan, Venkatesh Nuclear Physics B, volume 910 (2016). 10.1016/j.nuclphysb.2016.07.028 Cited by (8) \| Cite \| Source \| Open Access