• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권11호
• /
• pp.4522-4536
• /
• 2020

Nowadays, cloud is the fastest emerging technology in the IT industry. We can store and retrieve data from the cloud. The most frequently occurring problems in the cloud are security and privacy preservation of data. For improving its security, secret information must be protected from various illegal accesses. Numerous traditional cryptography algorithms have been used to increase the privacy in preserving cloud data. Still, there are some problems in privacy protection because of its reduced security. Thus, this article proposes an ElGamal Elliptic Curve (EGEC) Homomorphic encryption scheme for safeguarding the confidentiality of data stored in a cloud. The Users who hold a data can encipher the input data using the proposed EGEC encryption scheme. The homomorphic operations are computed on encrypted data. Whenever user sends data access permission requests to the cloud data storage. The Cloud Service Provider (CSP) validates the user access policy and provides the encrypted data to the user. ElGamal Elliptic Curve (EGEC) decryption was used to generate an original input data. The proposed EGEC homomorphic encryption scheme can be tested using different performance metrics such as execution time, encryption time, decryption time, memory usage, encryption throughput, and decryption throughput. However, efficacy of the ElGamal Elliptic Curve (EGEC) Homomorphic Encryption approach is explained by the comparison study of conventional approaches.

• 정보보호학회논문지
• /
• 제16권4호
• /
• pp.13-26
• /
• 2006

RFID 기술은 바코드 시스템에는 없는 여러 가지 특징들 때문에 유비쿼터스 환경의 핵심기술로 평가되고 있다. 그러나 RFID 시스템은 정보 유출과 위치 추적 등과 같은 사용자 프라이버시 침해 문제를 가지고 있다. RFID 시스템에서 사용자의 프라이버시를 완전하게 보호하기 위해서는 기밀성, 불구분성, 전방 보안성 등의 3가지 필수 보안 요건을 만족시키는 RFID 프라이버시 보호 프로토콜이 필요하다. 기존에 제안된 프로토콜 중에서 이 3가지 필수 보안 요건을 만족하는 안전한 RFID 프라이버시 보호 프로토콜은 Ohkubo가 제안한 해시 체인 기반 프로토콜이다. 불행히도 이 프로토콜은 백엔드 서버에서 태그를 판별하는 시간이 매우 길다는 큰 단점이 있다. 본 논문에서는 Ohkubo가 제안한 프로토콜의 안전성은 그대로 유지하면서 백엔드 서버에서 태그를 판별하는데 걸리는 계산 시간을 단축하는 기법을 제안한다. 제안하는 기법은 백엔드 서버에서 계산 시간을 Ohkubo 프로토콜의 원래 기법보다 현저하게 단축시키는 결과를 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2827-2848
• /
• 2021

Mobile Crowdsourcing (MCS) has become an emerging paradigm evolved from crowdsourcing by employing advanced features of mobile devices such as smartphones to perform more complicated, especially spatial tasks. One of the key procedures in MCS is to collect answers from mobile users (workers), which may face several security issues. First, authentication is required to ensure that answers are from authorized workers. In addition, MCS tasks are usually location-dependent, so the collected answers could disclose workers' location privacy, which may discourage workers to participate in the tasks. Finally, the overhead occurred by authentication and privacy protection should be minimized since mobile devices are resource-constrained. Considering all the above concerns, in this paper, we propose a lightweight and privacy-preserving answer collection scheme for MCS. In the proposed scheme, we achieve anonymous authentication based on traceable ring signature, which provides authentication, anonymity, as well as traceability by enabling malicious workers tracing. In order to balance user location privacy and data availability, we propose a new concept named current location privacy, which means the location of the worker cannot be disclosed to anyone until a specified time. Since the leakage of current location will seriously threaten workers' personal safety, causing such as absence or presence disclosure attacks, it is necessary to pay attention to the current location privacy of workers in MCS. We encrypt the collected answers based on timed-release encryption, ensuring the secure transmission and high availability of data, as well as preserving the current location privacy of workers. Finally, we analyze the security and performance of the proposed scheme. The experimental results show that the computation costs of a worker depend on the number of ring signature members, which indicates the flexibility for a worker to choose an appropriate size of the group under considerations of privacy and efficiency.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2017년도 추계학술대회
• /
• pp.571-572
• /
• 2017

