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

Adrian Kent

dblp:76/2163 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · unresolved

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

Security and privacy · 1 · 1 first-author

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.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Theoretical computer science
1 paper
Quantum computing and quantum information · 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.112005
Secure Classical Bit Commitment Using Fixed Capacity Communication Channels · J. Cryptol. 2005
Cryptographic protocols and secure computation
commitment schemes
0.112005
Secure Classical Bit Commitment Using Fixed Capacity Communication Channels · J. Cryptol. 2005
Quantum computing and quantum information › quantum cryptography
bit commitment
0.112005
Secure Classical Bit Commitment Using Fixed Capacity Communication Channels · J. Cryptol. 2005
Quantum computing and quantum information
quantum cryptography
0.112005
Secure Classical Bit Commitment Using Fixed Capacity Communication Channels · J. Cryptol. 2005

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

fixed-capacity communication channel · 0.1
YearPublicationVenuePosition
2005 Secure Classical Bit Commitment Using Fixed Capacity Communication Channels
Adrian Kent
J. Cryptol.1