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

Robert Koenig

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

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

Theory of computation · 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%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › commitment schemes
bit commitment
0.112012
Unconditional Security From Noisy Quantum Storage · IEEE Trans. Inf. Theory 2012
Cryptographic protocols and secure computation
oblivious transfer
0.112012
Unconditional Security From Noisy Quantum Storage · IEEE Trans. Inf. Theory 2012
Cryptographic protocols and secure computation › key management › key distribution
quantum key distribution
0.012012
Unconditional Security From Noisy Quantum Storage · IEEE Trans. Inf. Theory 2012

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

quantum information theory · 0.1bounded-storage model · 0.1
YearPublicationVenuePosition
2012 Unconditional Security From Noisy Quantum Storage
abstract
We consider the implementation of two-party cryptographic primitives based on the sole assumption that no large-scale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit commitment, and prove that realistic noise levels provide security even against the most general attack. Such unconditional results were previously only known in the so-called bounded-storage model which is a special case of our setting. Our protocols can be implemented with present-day hardware used for quantum key distribution. In particular, no quantum storage is required for the honest parties.
Robert Koenig, Stephanie Wehner, Jürg Wullschleger
IEEE Trans. Inf. Theory1