전자화폐를 구현하는 블록체인 기술은 분산화된 컴퓨팅을 사용하며 모든 거래가 모두에게 공개되어 있다. 이러한 기술은 사용자 대신 주소를 사용하여 거래에 수행하여 익명성을 보장하는 것처럼 보이지만 거래 그래프를 기반으로 비순환 방향 그래프를 이용하여 공개된 주소를 추적함으로써 프라이버시 문제가 발생하게 된다. 본 논문에서는 블록체인 기술 내에서 발생하는 프라이버스를 보호하기 위하여 그래프 상의 관련성을 찾기 어렵게 하는 중앙 집중적으로 처리하는 다양한 기법들을 분석한다. 또한, 프라이버시를 강화하기 위하여 분산화된 방법으로 익명화하는 기법들도 분석한다. 영지식 증명 기법을 이용하면 완전 분산 익명성을 보장하지만 더 많은 연산과 저장 공간이 필요하게 되며, 이를 효율적으로 하기 위한 여러 가지 기법들도 제안되었다. 본 논문에서는 기존 프라이버시 보호 기법들을 블록체인 기술에 융합하여 블록체인 기술의 프라이버시 보호를 위한 기법을 제안한다.

• 한국컴퓨터정보학회논문지
• /
• 제15권8호
• /
• pp.107-115
• /
• 2010

RFID 기술은 자동인식 및 데이터획득 기술로서 유비쿼터스 컴퓨팅에 필요한 기술이다. RFID는 저비용 무선인식 메모리 태그를 사용하며, 물리적 비접촉 특성에 의한 사용의 편리성과 유지 우수성으로 사용이 확대되어가고 있다. 그러나 RFID는 RF 신호를 이용하기 때문에 태그와 리더간의 불법적인 정보획득이 가능하며, 획득한 정보를 위치추적과 프라이버시의 침해를 목적으로 사용할 수 있다. 본 논문에서는 불법적인 정보획득으로 인한 사용자의 위치추적과 프라이버시의 침해를 보호할 수 있는 보안기법을 제안한다. 본고에서 제안하는 보안기법은, Gray Code를 이용하여 실제 태그의 계산용량을 줄였을 뿐만 아니라, 태그에서 리더로 전송되는 정보가 고정되어 있지 않으므로 악의적인 공격자의 트래킹이 불가능하며, 악의적인 방법을 통해 태그의 실제정보를 획득하더라도 실제 정보가 아닌 암호화된 정보가 노출되기에 다른 보호기법보다 간단하고 안전하게 사용자 프라이버시를 보호할 수 있다.

• Journal of Information Processing Systems
• /
• 제1권1호
• /
• pp.22-26
• /
• 2005

In this paper, we classified the objectionable texts into four rates according to their harmfulness and proposed the hierarchical text rating system for objectionable documents. Since the documents in the same category have similarities in used words, expressions and structure of the document, the text rating system, which uses a single classification model, has low accuracy. To solve this problem, we separate objectionable documents into several subsets by using their properties, and then classify the subsets hierarchically. The proposed system consists of three layers. In each layer, we select features using the chi-square statistics, and then the weight of the features, which is calculated by using the TF-IDF weighting scheme, is used as an input of the non-linear SVM classifier. By means of a hierarchical scheme using the different features and the different number of features in each layer, we can characterize the objectionability of documents more effectively and expect to improve the performance of the rating system. We compared the performance of the proposed system and performance of several text rating systems and experimental results show that the proposed system can archive an excellent classification performance.

• 한국정보통신학회논문지
• /
• 제16권12호
• /
• pp.2695-2701
• /
• 2012

