• 제목/요약/키워드: Encryption technology

검색결과 664건 처리시간 0.023초

뇌파 기반의 인증시스템을 위한 EEG 암호화 기법 (An EEG Encryption Scheme for Authentication System based on Brain Wave)

  • 김정숙;정장영
    • 한국멀티미디어학회논문지
    • /
    • 제18권3호
    • /
    • pp.330-338
    • /
    • 2015
  • Gradually increasing the value of the technology, the techniques of the various security systems to protect the core technology have been developed. The proposed security scheme, which uses both a Password and the various devices, is always open by malicious user. In order to solve that problem, the biometric authentication systems are introduced but they have a problem which is the secondary damage to the user. So, the authentication methods using EEG(Electroencephalography) signals were developed. However, the size of EEG signals is big and it cause a lot of problems for the real-time authentication. And the encryption method is necessary. In this paper, we proposed an efficient real-time authentication system applied encryption scheme with junk data using chaos map on the EEG signals.

Enhancing Document Security with Computer Generated Hologram Encryption: Comprehensive Solution for Mobile Verification and Offline Decryption

  • Leehwan Hwang;Seunghyun Lee;Jongsung Choi
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제16권1호
    • /
    • pp.169-175
    • /
    • 2024
  • In this paper, we introduce a novel approach to enhance document security by integrating Computer Generated Hologram(CGH) encryption technology with a system for document encryption, printing, and subsequent verification using a smartphone application. The proposed system enables the encryption of documents using CGH technology and their printing on the edges of the document, simplifying document verification and validation through a smartphone application. Furthermore, the system leverages high-resolution smartphone cameras to perform online verification of the original document and supports offline document decryption, ensuring tamper detection even in environments without internet connectivity. This research contributes to the development of a comprehensive and versatile solution for document security and integrity, with applications in various domains.

A Secure Index Management Scheme for Providing Data Sharing in Cloud Storage

  • Lee, Sun-Ho;Lee, Im-Yeong
    • Journal of Information Processing Systems
    • /
    • 제9권2호
    • /
    • pp.287-300
    • /
    • 2013
  • Cloud storage is provided as a service in order to keep pace with the increasing use of digital information. It can be used to store data via networks and various devices and is easy to access. Unlike existing removable storage, many users can use cloud storage because it has no storage capacity limit and does not require a storage medium. Cloud storage reliability has become a topic of importance, as many users employ it for saving great volumes of data. For protection against unethical administrators and attackers, a variety of cryptography systems, such as searchable encryption and proxy re-encryption, are being applied to cloud storage systems. However, the existing searchable encryption technology is inconvenient to use in a cloud storage environment where users upload their data. This is because this data is shared with others, as necessary, and the users with whom the data is shared change frequently. In this paper, we propose a searchable re-encryption scheme in which a user can safely share data with others by generating a searchable encryption index and then re-encrypt it.

비교가능 암호화의 허점 (A Security Hole in Comparable Encryption)

  • 김상진;오희국
    • 정보보호학회논문지
    • /
    • 제23권2호
    • /
    • pp.267-271
    • /
    • 2013
  • 확률적 공개키 시스템에서 두 암호문이 주어졌을 때 이들을 복호화하지 않고 동일한 메시지를 암호화한 것인지 확인할 수 있는 암호기법을 비교가능 암호화(comparable encryption)라 한다. 최근에 Yang 등이 이와 같은 암호기법을 제안하였으며, 이영민 등과 Tang은 확인자를 제한할 수 있도록 Yang 등이 제안한 기법을 수정하였다. 하지만 Yang 등이 제안한 시스템은 주장된 것과 달리 암호화된 메시지가 서로 다른 경우에도 같다는 결과를 주는 허점을 가지고 있으며, 이 허점은 이영민 등과 Tang 시스템에도 동일하게 나타난다. 이 논문에서는 이와 같은 허점을 제시하며, 이 허점이 응용에 미칠 수 있는 파급효과를 분석한다.

개인정보암호화에 효율적인 새로운 형태보존암호화 알고리즘 (An Efficient New Format-Preserving Encryption Algorithm to encrypt the Personal Information)

  • 송경환;강형철;성재철
    • 정보보호학회논문지
    • /
    • 제24권4호
    • /
    • pp.753-763
    • /
    • 2014
  • 최근 금융기관 및 대형 유통업체 등에서 대량의 개인정보유출사고가 연이어 발생하고, 그 피해는 날로 늘어나는 추세에 있다. 이에 따라 개인식별정보를 암호화하도록 강제하는 등 규제가 강화되고 있다. 이러한 개인정보를 암호화하는데 있어서 효율적인 기술이 형태보존암호화이다. 일반적인 암호화방식은 입력 데이터 길이보다 출력 데이터 길이가 확장되며 형태가 변경된다. 형태보존암호화는 입력 데이터의 길이와 형태를 보존해주기 때문에 데이터베이스 및 응용프로그램 수정을 최소화하는 효율적인 방식이다. 본 논문에서는 블록암호 운영모드를 이용한 개인정보 암호화에 효율적인 형태보존암호화방식을 새롭게 제안한다.

