Yu‐Chi Chen

National Taiwan University of Science and Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Raylin Tso

National Chengchi University

Gwoboa Horng

National Chung Hsing University

Huei‐Tse Hou

Anhui University

Masahiro Mambo

Kanazawa University

Xin Xie

Yuan Ze University

Ziyuan Liu

Huawei German Research Center

Chih-Wei Shiu

National Yunlin University of Science and Technology

Yi‐Fan Tseng

National Chengchi University

Kaibin Huang

National Chengchi University

Du-Shiau Tsai

Hsiuping University of Science and Technology

Cooperative Institutions

Chang Gung University

Chang Gung Memorial Hospital

National Taiwan University

Memorial Hospital of South Bend

Linkou Chang Gung Memorial Hospital

National Yang Ming Chiao Tung University

National Cheng Kung University

National Taiwan University of Science and Technology

Kaohsiung Chang Gung Memorial Hospital

Taiwan Semiconductor Manufacturing Company (Taiwan)

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Preparation of styrene-γ-methacryloxypropyltrimethoxysilane/Pd nanoparticles as ink for ink-jet printing technology and electroless nickel plating on glass

Journal of the Taiwan Institute of Chemical Engineers (2016)

Yan-Yu Nian Meng-Jey Youh Chang-Pin Chang Yu‐Chi Chen Ming-Der Ger

Potassium persulfate

Electroless nickel plating

Plating (geology)

10.1016/j.jtice.2016.08.034

Cite

Citations (6)

SPEKS: Secure Server-Designation Public Key Encryption with Keyword Search against Keyword Guessing Attacks

The Computer Journal (2014)

Yu‐Chi Chen

Journal Article SPEKS: Secure Server-Designation Public Key Encryption with Keyword Search against Keyword Guessing Attacks Get access Yu-Chi Chen Yu-Chi Chen * Institute of Information Science, Academia Sinica, Taipei, Taiwan *Corresponding author: wycchen@ieee.org Search for other works by this author on: Oxford Academic Google Scholar The Computer Journal, Volume 58, Issue 4, April 2015, Pages 922–933, https://doi.org/10.1093/comjnl/bxu013 Published: 05 March 2014 Article history Received: 19 July 2013 Revision received: 04 February 2014 Published: 05 March 2014

Chen

10.1093/comjnl/bxu013

Cite

Citations (45)

POSTER: Oblivious Access System on Decentralized Database over Parallel Smart Contract Model

Zhongyi Guo Yu‐Chi Chen Hsiu‐Ping Lin

Data stored on centralized cloud servers may have some risks. Moreover, it may leak the data access pattern when accessing data on cloud servers. Oblivious RAM (ORAM) is a candidate solution to hide the data access pattern, but it inherently induces some overheads of accessing data. In this paper, we address the issues above, and propose the oblivious access system on decentralized database over parallel smart contract model. The proposed system can slightly reduce the overhead of ORAM and overcome the problem from centralized servers. The main techniques are to use parallel smart contract model to improve the performance of smart contract execution and garbled circuit to reduce the cost of communication.

Data access

Distributed database

Smart contract

10.1145/3320269.3405436

Cite

Citations (0)

Protecting high-dimensional entanglement from decoherence via quantum weak measurement and reversal

Modern Physics Letters A (2022)

Kun-Hong Feng Yu‐Chi Chen Ping Zhou

High-dimensional quantum communication plays an important role in long-distance quantum communication. It is shown that two-qubit quantum entanglement can be protected from amplitude damping decoherence. We study the effect of amplitude damping decoherence on two-qubit high-dimensional quantum entanglement. The negativity for high-dimensional quantum entanglement with or without quantum weak measurement and the reversal in amplitude damping decoherence are presented. We found that nonmaximally entangled state may have better performance than maximally entangled state in amplitude damping decoherence. Moreover, we show that arbitrary high-dimensional quantum entanglement can be protected from amplitude damping decoherence by weak measurement and the reversal. The results of our protocol are in agreement with previous analysis for the case of qubits and qutrits.

Amplitude damping channel

Weak measurement

Quantum teleportation

10.1142/s0217732322501176

Cite

Citations (8)

Quantum‐resistant anonymous identity‐based encryption with trable identities

IET Information Security (2021)

Ziyuan Liu Yi‐Fan Tseng Raylin Tso Masahiro Mambo Yu‐Chi Chen

Identity-based encryption (IBE), introduced by Shamir, eliminates the need for public-key infrastructure. The sender can simply encrypt a message by using the recipient's identity (such as email or IP address) without needing to look up the public key. In particular, when ciphertexts of an IBE do not reveal recipient's identity, this scheme is known as an anonymous IBE scheme. Recently, Blazy et al. (ARES '19) analysed the trade-off between public safety and unconditional privacy in anonymous IBE and introduced a new notion that incorporates traceability into anonymous IBE, called anonymous IBE with traceable identities (AIBET). However, their construction is based on the discrete logarithm assumption, which is insecure in the quantum era. In this paper, we first formalize the consistency of tracing key of the AIBET scheme to ensure that a ciphertext cannot be traced with the use of wrong tracing keys. Subsequently, we present a generic formulation concept that can be used to transform structure-specific lattice-based anonymous IBE schemes into an AIBET. Finally, we apply this concept to Katsumata and Yamada's compact anonymous IBE scheme (Asiacrypt '16) to obtain the first quantum-resistant AIBET scheme that is adaptively secure under the ring learning with errors assumption without random oracle.

Random oracle

Learning with errors

Discrete logarithm

Communication source

10.1049/ise2.12049

Cite

Citations (4)

On the Security of a Cheating Immune Visual Secret Sharing Scheme.

IACR Cryptology ePrint Archive (2011)

Yu‐Chi Chen Du-Shiau Tsai Gwoboa Horng

Visual Secret Sharing (VSS), first invented by Naor and Shamir, is a variant of secret sharing. In the literature, VSS schemes have many applications, including visual authentication and identification, steganography, and image encryption. Moreover, VSS schemes provide the secure services in communications. In 2010, De Prisco and De Santis deeply discussed the problem of cheating in VSS, gave the definition for deterministic cheating, and presented two cheating immune visual secret sharing schemes: 1) the simple scheme 2) the better scheme. However, we discover that the better scheme is not immune as they claimed. In this paper, we analyze this scheme is prone to deterministic cheating in theory and practice. Keyword: Visual Cryptography; Visual Secret Sharing; Cheating; Cheating Prevention; Cheating Immune Scheme

