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

László Czap 0002

dblp:15/9312-2 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 1Security and privacy · 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 · 50% Network security · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › provable data possession
distributed storage security		 0.112011
Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes · IEEE Trans. Dependable Secur. Comput. 2011
Network security › network coding security
pollution attack defense		 0.112011
Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes · IEEE Trans. Dependable Secur. Comput. 2011
Storage systems
storage reliability		 0.112011
Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes · IEEE Trans. Dependable Secur. Comput. 2011
Internet of things and sensor networks
wireless sensor network		 0.012011
Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes · IEEE Trans. Dependable Secur. Comput. 2011

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

error correction · 0.4coding-based distributed storage · 0.4
YearPublicationVenuePosition
2011 Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes
abstract
We address the problem of pollution attacks in coding-based distributed storage systems. In a pollution attack, the adversary maliciously alters some of the stored encoded packets, which results in the incorrect decoding of a large part of the original data upon retrieval. We propose algorithms to detect and recover from such attacks. In contrast to existing approaches to solve this problem, our approach is not based on adding cryptographic checksums or signatures to the encoded packets, and it does not introduce any additional redundancy to the system. The results of our analysis show that our proposed algorithms are suitable for practical systems, especially in wireless sensor networks.
Levente Buttyán, László Czap 0002, István Vajda
 IEEE Trans. Dependable Secur. Comput.2
2008 Securing coding based distributed storage in wireless sensor networks
abstract
We address the problem of pollution attacks in coding based distributed storage systems proposed for wireless sensor networks. In a pollution attack, the adversary maliciously alters some of the stored encoded packets, which results in the incorrect decoding of a large part of the original data upon retrieval. We propose algorithms to detect and recover from such attacks. In contrast to existing approaches to solve this problem, our approach is not based on adding cryptographic checksums or signatures to the encoded packets. We believe that our proposed algorithms are suitable in practical systems.
Levente Buttyán, László Czap 0002, István Vajda
 MASS2