A Study on Efficient Data De-Identification Method for Blockchain DID

  • Min, Youn-A
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제13권2호
    • /
    • pp.60-66
    • /
    • 2021
  • Blockchain is a technology that enables trust-based consensus and verification based on a decentralized network. Distributed ID (DID) is based on a decentralized structure, and users have the right to manage their own ID. Recently, interest in self-sovereign identity authentication is increasing. In this paper, as a method for transparent and safe sovereignty management of data, among data pseudonymization techniques for blockchain use, various methods for data encryption processing are examined. The public key technique (homomorphic encryption) has high flexibility and security because different algorithms are applied to the entire sentence for encryption and decryption. As a result, the computational efficiency decreases. The hash function method (MD5) can maintain flexibility and is higher than the security-related two-way encryption method, but there is a threat of collision. Zero-knowledge proof is based on public key encryption based on a mutual proof method, and complex formulas are applied to processes such as personal identification, key distribution, and digital signature. It requires consensus and verification process, so the operation efficiency is lowered to the level of O (logeN) ~ O(N2). In this paper, data encryption processing for blockchain DID, based on zero-knowledge proof, was proposed and a one-way encryption method considering data use range and frequency of use was proposed. Based on the content presented in the thesis, it is possible to process corrected zero-knowledge proof and to process data efficiently.

Fuzzy Keyword Search Method over Ciphertexts supporting Access Control

  • Mei, Zhuolin;Wu, Bin;Tian, Shengli;Ruan, Yonghui;Cui, Zongmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5671-5693
    • /
    • 2017
  • With the rapid development of cloud computing, more and more data owners are motivated to outsource their data to cloud for various benefits. Due to serious privacy concerns, sensitive data should be encrypted before being outsourced to the cloud. However, this results that effective data utilization becomes a very challenging task, such as keyword search over ciphertexts. Although many searchable encryption methods have been proposed, they only support exact keyword search. Thus, misspelled keywords in the query will result in wrong or no matching. Very recently, a few methods extends the search capability to fuzzy keyword search. Some of them may result in inaccurate search results. The other methods need very large indexes which inevitably lead to low search efficiency. Additionally, the above fuzzy keyword search methods do not support access control. In our paper, we propose a searchable encryption method which achieves fuzzy search and access control through algorithm design and Ciphertext-Policy Attribute-based Encryption (CP-ABE). In our method, the index is small and the search results are accurate. We present word pattern which can be used to balance the search efficiency and privacy. Finally, we conduct extensive experiments and analyze the security of the proposed method.

Modified Multi-Chaotic Systems that are Based on Pixel Shuffle for Image Encryption

  • Verma, Om Prakash;Nizam, Munazza;Ahmad, Musheer
    • Journal of Information Processing Systems
    • /
    • 제9권2호
    • /
    • pp.271-286
    • /
    • 2013
  • Recently, a pixel-chaotic-shuffling (PCS) method has been proposed by Huang et al. for encrypting color images using multiple chaotic systems like the Henon, the Lorenz, the Chua, and the Rossler systems. All of which have great encryption performance. The authors claimed that their pixel-chaotic-shuffle (PCS) encryption method has high confidential security. However, the security analysis of the PCS method against the chosen-plaintext attack (CPA) and known-plaintext attack (KPA) performed by Solak et al. successfully breaks the PCS encryption scheme without knowing the secret key. In this paper we present an improved shuffling pattern for the plaintext image bits to make the cryptosystem proposed by Huang et al. resistant to chosen-plaintext attack and known-plaintext attack. The modifications in the existing PCS encryption method are proposed to improve its security performance against the potential attacks described above. The Number of Pixel Change Rate (NPCR), Unified Average Changed Intensity (UACI), information entropy, and correlation coefficient analysis are performed to evaluate the statistical performance of the modified PCS method. The simulation analysis reveals that the modified PCS method has better statistical features and is more resistant to attacks than Huang et al.'s PCS method.

ABC(Advanced Block Cipher) 알고리즘 설계 (A design of ABC(Advanced Block Cipher) Algorithm)

  • 이병관;정은희;윤동식
    • 한국정보전자통신기술학회논문지
    • /
    • 제3권2호
    • /
    • pp.64-69
    • /
    • 2010
  • 본 논문에서는 EC-DH를 이용한 안전한 키 분배와 처리속도가 개선된 64byte 블록 암호화 알고리즘인 ABC(Advanced Block Cipher) 알고리즘을 설계하였다. ABC 알고리즘은 별도의 S-Box, IP-Box 등을 사용하지 않고 데이터 교환키를 이용해 원본 데이터의 위치를 교환하는 방식을 사용함으로써 기본적인 메모리 점유율을 줄였다. 또한, 고정된 암 복호화 키가 아닌 유동적인 암 복호화 키를 사용해 대칭키의 유출에 대비하였다. 따라서, 본 논문에서 제안한 ABC 알고리즘은 모바일 뱅킹 및 낮은 메모리 환경에 적합한 암호화 알고리즘이라 할 수 있다.

  • PDF

이진트리 기반의 속성기반 암호전송 알고리즘 (Two Attribute-based Broadcast Encryption Algorithms based on the Binary Tree)

  • 이문식;김홍태;홍정대
    • 한국군사과학기술학회지
    • /
    • 제17권3호
    • /
    • pp.358-363
    • /
    • 2014
  • In this paper, we present two constructions of the attribute-based broadcast encryption(ABBE) algorithm. Attribute-based encryption(ABE) algorithm enables an access control mechanism over encrypted data by specifying access policies among private keys and ciphertexts. ABBE algorithm can be used to construct ABE algorithm with revocation mechanism. Revocation has a useful property that revocation can be done without affecting any non-revoked uers. The main difference between our algorithm and the classical ones derived from the complete subtree paradigm which is apt for military hierarchy. Our algorithm improve the efficiency from the previously best ABBE algorithm, in particular, our algorithm allows one to select or revoke users by sending ciphertext of constant size with respect to the number of attributes and by storing logarithm secret key size of the number of users. Therefore, our algorithm can be an option to applications where computation cost is a top priority and can be applied to military technologies in the near future.