Browsing by Author "Chen, Rong-Jaye"

Now showing 1 - 13 of 13

A Privacy-Preserving Encoding for Efficient Comparison Queries and Access Control from Predicate Encryption
(2015-01-01)
Chen, Shao-Heng
;
Tseng, Fu-Kuo
;
Chen, Rong-Jaye
;
交大名義發表
;
National Chiao Tung University
A hidden vector encryption (HVE) scheme, one type of predicate encryption schemes, can support comparison predicates on encrypted keywords through encrypted predicates by pairing transformed keyword vectors with predicate vectors. However, the length of these vectors grows in proportion to the size of the keyword space and so does the system complexity. In this paper, we provide a privacy-preserving encoding for efficient comparison queries, where the length of the vectors and the system complexity is only logarithmically proportional to the size of the keyword space. In addition, our encoding integrates a HVE scheme and a ciphertext-policy attribute based encryption (CPABE) scheme. This integration provides not only the access control based on the searchable keywords but also balanced overheads among encryption, key generation and query for both computation and storage overheads.
A Secure Reed-Solomon Code Incentive Scheme for Commercial Ad Dissemination Over VANETs
(2011-11-01)
Tseng, Fu-Kuo
;
Liu, Yung-Hsiang
;
Hwu, Jing-Shyang
;
Chen, Rong-Jaye
;
資訊工程學系
A recent surge of research on vehicular ad hoc networks (VANETs) has given us new opportunities and challenges. Aside from safety-related applications, commercial applications also find their way to fully utilize these networks. One of the promising applications is the dissemination of commercial advertisements over VANETs. However, there are uncooperative vehicles that may disrupt the spreading of these advertisements. To encourage cooperation, we want to address proper incentives and security measurements. In this paper, we use Reed-Solomon codes (RS-codes) to construct our incentive scheme and enhance its security by introducing one discrete logarithm representation problem. Our construction yields a secure and practical commercial advertisement dissemination scheme over VANETs.
An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem
(2017-01-01)
Liu, Yung-Hsiang
;
Chen, Rong-Jaye
;
資訊工程學系
;
Department of Computer Science
The secret sharing schemes based on the Chinese Remainder Theorem (CRT) and their applications have attracted many researchers in recent years. In this paper, we propose a weighted threshold secret sharing scheme based on the CRT and prove the scheme is asymptotically perfect. Since all CRT-based secret sharing schemes use special sequences of pairwise coprime integers as its parameters, this paper proposes the first algorithm to generate these integers. Moreover, the correctness of this algorithm is proved by using the prime number theorem. The experimental result shows the effectiveness and the efficiency of our algorithm as well as the space efficiency of our scheme using the sequences of integers generated from our algorithm. Our scheme with the parameter generation algorithm can be used in many applications such as threshold cryptosystems.
An Efficient Fragile Watermarking Scheme for Pixel-wise Tamper Detection
(2012)
Lee, Yang-Kuo
;
Chang, Jen-Chun
;
Wu, Hsin-Lung
;
Chen, Rong-Jaye
;
資訊工程學系
In this paper we propose a novel pixel-wise fragile watermarking scheme which is able to detect tampered pixels with very high probability. Based on a new technique called Image-Dependent Seed (IDS), the proposed method is not only efficient but also secure against many known attacks. Furthermore, the proposed scheme can be simply implemented with only bit-wise AND and Exclusive-OR operations.
An efficient identity-based cryptosystem for end-to-end mobile security
(2006-09-01)
Hwu, Jing-Shyang
;
Chen, Rong-Jaye
;
Lin, Yi-Bing
;
資訊工程學系
;
Department of Computer Science
In the next generation mobile telecommunications, any third party that provides wireless data services (e.g., mobile banking) must have its own solution for end-to-end security. Existing mobile security mechanisms are based on public-key cryptosystem. The main concern in a public-key setting is the authenticity of the public key. This issue can be resolved by identity-based (ID-based) cryptography where the public key of a user can be derived from public information that uniquely identifies the user. This paper proposes an efficient ID-based encryption algorithm. We actually implement the ID-based encryption schemes and compare the performance to show the advantage of our approach. Our study indicates that our solution outperforms a previously proposed algorithm by 20-35%.
Cryptanalysis and Improvement of an Encoding Method for Private-Key Hidden Vector Encryptions
(2015-09-01)
Tseng, Fu-Kuo
;
Chen, Rong-Jaye
;
資訊工程學系
;
Department of Computer Science
A predicate encryption scheme enables the owner of the master key to enforce fine-grained access control on encrypted cloud data through the delegation of predicate tokens to cloud storages. In particular, Blundo et al. proposed a construction where a predicate token reveals partial information of the involved keywords to enable efficient operations on encrypted keywords. However, we found that a predicate token reveals more information than what was claimed because of the encoding scheme. In this letter, we not only analyze this extra information leakage but also present an improved encoding scheme for the Blundo et al\'s scheme and the other similar schemes to preserve predicate privacy.
Design for a Secure Interoperable Cloud-Based Personal Health Record Service
(2012)
Hsieh, George
;
Chen, Rong-Jaye
;
資訊工程學系
;
Department of Computer Science
Adoption of Personal Health Record (PHR) applications has been slow due to consumers\' concerns in security, privacy and trust, and the challenges in interoperability and integration with other Electronic Medical Record (EMR) systems. This paper proposes the design for a secure interoperable cloud-based PHR service. To enhance the portability and interoperability, we use the Continuity of Care Document (CCD) for both storing and exchanging the PHR information for an individual. To provide self-protecting security for each CCD instance, we apply a broad spectrum of security mechanisms including access control, encryption, and digital signature in an integrated, embedded, and fine-grained manner, based on open standards such as eXtensible Access Control Markup Language, XML Encryption, XML Signature, and XML Key Management Specification. To support patient-controlled encryption and privacy-preserving keyword search, we use ciphertext-policy attribute-based encryption and public-key encryption with keyword search schemes, again in an integrated, embedded, and fine-grained manner.
Distance-preserving and distance-increasing mappings from ternary vectors to permutations
(2008-03-01)
Lin, Jyh-Shyan
;
Chang, Jen-Chun
;
Chen, Rong-Jaye
;
Klove, Torleiv
;
資訊工程學系
Permutation arrays have found applications in powerline communication. One construction method for permutation arrays is to map good codes to permutations using a distance-preserving mappings (DPM). DPMs are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of some fixed length (the same or longer) such that every two distinct vectors are mapped to permutations with the same or larger Hamming distance than that of the vectors. A DIM is called distance increasing (DIM) if the distances are strictly increased (except when the two vectors are equal). In this correspondence, we propose constructions of DPMs and DIMs from ternary vectors. The constructed DPMs and DIMs improve many lower bounds on the maximal size of permutation arrays.
Ensuring Correctness of Range Searches on Encrypted Cloud Data
(2012)
Tseng, Fu-Kuo
;
Liu, Yung-Hsiang
;
Chen, Rong-Jaye
;
資訊工程學系
;
Department of Computer Science
We target at one newly introduced security concern which is not fully addressed when moving (encrypted) data to the cloud, namely, the security of the search results from the cloud. The cloud storage provider (CSP) might be compromised or simply act maliciously for their own good, which yields incorrect search results. In this paper, we exploit hidden vector encryption to tackle this important security problem. Our construction enables CSPs to provide a proof of the search results to be verified later by the cloud storage users. In particular, this proposed scheme handles equality and range searches on encrypted data. Users can verified the correctness of the search results without decrypting for the corresponding file contents. Any tampering with the search results by CSPs will be caught, while any incorrect charge against CSPs for tampering search results can be rectified. Finally, we present extensive security and performance analysis to show the security and practicality of our scheme.
Feature-Selection-Based Ransomware Detection with Machine Learning of Data Analysis
(2018-01-01)
Wan, Yu-Lun
;
Chang, Jen-Chun
;
Chen, Rong-Jaye
;
Wang, Shiuh-Jeng
;
資訊工程學系
Ransomwares are continuously produced in underground markets such that increasingly high-level and sophisticated ransomwares are spreading all over the world, significantly affecting individuals, businesses, governments, and countries. To prevent large-scale attacks, most companies buy intrusion detection systems to alert regarding any abnormal network behavior. However, they cannot be detected using conventional signature-based detection even though ransomwares belong to the same family. In this study, a method is provided to develop a network intrusion detection model that is based on big data technology. The system uses Argus for packet preprocessing, merging, and labeling the known malicious data. A concept of Biflow was proposed to replace the packet data. Further, we observe that the data size is reduced to 1000:1. Additionally, the characteristics of a complete traffic are obtained. Six feature selection algorithms were combined to achieve a better accuracy in terms of classification. Finally, the decision tree model of the supervised machine learning was used to enhance the performance of intrusion detection system.
iPEKS: Fast and Secure Cloud Data Retrieval from the Public-key Encryption with Keyword Search
(2013)
Tseng, Fu-Kuo
;
Chen, Rong-Jaye
;
Lin, Bao-Shuh Paul
;
資訊工程學系
;
Department of Computer Science
In recent years, considerable concern has arisen over the security of the data stored in the cloud. A number of studies have suggested the use of cryptographic primitives to protect the data. As these tools transform the data into an unintelligible form, secure and efficient retrieval of the encrypted data from the cloud becomes a major challenge. The public-key encryption with keyword search (PEKS) scheme and many of its variants have been proposed to respond to this challenge. However, given a large number of data (or searchable keywords) would be tested sequentially in these PEKS schemes, previous search results should be employed to improve the efficiency of future searches. In this paper, we present an interactive construction named iPEKS where the search time is linear to the total number of distinct searched keywords instead of the total number of the searchable keywords. The more the keywords have been searched previously, the better the efficiency can be improved. We provide theoretical analysis to show the security and privacy. In addition, implementation and performance experiments exhibit a great improvement in efficiency compared with the previous schemes.
New simple constructions of distance-increasing mappings from binary vectors to permutations
(2006-10-31)
Lin, Jyh-Shyan
;
Chang, Jen-Chun
;
Chen, Rong-Jaye
;
資訊工程學系
;
Department of Computer Science
Distance-increasing mappings (DIMs) are mappings from the set of binary vectors of a fixed length to the set of permutations of the same length that increase Hamming distances except when that is obviously not possible. In this paper, we propose new non-recursive constructions of DIMs which are based on simple compositions of permutations. In comparison with Chang's constructions, our new constructions do not need any table-lookup operations, and usually have better distance expansion distributions when the length is odd. (c) 2006 Elsevier B.V. All rights reserved.
Towards Position-Aware Symbol-Based Searches on Encrypted Data from Symmetric Predicate Encryption Schemes
(2016-01)
Tseng, Fu-Kuo
;
Chen, Rong-Jaye
;
資訊工程學系
;
Department of Computer Science
Symmetric predicate encryption schemes support a rich class of predicates over keyword ciphertexts while preserving both keyword privacy and predicate privacy. Most of these schemes treat each keyword as the smallest unit to be processed in the generation of ciphertexts and predicate tokens. To extend the class of predicates, we treat each symbol of a keyword as the smallest unit to be processed. In this letter, we propose a novel encoding to construct a symmetric inner-product encryption scheme for position-aware symbol-based predicates. The resulting scheme can be applied to a number of secure filtering and online storage services.