This page has only limited features, please log in for full access.

Prof. Taek-Young Youn
Department of Industrial Security, Dankook University, (16891) 655, Mabuk-dong, Giheung-gu, Yongin-si, Gyeonggi-do, Korea

Basic Info


Research Keywords & Expertise

0 Cryptography
0 Information Security
0 Security Protocols
0 Privacy & Security
0 SECURITY ALGORITHMS

Fingerprints

Cryptography
Security Protocols

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

Taek Young Youn received his BS, MS, and Ph.D from Korea University in 2003, 2005, and 2009, respectively. From 2010 to 2020, he has worked as a senior researcher at Electronics and Telecommunications Research Institute (ETRI), Korea. From 2016 to 2020, he serves as an associate professor in University of Science and Technology (UST), Korea. From 2020, he serves as an assistant professor in Dankook University, Korea. His research interests include cryptography, information security, authentication, data privacy, and security issues in various communications.

Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 13 April 2021 in Sustainability
Reads 0
Downloads 0

Since the Keccak algorithm was selected by the US National Institute of Standards and Technology (NIST) as the standard SHA-3 hash algorithm for replacing the currently used SHA-2 algorithm in 2015, various optimization methods have been studied in parallel and hardware environments. However, in a software environment, the SHA-3 algorithm is much slower than the existing SHA-2 family; therefore, the use of the SHA-3 algorithm is low in a limited environment using embedded devices such as a Wireless Sensor Networks (WSN) enviornment. In this article, we propose a software optimization method that can be used generally to break through the speed limit of SHA-3. We combine the θ, π, and ρ processes into one, reducing memory access to the internal state more efficiently than conventional software methods. In addition, we present a new SHA-3 implementation for the proposed method in the most constrained environment, the 8-bit AVR microcontroller. This new implementation method, which we call the chaining optimization methodology, implicitly performs the π process of the f-function while minimizing memory access to the internal state of SHA-3. Through this, it achieves up to 26.1% performance improvement compared to the previous implementation in an AVR microcontroller and reduces the performance gap with the SHA-2 family to the maximum. Finally, we apply our SHA-3 implementation in Hash_Deterministic Random Bit Generator (Hash_DRBG), one of the upper algorithms of a hash function, to prove the applicability of our chaining optimization methodology on 8-bit AVR MCUs.

ACS Style

Young Kim; Taek-Young Youn; Seog Seo. Chaining Optimization Methodology: A New SHA-3 Implementation on Low-End Microcontrollers. Sustainability 2021, 13, 4324 .

AMA Style

Young Kim, Taek-Young Youn, Seog Seo. Chaining Optimization Methodology: A New SHA-3 Implementation on Low-End Microcontrollers. Sustainability. 2021; 13 (8):4324.

Chicago/Turabian Style

Young Kim; Taek-Young Youn; Seog Seo. 2021. "Chaining Optimization Methodology: A New SHA-3 Implementation on Low-End Microcontrollers." Sustainability 13, no. 8: 4324.

Journal article
Published: 10 December 2020 in Sustainability
Reads 0
Downloads 0

For secure location proof in many applications, distance bounding protocols are considered as one of the useful tools that can be used in practice. In distance bounding protocols, a prover and a verifier can measure the distance between them by performing an interactive protocol. In general, the verifier is regarded as an honest service provider, and thus, an adversarial verifier is not considered for security analysis. However, we cannot ignore the possibility of the corruption of the verifier, which can spoil the prover’s privacy. To handle the security problem, a prover-anonymous and deniable distance bounding protocol is proposed, which can guarantee the privacy of the prover even though the verifier is corrupted. In this paper, we review the prover-anonymous and deniable distance bounding protocol in terms of the membership management, and we show that the communication overhead in the protocol for each membership change is O(n) where n is the number of users. Then, we propose an improved membership management technique, which can efficiently support membership change in terms of the communication overhead. The improved technique requires O(1) for each membership change instead of O(n), as in the existing protocol.

ACS Style

Nam-Su Jho; Taek-Young Youn. Dynamic Membership Management in Anonymous and Deniable Distance Bounding. Sustainability 2020, 12, 10330 .

AMA Style

Nam-Su Jho, Taek-Young Youn. Dynamic Membership Management in Anonymous and Deniable Distance Bounding. Sustainability. 2020; 12 (24):10330.

Chicago/Turabian Style

Nam-Su Jho; Taek-Young Youn. 2020. "Dynamic Membership Management in Anonymous and Deniable Distance Bounding." Sustainability 12, no. 24: 10330.