RFID 시스템에서 사용자의 프라이버시를 보호하기 위해서는 기밀성, 불구분성, 전방 보안성 등의 3가지 필수 보안 요건을 만족시키는 프라이버시 보호 프로토콜이 필요하다. Ohkubo et. al[2]가 제안한 Hash-Chain 기반 프로토콜은 기존에 제안된 프로토콜 중에서 필수 보안 요건을 만족하는 안전한 RFID 프라이버시 보호 프로토콜이나, 백엔드 서버에서 태그를 판별하는 시간이 매우 길다는 단점이 있다. 본 논문에서는 Hash-Chain 기반 프로토콜의 안전성은 그대로 유지하면서 백엔드 서버에서 태그를 판별하는데 걸리는 계산 시간을 단축하는 방안을 제안한다. 제안 기법은 Hash-Chain 기반 프로토콜 기법보다 백엔드 서버에서의 계산 시간을 현저하게 단축시키는 결과를 보여준다.

• Current Optics and Photonics
• /
• 제6권5호
• /
• pp.453-462
• /
• 2022

Blockchain technology provides a decentralized and peer-to-peer network, which has the advantages of transparency and immutability. In this paper, a novel secure authentication scheme applying digital holography to blockchain technology is proposed to protect privacy information in network nodes. The transactional information of the node is chained permanently and immutably in the blockchain to ensure network security. By designing a novel two-dimensional (2D) array data structure of the block, a proof of work (PoW) in the blockchain is executed through digital holography technology to verify true authentication and legal block linkage. A hash generated from the proposed algorithm reveals a random number of 2D array data. The real identity of each node in the network cannot be forged by a hacker's tampering because the privacy information of the node is encrypted using digital holography and stored in the blockchain. The reliability and feasibility of the proposed scheme are analyzed with the help of the research results, which evaluate the effectiveness of the proposed method. Forgery by a malicious node is impossible with the proposed method by rejecting a tampered transaction. The principal application is a secure anonymity system guaranteeing privacy information protection for handling of large information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.3087-3103
• /
• 2022

Nearest neighbor query in location-based services has become a popular application. Aiming at the shortcomings of the privacy protection algorithms of traditional ciphertext nearest neighbor query having the high system overhead because of the usage of the double Hilbert curves and having the inaccurate query results in some special circumstances, a privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve has been proposed. This algorithm uses a single Hilbert curve to transform the two-dimensional coordinates of the points of interest into Hilbert values, and then encrypts them by the order preserving encryption scheme to obtain the one-dimensional ciphertext data which can be compared in numerical size. Then stores the points of interest as elements composed of index value and the ciphertext of the other information about the points of interest on the server-side database. When the user needs to use the nearest neighbor query, firstly calls the approximate nearest neighbor query algorithm proposed in this paper to query on the server-side database, and then obtains the approximate nearest neighbor query results. After that, the accurate nearest neighbor query result can be obtained by calling the precision processing algorithm proposed in this paper. The experimental results show that this privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve is not only feasible, but also optimizes the system overhead and the accuracy of ciphertext nearest neighbor query result.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권5호
• /
• pp.2768-2780
• /
• 2019

Ciphertext-policy attribute-based encryption (CP-ABE) is one of the practical technologies to share data over cloud since it can protect data confidentiality and support fine-grained access control on the encrypted data. However, most of the previous schemes only focus on data confidentiality without considering data receiver privacy preserving. Recently, Li et al.(in TIIS, 10(7), 2016.7) proposed a CP-ABE with hidden access policy and testing, where they declare their scheme achieves privacy preserving for the encryptor and decryptor, and also has high decryption efficiency. Unfortunately, in this paper, we show that their scheme fails to achieve hidden access policy at first. It means that any adversary can obtain access policy information by a simple decisional Diffie-Hellman test (DDH-test) attack. Then we give a method to overcome this shortcoming. Security and performance analyses show that the proposed scheme not only achieves the privacy protection for users, but also has higher efficiency than the original one.