Visual cryptography

Shamir's Secret Sharing

Access structure

Source

Cite

Citations (2)

Oblivious Transfer Protocols Based on Commutative Encryption

Jen-Chieh Hsu Raylin Tso Yu‐Chi Chen Mu‐En Wu

Oblivious transfer (OT) protocol is a fundamental building block of cryptography and can be applied widely in many fields. A secure oblivious transfer protocol is supposed to ensure the privacy of both senders and receivers. The privacy of receivers means that the information being selected by receivers would never be revealed to senders. On the other hand, the privacy of senders means that receivers have no further information except for the one that has been selected. In this case, senders are able to deceive receivers by sending same messages. Likewise, in existing 1-out-of-n OT protocols, malicious senders can make all the n messages the same, so that receivers will always get the specific one assigned by senders. This indicates that privacy of receivers wouldnt work under the 1-out-of-n OT protocol. To prevent this kind of attack, this paper provides a general framework on how to design a secure OT protocol based on commutative and ciphertext equality test and take RSA as an example to explain how the protocol is processed.

Oblivious transfer

10.1109/ntms.2018.8328707

Cite

Citations (2)

RAFI: Robust Authentication Framework for IoT-Based RFID Infrastructure

Sensors (2022)

Vikas Kumar Rahul Kumar Akber Ali Khan Vinod Kumar Yu‐Chi Chen

The Internet of Things (IoT) is a future trend that uses the Internet to connect a variety of physical things with the cyber world. IoT technology is rapidly evolving, and it will soon have a significant impact on our daily lives. While the growing number of linked IoT devices makes our daily lives easier, it also puts our personal data at risk. In IoT applications, Radio Frequency Identification (RFID) helps in the automatic identification of linked devices, and the dataflow of the system forms a symmetry in communication between the tags and the readers. However, the security and privacy of RFID-tag-connected devices are the key concerns. The communication link is thought to be wireless or insecure, making the RFID system open to several known threats. In order to address these security issues, we propose a robust authentication framework for IoT-based RFID infrastructure. We use formal security analysis in the random oracle model, as well as information analysis to support the claim of secure communication. Regarding the desirable performance characteristics, we describe and analyze the proposed framework's performance and compare it to similar systems. According to our findings, the proposed framework satisfies all security requirements while also improving the communication.

Identification

Random oracle

10.3390/s22093110

Cite

Citations (12)

An Explorative Study on Constructing Indices for Web Television Viewing

網際網路技術學刊 (2020)

Yu‐Chi Chen Haixiang He

Quantitative method has dominated television audience survey in the past few decades. However, criticism over the method increases in tandem with the unprecedented change of television technology and the rise of multichannel viewing environment. In supplement to the quantitative method, the qualitative approach to audience survey has widely adopted across countries to evaluate viewing behaviors recently. Unfortunately, scholars are still searching for a doable qualitative framework that will fulfill the practical needs of contemporary television producers. To the regard, this study aims at constructing a qualitative index to measure television viewing behaviors in the muti-channel environment. Firstly, this study emphasizes that the main character of Internet users is interactivity. Secondly, this study argues that the use of Internet television should be focus on the concept of intertextuality. Thirdly, this study proposes that the qualitative index of television viewing has to be structured on the interconnection between the user and the content. Fourthly, this study borrows the concept “appreciation” from art as the core of the qualitative index. Lastly, this study will proceed by integrating different empirical methods and data to test the practicality of the qualitative index. In short, this research is not only measure the “appreciation”, but all so measuremen what “appreciation” contains. Hope to provide a more objective measurement method of Internet viewing.

Interactivity

Internet television

Empirical Research

Interactive Television

Qualitative property

Source

Cite

Citations (0)

A Secure and IoT-Enabled Data Sharing System Based on IPFS and IOTA Blockchain

Tse-Yang Huang Yu‐Chi Chen Tsung-Chen Hsieh Huan-Chi Chang Chih-Chieh Chang

With the increasing amount of Internet of Things (IoT) data, there is an increasing need to manage those data efficiently and securely. In this paper, we propose a decentralized and privacy-preserving IoT data sharing and management system based on the Interplanetary File System (IPFS) and the IOTA Tangle. Our system enables data owners to securely upload and manage their data on IPFS. We maintain the privacy of the data through Fuzzy Identity-Based Encryption (FIBE). Our system also includes a tag-based search mechanism, which allows data users to easily find the data they need without knowing specific transaction IDs. Compared with existing solutions, our system offloads data owners from local storage and backup and provides a more efficient and effective data search mechanism.

Upload

Data Sharing

10.1145/3625078.3625085

Cite

Citations (1)