Journal article
Published: 09 November 2020 in IEEE Access
Reads 0
Downloads 0

To keep the Internet-of-things (IoT) environment secure, employing a cryptographic function to various IoT devices has become vital. An important factor to consider is how to store a cryptographic key (or passwords) securely. A popular method is to store the key in the storage protected by some hardware-based security functions. This paper presents a novel concept to conceal cryptographic keys into deep neural networks (DNNs), named DNNs-based key concealment scheme. In this scheme, a key can be concealed into a proper deep neural network model which is trained with secret input data. We demonstrate the practical applicability of our concept by presenting an instance and a use-case scenario of the DNNs-based key concealment scheme and show its correctness. To prove its robustness, two fundamental security evaluation methods are proposed for investigating the security of the instantiation. To the best of our knowledge, this is the first attempt of its kind.

ACS Style

Taehyuk Kim; Taek Young Youn; Dooho Choi. Deep Neural Networks Based Key Concealment Scheme. IEEE Access 2020, 8, 204214 -204225.

AMA Style

Taehyuk Kim, Taek Young Youn, Dooho Choi. Deep Neural Networks Based Key Concealment Scheme. IEEE Access. 2020; 8 ():204214-204225.

Chicago/Turabian Style

Taehyuk Kim; Taek Young Youn; Dooho Choi. 2020. "Deep Neural Networks Based Key Concealment Scheme." IEEE Access 8, no. : 204214-204225.

Journal article
Published: 21 October 2020 in Sustainability
Reads 0
Downloads 0

Content-Centric Networking (CCN) is one of the emerging paradigms for the future Internet, which shifts the communication paradigm from host-centric to data-centric. In CCN, contents are delivered by their unique names, and a public-key-based signature is built into data packets to verify the authenticity and integrity of the contents. To date, research has tried to accelerate the validation of the given data packets, but existing techniques were designed to improve the performance of content verification from the requester’s viewpoint. However, we need to efficiently verify the validity of data packets in each forwarding engine, since the transmission of invalid packets influences not only security but also performance, which can lead to a DDoS (Distributed Denial of Service) attack on CCN. For example, an adversary can inject a number of meaningless packets into CCN to consume the forwarding engines’ cache and network bandwidth. In this paper, a novel authentication architecture is introduced, which can support faster forwarding by accelerating the performance of data validation in forwarding engines. Since all forwarding engines verify data packets, our authentication architecture can eliminate invalid packets before they are injected into other CCN nodes. The architecture utilizes public-key based authentication algorithms to support public verifiability and non-repudiation, but a novel technique is proposed in this paper to reduce the overhead from using PKI for verifying public keys used by forwarding engines and end-users in the architecture. The main merit of this work is in improving the performance of data-forwarding in CCN regardless of the underlying public-key validation mechanism, such as PKI, by reducing the number of accesses to the mechanism. Differently from existing approaches that forgive some useful features of the Naive CCN for higher performance, the proposed technique is the only architecture which can support all useful features given by the Naive CCN.

ACS Style

Taek-Young Youn; Joongheon Kim; David Mohaisen; Seog Seo. Faster Data Forwarding in Content-Centric Network via Overlaid Packet Authentication Architecture. Sustainability 2020, 12, 8746 .

AMA Style

Taek-Young Youn, Joongheon Kim, David Mohaisen, Seog Seo. Faster Data Forwarding in Content-Centric Network via Overlaid Packet Authentication Architecture. Sustainability. 2020; 12 (20):8746.

Chicago/Turabian Style

Taek-Young Youn; Joongheon Kim; David Mohaisen; Seog Seo. 2020. "Faster Data Forwarding in Content-Centric Network via Overlaid Packet Authentication Architecture." Sustainability 12, no. 20: 8746.

Journal article
Published: 02 June 2020 in Sensors
Reads 0
Downloads 0

Currently, “connected cars” are being actively designed over smart cars and autonomous cars, to establish a two-way communication network between the vehicle and all infrastructure. Additionally, because vehicle black boxes are becoming more common, specific processes for secure and efficient data sharing and transaction via vehicle networks must be developed. In this paper, we propose a Blockchain-based vehicle data marketplace platform model, along with a data sharing scheme, using Blockchain-based data-owner-based attribute-based encryption (DO-ABE). The proposed model achieves the basic requirements such as data confidentiality, integrity, and privacy. The proposed system securely and effectively handles large-capacity and privacy-sensitive black box video data by storing the metadata on Blockchain (on-chain) and encrypted raw data on off-chain (external) storage, and adopting consortium Blockchain. Furthermore, the data owners of the proposed model can control their own data by applying the Blockchain-based DO-ABE and owner-defined access control lists.

