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

I-Pin Chang

dblp:125/3097 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0003-0852-2471ORCID · reported

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

Computer networks · 2 · 2 since 2021Security and privacy · 1Software engineering, systems software and programming languages · 1 · 1 since 2021

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 · 62% Hardware security and side channels · 38%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key exchange
authenticated key exchange
0.812024
A Privacy-Preserving Authenticated Key Agreement Scheme Based on Physically Unclonable Functions for Multi-Server Architecture · IEEE Trans. Serv. Comput. 2024
Hardware security and side channels › hardware security primitives
physical unclonable function
0.812024
A Privacy-Preserving Authenticated Key Agreement Scheme Based on Physically Unclonable Functions for Multi-Server Architecture · IEEE Trans. Serv. Comput. 2024
Cryptographic protocols and secure computation
key exchange
0.212024
A Privacy-Preserving Authenticated Key Agreement Scheme Based on Physically Unclonable Functions for Multi-Server Architecture · IEEE Trans. Serv. Comput. 2024
Cryptographic protocols and secure computation › key exchange
session key distribution
0.212024
A Privacy-Preserving Authenticated Key Agreement Scheme Based on Physically Unclonable Functions for Multi-Server Architecture · IEEE Trans. Serv. Comput. 2024

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

formal security proof · 0.8
YearPublicationVenuePosition
2024 Extended chaotic map-based key management for hierarchical access control in e-medicine systems
Tian-Fu Lee, I-Pin Chang, Jyun-Guo Wang, Yen-Chang Chen, Sheng-Tzung Tsai, Rui-Yu Chen
Peer Peer Netw. Appl.2
2024 Secure and lightweight key agreement protocol for remote surgery over tactile internet using physically unclonable functions
Tian-Fu Lee, Wei-Jie Huang, I-Pin Chang
Peer Peer Netw. Appl.3
2024 A Privacy-Preserving Authenticated Key Agreement Scheme Based on Physically Unclonable Functions for Multi-Server Architecture
abstract
Authenticated key agreement schemes for multi-server architecture enable a user to register with one registration server and access multiple remote application servers rapidly and conveniently to receive services from them. Several efficient authenticated key agreement schemes have recently been developed for multi-server architecture. However, most of them face many security threats and cannot resist potential attacks. This investigation considers the limitations of previous schemes and proposes a novel efficient and secure multi-server authenticated key agreement scheme that uses Physically Unclonable Functions (PUFs); it is based on a hardware circuit and provides randomness, uniqueness and unclonability to support the lightweight authentication of devices. The proposed scheme protects user privacy and is formally proved to satisfy mutual authentication and session key agreement. This scheme solves problems that were left unsolved in previous works, provides more security, and has a low computational cost.
Tian-Fu Lee, I-Pin Chang, Wei-Jie Huang
IEEE Trans. Serv. Comput.2
2013 Efficient three-party encrypted key exchange using trapdoor functions
abstract
ABSTRACT Three‐party encrypted key exchange (3PEKE) enables two communicating parties to securely exchange confidential and authenticated information over an insecure network via a trusted server. This investigation presents a novel efficient and secure 3PEKE protocol using a super‐poly‐to‐one trapdoor function. The proposed protocol employs the Diffie–Hellman key exchange and adopts the technique that the clients can publicly exchange the factors for generating the session key without the help of the server to reduce the numbers of transmissions. A round‐efficient version of the proposed 3PEKE protocol is also described. Compared with related approaches, the proposed protocol not only retains security requirements and possesses lower computational cost but also has fewer transmissions and realizes the lower bounds of communications. Copyright © 2013 John Wiley & Sons, Ltd.
Tian-Fu Lee, I-Pin Chang, Ching-Cheng Wang
Secur. Commun. Networks2