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

Tubitak Uekae

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

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

Computer networks · 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 · 67% Authentication and access control · 33%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › security protocol analysis
desynchronization attack
0.212014
Vulnerabilities of RFID Security Protocol Based on Chaotic Maps · ICNP 2014
Cryptographic protocols and secure computation › security protocol analysis
protocol vulnerability analysis
0.212014
Vulnerabilities of RFID Security Protocol Based on Chaotic Maps · ICNP 2014
Authentication and access control › authentication › authentication protocols
RFID authentication
0.212014
Vulnerabilities of RFID Security Protocol Based on Chaotic Maps · ICNP 2014

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

cryptanalysis · 0.2
YearPublicationVenuePosition
2014 Vulnerabilities of RFID Security Protocol Based on Chaotic Maps
abstract
Many RFID authentication protocols have been proposed to provide desired security and privacy level for RFID systems. Almost all of these protocols are based on symmetric cryptography because of the limited resources of RFID tags. Recently Cheng et. Al have proposed an RFID security protocol based on chaotic maps. In this paper, we analyse the security of this protocol and discover its vulnerabilities. We firstly present a de-synchronization attack in which a passive adversary makes the shared secrets out-of-synchronization by eavesdropping just one protocol session. We secondly present a secret disclosure attack in which a passive adversary extracts secrets of a tag by eavesdropping just one protocol session. An adversary having the secrets of the tag can launch some other attacks. Finally, we propose modifications to Cheng et. Al's protocol to eliminate its vulnerabilities.
Mete Akgün, Tubitak Uekae, M. Ufuk Çaglayan
ICNP2