ACS Style

Byeong-Gyu Jeong; Taek-Young Youn; Nam-Su Jho; Sang Uk Shin; Taek-Young Youn. Blockchain-Based Data Sharing and Trading Model for the Connected Car. Sensors 2020, 20, 3141 .

AMA Style

Byeong-Gyu Jeong, Taek-Young Youn, Nam-Su Jho, Sang Uk Shin, Taek-Young Youn. Blockchain-Based Data Sharing and Trading Model for the Connected Car. Sensors. 2020; 20 (11):3141.

Chicago/Turabian Style

Byeong-Gyu Jeong; Taek-Young Youn; Nam-Su Jho; Sang Uk Shin; Taek-Young Youn. 2020. "Blockchain-Based Data Sharing and Trading Model for the Connected Car." Sensors 20, no. 11: 3141.

Journal article
Published: 29 May 2020 in Energies
Reads 0
Downloads 0

Deduplication of encrypted data is a significant function for both the privacy of stored data and efficient storage management. Several deduplication techniques have been designed to provide improved security or efficiency. In this study, we focus on the client-side deduplication technique, which has more advantages than the server-side deduplication technique, particularly in communication overhead, owing to conditional data transmissions. From a security perspective, poison, dictionary, and identification attacks are considered as threats against client-side deduplication. Unfortunately, in contrast to other attacks, identification attacks and the corresponding countermeasures have not been studied in depth. In identification attacks, an adversary tries to identify the existence of a specific file. Identification attacks should be countered because adversaries can use the attacks to break the privacy of the data owner. Therefore, in the literature, some counter-based countermeasures have been proposed as temporary remedies for such attacks. In this paper, we present an analysis of the security features of deduplication techniques against identification attacks and show that the lack of security of the techniques can be eliminated by providing uncertainness to the conditional responses in the deduplication protocol, which are based on the existence of files. We also present a concrete countermeasure, called the time-locked deduplication technique, which can provide uncertainness to the conditional responses by withholding the operation of the deduplication functionality until a predefined time. An additional cost for locking is incurred only when the file to be stored does not already exist in the server’s storage. Therefore, our technique can improve the security of client-side deduplication against identification attacks at almost the same cost as existing techniques, except in the case of files uploaded for the first time.

ACS Style

Taek-Young Youn; Nam-Su Jho; Keonwoo Kim; Ku-Young Chang; Ki-Woong Park; Taek-Young Youn. Locked Deduplication of Encrypted Data to Counter Identification Attacks in Cloud Storage Platforms. Energies 2020, 13, 2742 .

AMA Style

Taek-Young Youn, Nam-Su Jho, Keonwoo Kim, Ku-Young Chang, Ki-Woong Park, Taek-Young Youn. Locked Deduplication of Encrypted Data to Counter Identification Attacks in Cloud Storage Platforms. Energies. 2020; 13 (11):2742.

Chicago/Turabian Style

Taek-Young Youn; Nam-Su Jho; Keonwoo Kim; Ku-Young Chang; Ki-Woong Park; Taek-Young Youn. 2020. "Locked Deduplication of Encrypted Data to Counter Identification Attacks in Cloud Storage Platforms." Energies 13, no. 11: 2742.

Journal article
Published: 04 May 2020 in IEEE Access
Reads 0
Downloads 0

Recently, Various security techniques are developed to provide security for In-vehicle CAN, but the limited characteristics of CAN protocol make it hard to apply them to a real vehicle. In this paper, we propose a sender authentication and key management schemes considering the limitations of In-vehicle CAN. Our proposed security scheme is designed considering the computing power of automotive ECU and the limited-size CAN data frame. Further, we suggest an efficient key management scheme causing no communication overhead in a session key update process. The security scheme has a structure that may be implemented without change of CAN standards. To evaluate the performance and security of the proposed scheme, we conduct hardware and network simulator based evaluation. Finally, through the analysis on the security and performance, we prove that our proposed scheme is suitable for solving the problem of In-vehicle CAN authentication.

ACS Style

Taek-Young Youn; YouSik Lee; Samuel Woo. Practical Sender Authentication Scheme for In-Vehicle CAN With Efficient Key Management. IEEE Access 2020, 8, 86836 -86849.

AMA Style

