Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Jun Bo Lau

dblp:329/5506 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0003-4752-3426ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key cryptanalysis		 1.012026
Lie Algebras and the Security of Cryptosystems Based on Classical Varieties in Disguise · EUROCRYPT (4) 2026
Coding theory
error-correcting codes		 0.912025
Error Floor Prediction with Markov Models for QC-MDPC Codes · CRYPTO (1) 2025

Methods — techniques the papers use, named apart from their topics

lie algebras · 1.0markov model · 0.9
YearPublicationVenuePosition
2026 Lie Algebras and the Security of Cryptosystems Based on Classical Varieties in Disguise
Wouter Castryck, Péter Kutas, Jun Bo Lau, Alexander Lemmens, Mickaël Montessinos
 EUROCRYPT (4)4
2025 Error Floor Prediction with Markov Models for QC-MDPC Codes
Sarah Arpin, Jun Bo Lau, Antoine Mesnard, Ray A. Perlner, Angela Robinson, Jean-Pierre Tillich, Valentin Vasseur
 CRYPTO (1)2
2025 The Permutation Group of Reed-Solomon Codes Over Arbitrary Points
abstract
In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the permutation group of the Reed-Solomon code when the set of evaluation points is the whole finite field or the multiplicative group.
Eduardo Camps, Jun Bo Lau, Hiram H. López, Welington Santos
 ISIT2
2022 A Study of Error Floor Behavior in QC-MDPC Codes
Sarah Arpin, Tyler Raven Billingsley, Daniel Rayor Hast, Jun Bo Lau, Ray A. Perlner, Angela Robinson
 PQCrypto4