Byoungcheon Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Byoungcheon Lee has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
Kwangjo Kim
Department of Computer Science, KAIST, Daejeon 305-714, Republic of Korea
8 shared publicationsColin Boyd
Queensland University of Technology
6 shared publicationsEd Dawson
Queensland University of Technology
6 shared publicationsKun Peng
Queensland University of Technology
4 shared publicationsRiza Aditya
Queensland University of Technology
3 shared publications- Dae Young Kim
Department of Computer Software Engineering, Soonchunhyang University, Asan 31538, Republic of Korea
2 shared publications
Latest Publications
- Open Access
- 3 February 2021
- Published by MDPI AG in Preprints.org
Stateless One-time Authenticated Session Resumption in TLS Handshake Using Paired Token
Transport Layer Security (TLS) is a cryptographic protocol that provides communications security between two peers and it is widely used in many applications. To reduce the latency in TLS handshake session resumption using pre-shared key (PSK) had been used. But current methods in PSK mode handshake uses a fixed session key multiple times for the lifetime of session ticket. Reuse of fixed session key should be very careful in the point of communications security. It is vulnerable to replay attacks and there is a possibility of tracking users. Paired token (PT) is a new secondary credential scheme that provides pre-shared key in stateless way in client-server environment. Server issues paired token (public token and secret token) to authenticated client. Public token represents signed identity of client and secret token is a kind of shared secret between client and server. Once client is equipped with PT, it can be used for many symmetric key based cryptographic applications such as authentication, authorization, key establishment, etc. It was also shown that it can be used for one-time authenticated key establishment using the time-based one-time password (TOTP) approach. In this paper we apply the PT and TOTP approach to TLS to achieve stateless one-time authenticated session resumption. Server executes full handshake of TLS 1.3 and issues PT to authenticated client. Then client and server can execute one-time authenticated session resumption using PT in stateless way in server side. In every runs of session resumption distinct session keys are established that the same PT can be used safely for longer lifetime. If anonymous PT is used with renewal issuing, user privacy, untraceability and forward security can be achieved easily. It will provide a huge performance gain in large-scale distributed services.
- 3 February 2021
- Published by MDPI AG in Preprints.org
Open AccessStateless One-time Authenticated Session Resumption in TLS Handshake Using Paired Token
Transport Layer Security (TLS) is a cryptographic protocol that provides communications security between two peers and it is widely used in many applications. To reduce the latency in TLS handshake session resumption using pre-shared key (PSK) had been used. But current methods in PSK mode handshake uses a fixed session key multiple times for the lifetime of session ticket. Reuse of fixed session key should be very careful in the point of communications security. It is vulnerable to replay attacks and there is a possibility of tracking users. Paired token (PT) is a new secondary credential scheme that provides pre-shared key in stateless way in client-server environment. Server issues paired token (public token and secret token) to authenticated client. Public token represents signed identity of client and secret token is a kind of shared secret between client and server. Once client is equipped with PT, it can be used for many symmetric key based cryptographic applications such as authentication, authorization, key establishment, etc. It was also shown that it can be used for one-time authenticated key establishment using the time-based one-time password (TOTP) approach. In this paper we apply the PT and TOTP approach to TLS to achieve stateless one-time authenticated session resumption. Server executes full handshake of TLS 1.3 and issues PT to authenticated client. Then client and server can execute one-time authenticated session resumption using PT in stateless way in server side. In every runs of session resumption distinct session keys are established that the same PT can be used safely for longer lifetime. If anonymous PT is used with renewal issuing, user privacy, untraceability and forward security can be achieved easily. It will provide a huge performance gain in large-scale distributed services.
- Open Access
- 19 January 2021
- Published by MDPI AG in Electronics
- Vol. 10 (2) , 215
Stateless Re-Association in WPA3 Using Paired Token
In Wi-Fi Protected Access 3 (WPA3), a secure connection is established in two sequential stages. Firstly, in the authentication and association stage, a pairwise master key (PMK) is generated. Secondly, in the post-association stage, a pairwise transient key (PTK) is generated from PMK using the traditional 4-way handshake protocol. To reduce the heavy load of the first stage, PMK caching can be used. If the client and AP are previously authenticated and have a PMK cache, the first heavy stage can be skipped and the cached PMK can be used to directly execute the 4-way handshake. However, PMK caching is a very primitive technology to manage shared key between a client and AP and there are many limitations; AP has to manage a stateful cache for a large number of clients, cache lifetime is limited, etc. Paired token (PT)is a new secondary credential scheme that provides stateless pre-shared key (PSK) in a client-server environment. The server issues a paired token (public token and secret token) to an authenticated client where the public token has the role of signed identity and the secret token is a kind of shared secret. Once a client is equipped with PT, it can be used for many symmetric key-based cryptographic applications such as authentication, authorization, key establishment, etc. In this paper, we apply the PT approach to WPA3 and try to replace the PMK caching with the one-time authenticated key establishment using PT. At the end of a successful full handshake, AP securely issues PT to the client. Then, in subsequent re-association requests, the client and AP can compute the same one-time authenticated PMK using PT in a stateless way. Using this kind of stateless re-association technology, AP can provide a high performance Wi-Fi service to a larger number of clients.
- 19 January 2021
- Published by MDPI AG in Electronics
- Vol. 10 (2) , 215
Open AccessStateless Re-Association in WPA3 Using Paired Token
In Wi-Fi Protected Access 3 (WPA3), a secure connection is established in two sequential stages. Firstly, in the authentication and association stage, a pairwise master key (PMK) is generated. Secondly, in the post-association stage, a pairwise transient key (PTK) is generated from PMK using the traditional 4-way handshake protocol. To reduce the heavy load of the first stage, PMK caching can be used. If the client and AP are previously authenticated and have a PMK cache, the first heavy stage can be skipped and the cached PMK can be used to directly execute the 4-way handshake. However, PMK caching is a very primitive technology to manage shared key between a client and AP and there are many limitations; AP has to manage a stateful cache for a large number of clients, cache lifetime is limited, etc. Paired token (PT)is a new secondary credential scheme that provides stateless pre-shared key (PSK) in a client-server environment. The server issues a paired token (public token and secret token) to an authenticated client where the public token has the role of signed identity and the secret token is a kind of shared secret. Once a client is equipped with PT, it can be used for many symmetric key-based cryptographic applications such as authentication, authorization, key establishment, etc. In this paper, we apply the PT approach to WPA3 and try to replace the PMK caching with the one-time authenticated key establishment using PT. At the end of a successful full handshake, AP securely issues PT to the client. Then, in subsequent re-association requests, the client and AP can compute the same one-time authenticated PMK using PT in a stateless way. Using this kind of stateless re-association technology, AP can provide a high performance Wi-Fi service to a larger number of clients.
- Open Access
- 14 December 2020
- Published by MDPI AG in Preprints.org
Stateless Reassociation in WPA3 Using Paired Token
In WPA3 secure connection is executed in two sequential stages. Firstly, in authentication and association stage a pairwise master key (PMK) is generated. Secondly, in post-association stage a pairwise transient key (PTK) is generated from PMK using the traditional 4-way handshake protocol. To reduce the heavy computation of the first stage PMK caching can be used. If client and AP are previously authenticated and has PMK cache, client can skip the first heavy stage and reuse the cached PMK to directly execute the 4-way handshake. But PMK caching is a very primitive technology to manage shared key between client and AP and there are many limitations; AP has to manage stateful cache for multiple clients, cache lifetime is limited, etc. Paired token (PT) \cite{LZ} is a new secondary credential scheme that provides stateless pre-shared key (PSK) in client-server environment. Server issues paired token (public token and secret token) to authenticated client where public token has the role of signed identity and secret token is a kind of shared secret. Once client is equipped with PT, it can be used for many symmetric key based cryptographic applications such as authentication, authorization, key establishment, etc. In this paper we apply the PT approach to WPA3 and try to replace the PMK caching with the one-time authenticated key establishment using PT. At the end of the authentication and association stage AP securely issues PT to client. Then in reassociation stage client and AP can compute the same one-time authenticated PMK from PT in stateless way and compute PTK using the traditional 4-way handshake protocol. Using this kind of stateless reassociation technology AP can provide high performance service to huge number of clients.
- 14 December 2020
- Published by MDPI AG in Preprints.org
Open AccessStateless Reassociation in WPA3 Using Paired Token
In WPA3 secure connection is executed in two sequential stages. Firstly, in authentication and association stage a pairwise master key (PMK) is generated. Secondly, in post-association stage a pairwise transient key (PTK) is generated from PMK using the traditional 4-way handshake protocol. To reduce the heavy computation of the first stage PMK caching can be used. If client and AP are previously authenticated and has PMK cache, client can skip the first heavy stage and reuse the cached PMK to directly execute the 4-way handshake. But PMK caching is a very primitive technology to manage shared key between client and AP and there are many limitations; AP has to manage stateful cache for multiple clients, cache lifetime is limited, etc. Paired token (PT) \cite{LZ} is a new secondary credential scheme that provides stateless pre-shared key (PSK) in client-server environment. Server issues paired token (public token and secret token) to authenticated client where public token has the role of signed identity and secret token is a kind of shared secret. Once client is equipped with PT, it can be used for many symmetric key based cryptographic applications such as authentication, authorization, key establishment, etc. In this paper we apply the PT approach to WPA3 and try to replace the PMK caching with the one-time authenticated key establishment using PT. At the end of the authentication and association stage AP securely issues PT to client. Then in reassociation stage client and AP can compute the same one-time authenticated PMK from PT in stateless way and compute PTK using the traditional 4-way handshake protocol. Using this kind of stateless reassociation technology AP can provide high performance service to huge number of clients.
- 1 January 2014
- Published by INSTICC
- p. 238-243
Hybrid-Style Personal Key Management in Ubiquitous Computing
- 1 January 2014
- Published by INSTICC
- p. 238-243
Hybrid-Style Personal Key Management in Ubiquitous Computing
- 1 December 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
Practical Secret Signature Scheme with No Randomness Saving
Secret signatures, proposed by Lee \textit{et al.} \cite{LCYY07,LLK09}, provide signature privacy and public provability at the same time. Using these schemes a signer can send his signature secretly to a designated receiver such that only the designated receiver can verify the signature. Moreover, if any argument occurs between them, the validity of the secret signature can be proven publicly either by the signer or the receiver. But in these schemes one of the drawback is that the signer has to keep the random number used in the signing algorithm for later use, i.e., to provide public provability. This is very impractical in the real world, since random numbers used in many cryptographic algorithms are generally used only once and they have to be removed safely for security reason. In this paper we amend Lee \textit{et al.}'s secret signature scheme such that random number is replaced by a pseudo random number that can be computed only by the signer as a function of signer's private key and timestamp. With this change signer can compute the pseudo random number at any later time that he doesn't need to save it anymore, and it can be computed only by the signer. With this change we think that secret signature scheme becomes more practical and can be used as an important cryptographic primitive to achieve signature privacy in the real world.
- 1 December 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
Practical Secret Signature Scheme with No Randomness Saving
Secret signatures, proposed by Lee \textit{et al.} \cite{LCYY07,LLK09}, provide signature privacy and public provability at the same time. Using these schemes a signer can send his signature secretly to a designated receiver such that only the designated receiver can verify the signature. Moreover, if any argument occurs between them, the validity of the secret signature can be proven publicly either by the signer or the receiver. But in these schemes one of the drawback is that the signer has to keep the random number used in the signing algorithm for later use, i.e., to provide public provability. This is very impractical in the real world, since random numbers used in many cryptographic algorithms are generally used only once and they have to be removed safely for security reason. In this paper we amend Lee \textit{et al.}'s secret signature scheme such that random number is replaced by a pseudo random number that can be computed only by the signer as a function of signer's private key and timestamp. With this change signer can compute the pseudo random number at any later time that he doesn't need to save it anymore, and it can be computed only by the signer. With this change we think that secret signature scheme becomes more practical and can be used as an important cryptographic primitive to achieve signature privacy in the real world.
- 7 August 2011
- Published by Springer Nature in Personal and Ubiquitous Computing
- Vol. 16 (6) , 643-654
Resuscitating privacy-preserving mobile payment with customer in complete control
- 7 August 2011
- Published by Springer Nature in Personal and Ubiquitous Computing
- Vol. 16 (6) , 643-654
Resuscitating privacy-preserving mobile payment with customer in complete control
- 15 April 2011
- Published by Elsevier in Information Sciences
- Vol. 181 (8) , 1493-1502
New receipt-free voting scheme using double-trapdoor commitment
- 15 April 2011
- Published by Elsevier in Information Sciences
- Vol. 181 (8) , 1493-1502
New receipt-free voting scheme using double-trapdoor commitment
- 31 March 2011
- Published by Korea Information Processing Society in Journal of Information Processing Systems
- Vol. 7 (1) , 111-120
Security Framework for RFID-based Applications in Smart Home Environment
- 31 March 2011
- Published by Korea Information Processing Society in Journal of Information Processing Systems
- Vol. 7 (1) , 111-120
Security Framework for RFID-based Applications in Smart Home Environment
- 1 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1592, 54-61
Unified Public Key Infrastructure Supporting Both Certificate-Based and ID-Based Cryptography
Certificate-based cryptography and ID-based cryptography have been designed under different theoretical backgrounds and they have their own advantages and drawbacks, but there have been few works which try to provide them together in an efficient way. Chen et al. considered a hybrid scheme of public key infrastructure (PKI) and ID-based encryption (IBE), and also discussed various trust relationship among multiple authorities, but they have not discussed more in-depth implementation issues of the hybrid scheme. In ID-based cryptography issuing private keys to users in escrow-free way had been an important issue. Lee et al. proposed a unique private key issuing protocol in the single authority multiple-observer (SAMO) model which can reduce the user authentication load a lot, but these schemes are subject to several attacks due to the lack of verifiable authentication of protocol messages. In this paper we show that these two problems can be solved by combining certificate-based and ID-based cryptography. In the proposed scheme certificate is issued to user for user-chosen public key and ID-based private key is issued to user through a private key issuing protocol. In the private key issuing protocol user is authenticated using the certificate and protocol messages are blinded using the certified public key of the user, thus the private key issuing protocol becomes private and also verifiable,which solves the authentication problem of. We further present the concept of unified public key infrastructure (UPKI) in which both certificate-based and ID-based cryptosystems are provided to users in a single framework. We also show that if interactions between end users are mainly executed using ID-based cryptography, then end users don't need to manage other end users' certificates, which is a great efficiency gain than traditional PKI.
- 1 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1592, 54-61
Unified Public Key Infrastructure Supporting Both Certificate-Based and ID-Based Cryptography
Certificate-based cryptography and ID-based cryptography have been designed under different theoretical backgrounds and they have their own advantages and drawbacks, but there have been few works which try to provide them together in an efficient way. Chen et al. considered a hybrid scheme of public key infrastructure (PKI) and ID-based encryption (IBE), and also discussed various trust relationship among multiple authorities, but they have not discussed more in-depth implementation issues of the hybrid scheme. In ID-based cryptography issuing private keys to users in escrow-free way had been an important issue. Lee et al. proposed a unique private key issuing protocol in the single authority multiple-observer (SAMO) model which can reduce the user authentication load a lot, but these schemes are subject to several attacks due to the lack of verifiable authentication of protocol messages. In this paper we show that these two problems can be solved by combining certificate-based and ID-based cryptography. In the proposed scheme certificate is issued to user for user-chosen public key and ID-based private key is issued to user through a private key issuing protocol. In the private key issuing protocol user is authenticated using the certificate and protocol messages are blinded using the certified public key of the user, thus the private key issuing protocol becomes private and also verifiable,which solves the authentication problem of. We further present the concept of unified public key infrastructure (UPKI) in which both certificate-based and ID-based cryptosystems are provided to users in a single framework. We also show that if interactions between end users are mainly executed using ID-based cryptography, then end users don't need to manage other end users' certificates, which is a great efficiency gain than traditional PKI.
- 1 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1080-1085
Identity-Based Secret Signature Scheme
Secret signature, proposed by Lee et al. , is a new signature scheme which provides signature privacy and public provability together. Using the secret signature scheme a signer can send his signature secretly to a specific receiver such that only the designated receiver can verify the signature. If any argument occurs between them, the validity of the secret signature can be proven publicly either by the signer or the receiver. Thus it can be used as an important cryptographic primitive to implement private business transactions. In this paper we present an identity-based implementation of secret signature scheme which can enjoy the advantage of reducing key management load compared with the traditional certificate-based cryptography. We modify Cha-Cheon's ID-based signature scheme and ID-based key agreement scheme to provide public provability, and then combine them to implement ID-based secret signature (IBSS) scheme.
- 1 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1080-1085
Identity-Based Secret Signature Scheme
Secret signature, proposed by Lee et al. , is a new signature scheme which provides signature privacy and public provability together. Using the secret signature scheme a signer can send his signature secretly to a specific receiver such that only the designated receiver can verify the signature. If any argument occurs between them, the validity of the secret signature can be proven publicly either by the signer or the receiver. Thus it can be used as an important cryptographic primitive to implement private business transactions. In this paper we present an identity-based implementation of secret signature scheme which can enjoy the advantage of reducing key management load compared with the traditional certificate-based cryptography. We modify Cha-Cheon's ID-based signature scheme and ID-based key agreement scheme to provide public provability, and then combine them to implement ID-based secret signature (IBSS) scheme.