Taek-Young Youn, YouSik Lee, Samuel Woo. Practical Sender Authentication Scheme for In-Vehicle CAN With Efficient Key Management. IEEE Access. 2020; 8 (99):86836-86849.

Chicago/Turabian Style

Taek-Young Youn; YouSik Lee; Samuel Woo. 2020. "Practical Sender Authentication Scheme for In-Vehicle CAN With Efficient Key Management." IEEE Access 8, no. 99: 86836-86849.

Journal article
Published: 31 March 2020 in KSII Transactions on Internet and Information Systems
Reads 0
Downloads 0

KSII Transactions on Internet and Information Systems TIIS Paper Details

ACS Style

Taek-Young Youn; Nam-Su Jho. Trapdoor Digital Shredder: A New Technique for Improved Data Security without Cryptographic Encryption. KSII Transactions on Internet and Information Systems 2020, 14, 1249 -1262.

AMA Style

Taek-Young Youn, Nam-Su Jho. Trapdoor Digital Shredder: A New Technique for Improved Data Security without Cryptographic Encryption. KSII Transactions on Internet and Information Systems. 2020; 14 (3):1249-1262.

Chicago/Turabian Style

Taek-Young Youn; Nam-Su Jho. 2020. "Trapdoor Digital Shredder: A New Technique for Improved Data Security without Cryptographic Encryption." KSII Transactions on Internet and Information Systems 14, no. 3: 1249-1262.

Conference paper
Published: 25 January 2020 in Transactions on Petri Nets and Other Models of Concurrency XV
Reads 0
Downloads 0

The use of cryptographic functions has become vital for various devices, such as PCs, smart phones, drones, and smart appliances; however, the secure storage of cryptographic keys (or passwords) is a major issue. One way to securely store such a key is to register the key using secret data such as biometric data and then regenerate the key whenever it is needed. In this paper, we present a novel methodology for hiding cryptographic keys inside a deep neural network (DNN), and is termed as the DNN-based key hiding scheme. In this method, DNNs are constructed and trained with noisy data to hide the key within the network. To prove that our methodology works in practice, we propose an example of the DNN-based key hiding scheme and prove its correctness. For its robustness, we propose two basic security analysis tools to be able to check the example’s security. To the best of our knowledge, this is the first attempt of its kind.

ACS Style

Taehyuk Kim; Taek-Young Youn; Dooho Choi. Is It Possible to Hide My Key into Deep Neural Network? Transactions on Petri Nets and Other Models of Concurrency XV 2020, 259 -272.

AMA Style

Taehyuk Kim, Taek-Young Youn, Dooho Choi. Is It Possible to Hide My Key into Deep Neural Network? Transactions on Petri Nets and Other Models of Concurrency XV. 2020; ():259-272.

Chicago/Turabian Style

Taehyuk Kim; Taek-Young Youn; Dooho Choi. 2020. "Is It Possible to Hide My Key into Deep Neural Network?" Transactions on Petri Nets and Other Models of Concurrency XV , no. : 259-272.

Journal article
Published: 16 December 2019 in Information Sciences
Reads 0
Downloads 0

Public key encryption with equality test (PKEET) is a cryptosystem that allows a tester who has trapdoors issued by one or more users Ui to perform equality tests on ciphertexts encrypted using public key(s) of Ui. Since this feature has a lot of practical applications including search on encrypted data, several PKEET schemes have been proposed so far. However, to the best of our knowledge, all the existing proposals are proven secure only under the hardness of number-theoretic problems and/or the random oracle heuristics. In this paper, we show that this primitive can be achieved not only generically from well-established other primitives but also even without relying on the random oracle heuristics. More precisely, our generic construction for PKEET employs a two-level hierarchical identity-based encryption scheme, which is selectively secure against chosen plaintext attacks, a strongly unforgeable one-time signature scheme and a cryptographic hash function. Our generic approach toward PKEET has several advantages over all the previous works; it directly leads the first standard model construction and also directly implies the first lattice-based construction. Finally, we show how to extend our approach to the identity-based setting.

ACS Style

Hyung Tae Lee; San Ling; Jae Hong Seo; Huaxiong Wang; Taek-Young Youn; Taek-Young Youn. Public key encryption with equality test in the standard model. Information Sciences 2019, 516, 89 -108.

AMA Style

Hyung Tae Lee, San Ling, Jae Hong Seo, Huaxiong Wang, Taek-Young Youn, Taek-Young Youn. Public key encryption with equality test in the standard model. Information Sciences. 2019; 516 ():89-108.

Chicago/Turabian Style

