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 VLDB 2026 / reviewers in the wild / expert

Denis Langlois

dblp:83/5987 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

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

Theory of computation · 1

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
Quantum computing and quantum information · 100%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › commitment schemes
bit commitment		 0.011993
A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties · FOCS 1993
Quantum computing and quantum information › quantum cryptography
quantum bit commitment		 0.011993
A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties · FOCS 1993
Quantum computing and quantum information
quantum cryptography		 0.011993
A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties · FOCS 1993
Physical-layer communications › optical communication
quantum communication		 0.011993
A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties · FOCS 1993

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

conjugate coding · 0.0quantum protocols · 0.0quantum protocol · 0.0
YearPublicationVenuePosition
1993 A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties
abstract
We describe a complete protocol for bit commitment based on the transmission of polarized photons. We show that under the laws of quantum physics, this protocol cannot be cheated by either party except with exponentially small probability (exponential in the running time needed to implement the honest protocol). A more thorough analysis is required to adjust all the constants used in this paper to get the best performance from our construction. Better performances may probably be achieved by using a third conjugate transmission-reception basis of circular polarization.>
Gilles Brassard, Claude Crépeau, Richard Jozsa, Denis Langlois
 FOCS4