This map shows the geographic impact of Bart Mennink's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bart Mennink with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bart Mennink more than expected).
This network shows the impact of papers produced by Bart Mennink. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bart Mennink. The network helps show where Bart Mennink may publish in the future.
Co-authorship network of co-authors of Bart Mennink
This figure shows the co-authorship network connecting the top 25 collaborators of Bart Mennink.
A scholar is included among the top collaborators of Bart Mennink based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Bart Mennink. Bart Mennink is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Granger, Robert, Philipp Jovanovic, Bart Mennink, & Samuel Neves. (2015). Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption. Lecture notes in computer science. 2015. 263–293.6 indexed citations
8.
Andreeva, Elena, Joan Daemen, Bart Mennink, & Gilles Van Assche. (2015). Security of Keyed Sponge Constructions Using a Modular Proof Approach. Lecture notes in computer science. 9054. 364–384.4 indexed citations
9.
Mouha, Nicky, Bart Mennink, Anthony Van Herrewege, et al.. (2014). Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers. Lecture notes in computer science. 8781. 306–323.4 indexed citations
Peeters, Roel, Jens Hermans, & Bart Mennink. (2014). Speedup for European epassport authentication. 1–6.1 indexed citations
12.
Hermans, Jens, Bart Mennink, & Roel Peeters. (2014). When a Bloom filter is a Doom filter: Security assessment of a novel iris biometric template protection system. 1–6.35 indexed citations
13.
Andreeva, Elena, Andrey Bogdanov, Atul Luykx, et al.. (2014). How to Securely Release Unverified Plaintext in Authenticated Encryption. Lecture notes in computer science. 2014. 105–125.2 indexed citations
14.
Andreeva, Elena, Andrey Bogdanov, Atul Luykx, et al.. (2013). Parallelizable and Authenticated Online Ciphers. Lecture notes in computer science. 2013. 424–443.
15.
Mennink, Bart. (2013). Indifferentiability of Double Length Compression Functions. Lecture notes in computer science. 8308. 232–251.2 indexed citations
16.
Andreeva, Elena, et al.. (2012). Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein. Lecture notes in computer science. 7374. 287–305.1 indexed citations
17.
Andreeva, Elena, Atul Luykx, & Bart Mennink. (2012). Provable Security of BLAKE with Non-Ideal Compression Function. Lecture notes in computer science. 7707. 322–339.1 indexed citations
18.
Mennink, Bart. (2012). Optimal Collision Security in Double Block Length Hashing with Single Length Key. Lecture notes in computer science. 7658. 526–543.1 indexed citations
19.
Andreeva, Elena & Bart Mennink. (2011). Provable Chosen-Target-Forced-Midfix Preimage Resistance. Lecture notes in computer science. 7118. 37–54.1 indexed citations
20.
Andreeva, Elena, Bart Mennink, & Bart Preneel. (2010). Security Reductions of the Second Round SHA-3 Candidates. Lecture notes in computer science. 2010. 381–53.2 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.