Hyung Tae Lee; San Ling; Jae Hong Seo; Huaxiong Wang; Taek-Young Youn; Taek-Young Youn. 2019. "Public key encryption with equality test in the standard model." Information Sciences 516, no. : 89-108.

Research article
Published: 16 May 2019 in Wireless Communications and Mobile Computing
Reads 0
Downloads 0

Unmanned aerial vehicles (UAVs) play an increasingly core role in modern warfare, with powerful but tiny embedded computing systems actively applied in the military field. Confidential data, such as military secrets, may be stored inside military devices such as UAVs, and the capture or loss of such data could cause significant damage to national security. Therefore, the development of securely verifiable remote erasure techniques for military devices is considered a core technology. In this study, we devised a verifiable remote erasure scheme with a countdown-concept using randomized data synchronization to satisfy securely verifiable remote erasure technology. The scheme allows the GCS (Ground Control Station) to remotely erase data stored in the UAV, even on loss of communication, and returns proof of erasure to GCS after erasure. Our approach classifies the accumulated data stored in the UAV as a new data type and applies the characteristics of that data type to generate the proof of erasure. We select a small-volume data sample (rather than all of the data) and perform prior learning only on that sample; in this way, we can obtain the probative power of the evidence of erasure with a relatively small amount of traffic. When we want to erase data of 100 Mbytes of remote device, 100 Mbytes of data transfer is required for related work, whereas our system has data transfer according to the ratio of amount of randomly selected data. By doing this, communication stability can be acquired even in unstable communication situations where the maximum traffic can change or not be predicted. Furthermore, when the UAV sends the proof of erasure to the GCS, the UAV does its best to perform the erasure operation given its situation.

ACS Style

Sieun Kim; Taek-Young Youn; Daeseon Choi; Ki-Woong Park. UAV-Undertaker: Securely Verifiable Remote Erasure Scheme with a Countdown-Concept for UAV via Randomized Data Synchronization. Wireless Communications and Mobile Computing 2019, 2019, 1 -11.

AMA Style

Sieun Kim, Taek-Young Youn, Daeseon Choi, Ki-Woong Park. UAV-Undertaker: Securely Verifiable Remote Erasure Scheme with a Countdown-Concept for UAV via Randomized Data Synchronization. Wireless Communications and Mobile Computing. 2019; 2019 ():1-11.

Chicago/Turabian Style

Sieun Kim; Taek-Young Youn; Daeseon Choi; Ki-Woong Park. 2019. "UAV-Undertaker: Securely Verifiable Remote Erasure Scheme with a Countdown-Concept for UAV via Randomized Data Synchronization." Wireless Communications and Mobile Computing 2019, no. : 1-11.

Research article
Published: 15 May 2019 in Wireless Communications and Mobile Computing
Reads 0
Downloads 0

Since deduplication inevitably implies data sharing, control over access permissions in an encrypted deduplication storage is more important than a traditional encrypted storage. Therefore, in terms of flexibility, data deduplication should be combined with data access control techniques. In this paper, we propose an authorized deduplication scheme using CP-ABE to solve this problem. The proposed scheme provides client-side deduplication while providing confidentiality through client-side encryption to prevent exposure of users’ sensitive data on untrusted cloud servers. Also, unlike existing convergent encryption schemes, it provides authorized convergent encryption by using CP-ABE to allow only authorized users to access critical data. The proposed authorized deduplication scheme provides an adequate trade-off between storage space efficiency and security in cloud environment and is very suitable for the hybrid cloud model considering both the data security and the storage efficiency in a business environment.

ACS Style

Taek-Young Youn; Nam-Su Jho; Kyung Hyune Rhee; Sang Uk Shin. Authorized Client-Side Deduplication Using CP-ABE in Cloud Storage. Wireless Communications and Mobile Computing 2019, 2019, 1 -11.

AMA Style

Taek-Young Youn, Nam-Su Jho, Kyung Hyune Rhee, Sang Uk Shin. Authorized Client-Side Deduplication Using CP-ABE in Cloud Storage. Wireless Communications and Mobile Computing. 2019; 2019 ():1-11.

Chicago/Turabian Style

Taek-Young Youn; Nam-Su Jho; Kyung Hyune Rhee; Sang Uk Shin. 2019. "Authorized Client-Side Deduplication Using CP-ABE in Cloud Storage." Wireless Communications and Mobile Computing 2019, no. : 1-11.

Journal article
Published: 31 January 2019 in IEEE Access
Reads 0
Downloads 0

