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

Stefan Skludarek

dblp:56/5596 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 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.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Theoretical computer science
1 paper
Information theory · 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
commitment capacity		 0.112008
The Commitment Capacity of the Gaussian Channel Is Infinite · IEEE Trans. Inf. Theory 2008
Cryptographic protocols and secure computation
commitment schemes		 0.112008
The Commitment Capacity of the Gaussian Channel Is Infinite · IEEE Trans. Inf. Theory 2008
Information theory
channel capacity		 0.012008
The Commitment Capacity of the Gaussian Channel Is Infinite · IEEE Trans. Inf. Theory 2008
Information theory › channel capacity
gaussian channel		 0.012008
The Commitment Capacity of the Gaussian Channel Is Infinite · IEEE Trans. Inf. Theory 2008

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

information-theoretic security analysis · 0.2
YearPublicationVenuePosition
2009 Anomaly Detection Using Time Index Differences of Identical Symbols with and without Training Data
Stefan Skludarek, Hirosuke Yamamoto
 ADMA1
2008 The Commitment Capacity of the Gaussian Channel Is Infinite
abstract
We prove that the commitment capacity of the power-constrained Gaussian channel, i.e., the optimal rate at which this channel can be used for implementing commitment schemes, is infinite.
Anderson C. A. Nascimento, João Barros, Stefan Skludarek, Hideki Imai
 IEEE Trans. Inf. Theory3
2006 Bit Commitment over Gaussian Channels
abstract
We consider bit commitment over additive white Gaussian noise channels. Our main result is that the maximum rate at which this class of channels can be used for implementing commitment protocols (the commitment capacity) is provably infinite, even under an average power constraint.
João Barros, Hideki Imai, Anderson C. A. Nascimento, Stefan Skludarek
 ISIT4