New vehicles have become increasingly targeted for cyber-attacks as their rate of digitalization is accelerated. Research on vehicle hacking has highlighted security vulnerabilities of in-vehicle Controller Area Networks (CANs) as the biggest problem. In particular, a CAN does not offer access control, authentication, or confidentiality, so it fails to prevent reconnaissance operations conducted by an adversary. Because its static configuration (CAN ID, data frame transmission cycle, and data field format) is used in an in-vehicle network environment, the adversary can conduct reconnaissance and easily acquire information to be used for an attack. One of the Moving Target Defense (MTD) strategies, Network Address Shuffling (NAS),is an extremely practical security solution that can prevent in-vehicle CAN reconnaissance acts. In this paper, we propose a CAN ID shuffling technique using NAS. Our proposed security solution aims to increase the cost burden for the adversary to analyze CAN data frames. To evaluate the performance of the proposed security solution, we conducted an evaluation based on a labcar. Our proposed security solution may be implemented without altering the unique characteristics of the CAN standard. Hence, it can be used as a practical countermeasure to solve the problems affecting in-vehicle CANs.

ACS Style

Samuel Woo; Daesung Moon; Taek-Young Youn; YouSik Lee; Yongeun Kim. CAN ID Shuffling Technique (CIST): Moving Target Defense Strategy for Protecting In-Vehicle CAN. IEEE Access 2019, 7, 15521 -15536.

AMA Style

Samuel Woo, Daesung Moon, Taek-Young Youn, YouSik Lee, Yongeun Kim. CAN ID Shuffling Technique (CIST): Moving Target Defense Strategy for Protecting In-Vehicle CAN. IEEE Access. 2019; 7 (99):15521-15536.

Chicago/Turabian Style

Samuel Woo; Daesung Moon; Taek-Young Youn; YouSik Lee; Yongeun Kim. 2019. "CAN ID Shuffling Technique (CIST): Moving Target Defense Strategy for Protecting In-Vehicle CAN." IEEE Access 7, no. 99: 15521-15536.

Journal article
Published: 22 October 2018 in Sensors
Reads 0
Downloads 0

Internet of Things (IoT)-based devices, especially those used for home automation, consist of their own sensors and generate many logs during a process. Enterprises producing IoT devices convert these log data into more useful data through secondary processing; thus, they require data from the device users. Recently, a platform for data sharing has been developed because the demand for IoT data increases. Several IoT data marketplaces are based on peer-to-peer (P2P) networks, and in this type of marketplace, it is difficult for an enterprise to trust a data owner or the data they want to trade. Therefore, in this study, we propose a review system that can confirm the reputation of a data owner or the data traded in the P2P data marketplace. The traditional server-client review systems have many drawbacks, such as security vulnerability or server administrator’s malicious behavior. However, the review system developed in this study is based on Ethereum smart contracts; thus, this system is running on the P2P network and is more flexible for the network problem. Moreover, the integrity and immutability of the registered reviews are assured because of the blockchain public ledger. In addition, a certain amount of gas is essential for all functions to be processed by Ethereum transactions. Accordingly, we tested and analyzed the performance of our proposed model in terms of gas required.

ACS Style

Ji-Sun Park; Taek-Young Youn; Hye-Bin Kim; Kyung-Hyune Rhee; Sang-Uk Shin; Taek-Young Youn. Smart Contract-Based Review System for an IoT Data Marketplace. Sensors 2018, 18, 3577 .

AMA Style

Ji-Sun Park, Taek-Young Youn, Hye-Bin Kim, Kyung-Hyune Rhee, Sang-Uk Shin, Taek-Young Youn. Smart Contract-Based Review System for an IoT Data Marketplace. Sensors. 2018; 18 (10):3577.

Chicago/Turabian Style

Ji-Sun Park; Taek-Young Youn; Hye-Bin Kim; Kyung-Hyune Rhee; Sang-Uk Shin; Taek-Young Youn. 2018. "Smart Contract-Based Review System for an IoT Data Marketplace." Sensors 18, no. 10: 3577.

Conference paper
Published: 01 October 2018 in 2018 International Conference on Information and Communication Technology Convergence (ICTC)
Reads 0
Downloads 0

In this paper, we propose a PDP scheme supporting dynamic data and guarantees the integrity of stored data against malicious servers and clients. To design the scheme, we firstly design a new authenticated data structure so-called Stateful Rank based Skip List which reflects the latest version of stored data. Based on the data structure, we design a non-repudiable dynamic PDP which permits servers and clients to manage the version of stored data in an authenticated and non-repudiable way, so that our scheme prevents malicious servers and clients from cheating the latest version of the stored data.

ACS Style

Minseok Lee; Doo Ho Choi; Taek-Young Youn. Non-Repudiable Dynamic PDP with Stronger Security based on Stateful Rank Based Skip List. 2018 International Conference on Information and Communication Technology Convergence (ICTC) 2018, 836 -841.

AMA Style

Minseok Lee, Doo Ho Choi, Taek-Young Youn. Non-Repudiable Dynamic PDP with Stronger Security based on Stateful Rank Based Skip List. 2018 International Conference on Information and Communication Technology Convergence (ICTC). 2018; ():836-841.

Chicago/Turabian Style

Minseok Lee; Doo Ho Choi; Taek-Young Youn. 2018. "Non-Repudiable Dynamic PDP with Stronger Security based on Stateful Rank Based Skip List." 2018 International Conference on Information and Communication Technology Convergence (ICTC) , no. : 836-841.

Research article
Published: 04 July 2018 in Security and Communication Networks
Reads 0
Downloads 0

Content-Centric Networking (CCN) is a new networking paradigm for the future Internet, which shifts the communication paradigm from host-centric to data-centric. In CCN, contents are routed by their unique names and they are stored in network nodes by units of segment during transmission for future usage. Since contents are stored in network nodes in a distributed manner, security is built into CCN data packets by embedding a public key signature to enable any content requesters to verify authenticity and integrity of contents. However, the use of public key signatures for authenticating CCN data packets incurs significant overhead regarding computation and communication, which limits universal utilization of CCN. Furthermore, this can lead to a new kind of DDoS attacks. Even though CCN adopts an aggregate signature method based on Merkle Hash Tree (MHT) in its reference implementation, it still incurs large amount of overhead. This paper presents TLDA, an efficient Two-Layered Data Authentication mechanism, which can considerably reduce overhead of computation and communication for authenticating data segments in CCN. For efficiency of computation and communication, TLDA newly introduces the concept of authentication Meta part consisting of data segments’ hash values. To a great extent TLDA not only reduces the computation and communication overhead compared with CCN’s basic authentication method, but also provides robustness against transmission loss and out-of-order transmission. We have implemented TLDA and demonstrated that it provides 74.3% improved throughput and 36.557% reduced communication overhead compared to those of the original CCNx library developed by PARC when transmitting a 128Mbyte content in units of 1Kbyte segment with RSA-2048 and SHA-256 as its signature algorithm and hash algorithm, respectively.

ACS Style

Seog Chung Seo; Taek-Young Youn. TLDA: An Efficient Two-Layered Data Authentication Mechanism for Content-Centric Networking. Security and Communication Networks 2018, 2018, 1 -17.

AMA Style

Seog Chung Seo, Taek-Young Youn. TLDA: An Efficient Two-Layered Data Authentication Mechanism for Content-Centric Networking. Security and Communication Networks. 2018; 2018 ():1-17.

Chicago/Turabian Style

Seog Chung Seo; Taek-Young Youn. 2018. "TLDA: An Efficient Two-Layered Data Authentication Mechanism for Content-Centric Networking." Security and Communication Networks 2018, no. : 1-17.

Journal article
Published: 30 June 2018 in KSII Transactions on Internet and Information Systems
Reads 0
Downloads 0
ACS Style

Seog Chung Seo; Taek-Young Youn. TIM: A Trapdoor Hash Function-based Authentication Mechanism for Streaming Applications. KSII Transactions on Internet and Information Systems 2018, 12, 2922 -2945.

AMA Style

Seog Chung Seo, Taek-Young Youn. TIM: A Trapdoor Hash Function-based Authentication Mechanism for Streaming Applications. KSII Transactions on Internet and Information Systems. 2018; 12 (6):2922-2945.

Chicago/Turabian Style

Seog Chung Seo; Taek-Young Youn. 2018. "TIM: A Trapdoor Hash Function-based Authentication Mechanism for Streaming Applications." KSII Transactions on Internet and Information Systems 12, no. 6: 2922-2945.

Journal article
Published: 15 May 2018 in IEEE Access
Reads 0
Downloads 0

At present, there is a considerable increase in the amount of data stored in storage services, along with dramatic evolution of networking techniques. In storage services with huge data, the storage servers may want to reduce the volume of stored data, and the clients may want to monitor the integrity of their data with a low cost, since the cost of the functions related to data storage increase in proportion to the size of the data. To achieve these goals, secure deduplication and integrity auditing delegation techniques have been studied, which can reduce the volume of data stored in storage by eliminating duplicated copies and permit clients to efficiently verify the integrity of stored files by delegating costly operations to a trusted party, respectively. So far many studies have been conducted on each topic, separately, whereas relatively few combined schemes, which support the two functions simultaneously, have been researched. In this paper, we design a combined technique, which performs both secure deduplication of encrypted data and public integrity auditing of data. To support the two functions, the proposed scheme performs challenge-response protocols using the BLS signature-based homomorphic linear authenticator. We utilize a third party auditor for performing public audit, in order to help low-powered clients. The proposed scheme satisfies all the fundamental security requirements. We also propose two variances that provide higher security and better performance.

ACS Style

Taek-Young Youn; Ku-Young Chang; Kyung Hyune Rhee; Sang Uk Shin. Efficient Client-Side Deduplication of Encrypted Data With Public Auditing in Cloud Storage. IEEE Access 2018, 6, 26578 -26587.

AMA Style

Taek-Young Youn, Ku-Young Chang, Kyung Hyune Rhee, Sang Uk Shin. Efficient Client-Side Deduplication of Encrypted Data With Public Auditing in Cloud Storage. IEEE Access. 2018; 6 ():26578-26587.

Chicago/Turabian Style

Taek-Young Youn; Ku-Young Chang; Kyung Hyune Rhee; Sang Uk Shin. 2018. "Efficient Client-Side Deduplication of Encrypted Data With Public Auditing in Cloud Storage." IEEE Access 6, no. : 26578-26587.

Conference paper
Published: 20 December 2017 in Lecture Notes in Electrical Engineering
Reads 0
Downloads 0

The Proof of Retrievability (PoR) is a useful tool for securing data by monitoring the retrievability of a file stored in remote servers. But they are not secure if the full data stored in the storage server is attacked. HAIL has been proposed to solve this problem. It enables a client to verify that files stored in independent storage servers are intact and retrievable. If some servers are attacked, a client can reconstruct the original data using the data stored in remaining servers. Unfortunately, in HAIL, expensive redistribution costs occur if we need to reconstruct the original data, which was not considered in existing works. In this paper, we propose a solution for reducing redistribution costs by grouping file segments and applying HAIL to each group. It is unnecessary for clients to download all files in all servers when some files stored in a specific server are corrupted. Finally, we analyze the performance of our scheme.

ACS Style

Taehyuk Kim; Minseok Lee; Doo Ho Choi; Taek-Young Youn. A Solution for Reducing Redistribution Costs of HAIL. Lecture Notes in Electrical Engineering 2017, 973 -978.

AMA Style

Taehyuk Kim, Minseok Lee, Doo Ho Choi, Taek-Young Youn. A Solution for Reducing Redistribution Costs of HAIL. Lecture Notes in Electrical Engineering. 2017; ():973-978.

Chicago/Turabian Style

Taehyuk Kim; Minseok Lee; Doo Ho Choi; Taek-Young Youn. 2017. "A Solution for Reducing Redistribution Costs of HAIL." Lecture Notes in Electrical Engineering , no. : 973-978.

Conference paper
Published: 20 December 2017 in Lecture Notes in Electrical Engineering
Reads 0
Downloads 0

Until now, online services including storage services have revealed their clients’ private information in various ways. Regardless of the reason of exposure, the damage caused by such accident is very serious. To support user-specific services, service providers maintain user-related information and the information can be harmful for the privacy of clients when the information is revealed to an adversary. To get rid of the source of the problem, in this work, we will introduce a new technique which permits service providers to support their clients without maintaining user-related information. The basic idea of our work to support the service provider has a set of parameters which are used for verifying the proof generated by a client as an evidence of his right regarding a service. To embody the idea, we will use a group signature scheme which is widely used as a tool for verifying someone’s membership instead of his specific identity. For the security of our scheme, we give provable security of our scheme under formal security models.

ACS Style

Taek-Young Youn; Ku-Young Chang. New User Management Technique in Storage Services for Stronger Privacy. Lecture Notes in Electrical Engineering 2017, 979 -984.

AMA Style

Taek-Young Youn, Ku-Young Chang. New User Management Technique in Storage Services for Stronger Privacy. Lecture Notes in Electrical Engineering. 2017; ():979-984.

Chicago/Turabian Style

Taek-Young Youn; Ku-Young Chang. 2017. "New User Management Technique in Storage Services for Stronger Privacy." Lecture Notes in Electrical Engineering , no. : 979-984.