• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3231-3249
• /
• 2014

Deniable encryption, introduced in 1997 by Canetti, Dwork, Naor, and Ostrovsky, guarantees that the sender or the receiver of a secret message is able to "fake" the message encrypted in a specific ciphertext in the presence of a coercing adversary, without the adversary detecting that he was not given the real message. Sender - side deniable encryption scheme is considered to be one of the classification of deniable encryption technique which defined as resilient against coercing the sender. M. H. Ibrahim presented a sender - side deniable encryption scheme which based on public key and uncertainty of Jacobi Symbol [6]. This scheme has several problems; (1) it can't be able to derive the fake message $M_f$ that belongs to a valid message set, (2) it is not secure against Quadratic Residue Problem (QRP), and (3) the decryption process is very slow because it is based dramatically on square root computation until reach the message as a Quadratic Non Residue (QNR). The first problem is solved by J. Howlader and S. Basu's scheme [7]; they presented a sender side encryption scheme that allows the sender to present a fake message $M_f$ from a valid message set, but it still suffers from the last two mentioned problems. In this paper we present a new sender-side deniable public-key encryption scheme with fast decryption by which the sender is able to lie about the encrypted message to a coercer and hence escape coercion. While the receiver is able to decrypt for the true message, the sender has the ability to open a fake message of his choice to the coercer which, when verified, gives the same ciphertext as the true message. Compared with both Ibrahim's scheme and J. Howlader and S. Basu's scheme, our scheme enjoys nice two features which solved the mentioned problems: (1) It is semantically secure against Quadratic Residue Problem; (2) It is as fast, in the decryption process, as other schemes. Finally, applying the proposed deniable encryption, we originally give a coercion resistant internet voting model without physical assumptions.

• East Asian mathematical journal
• /
• 제39권3호
• /
• pp.291-298
• /
• 2023

Recently, a new type of encryption called Homomorphic Authenticated Encryption (HAE) has been proposed. This combines the functionality of homomorphic encryption with authentication. Several concrete HAE schemes have been developed and security results for homomorphic authenticated encryption, designed by combining a homomorphic message authentication scheme with a homomorphic secret-key encryption, have been partially reported. In this paper, we analyze the security of a design method that combines homomorphic message authentication and homomorphic encryption, with a focus on the encryption after authentication (EAA) type. The results of our analysis show that while non-forgeability and indistinguishability are maintained, strong non-forgeability is not.

• International Journal of Computer Science & Network Security
• /
• 제22권4호
• /
• pp.285-291
• /
• 2022

With the growing exchange of data between individuals and institutions through various electronic communication, valuable data protection is in high demand to ensure that it is not hacked and that privacy is protected. Many security techniques, such as encryption and steganography, have emerged to prevent security breaches. The purpose of this research is to integrate cryptographic and steganography techniques to secure text message sending. The Rijndael algorithm was used to encrypt the text message, and the Least Significant Bit algorithm was also used to hide the encrypted message in a color image. Experiments on the suggested method have proven that it can improve the security of sent messages due to the human eye's inability to identify the original image from the image after it has been covered, as well as the encryption of the message using a password.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.943-957
• /
• 2001

In this paper, we propose an efficient encryption algorithm, without exchanging session keys of a symmetric cryptosystem. The proposed scheme, called as the FAKE(Fast Asymmetric Key Encryption), first scrambles an entire input message and then encrypts small parts of the scrambled message using an asymmetric key encryption scheme. We use the all-or-nothing transform based on the hash function as a scrambling function, which was proposed by Shin, et al. Furthermore, the proposed scheme can additionally provide a digital signature service with only small overhead.

• 정보과학회 논문지
• /
• 제44권8호
• /
• pp.860-869
• /
• 2017

최근 국내에서 개인정보 안전성에 관한 법률이 제정됨으로써 개인정보 암호화에 많은 관심이 집중되었다. 그러나 기존의 암호화 기법을 그대로 사용한다면, 데이터의 형태를 보존할 수 없기 때문에 데이터베이스의 스키마를 변경해야하며 이는 많은 비용을 발생시킬 수 있다. 따라서 기존의 데이터베이스 스키마를 그대로 유지하고 데이터의 기밀성을 보존할 수 있는 형태보존암호가 핵심 기술로 대두되고 있다. 이에 따라 NIST는 FF1과 FF3를 형태보존암호의 표준으로 공표했지만, 최근 메시지 복구 공격에 대한 FF1과 FF3의 안전성에 문제점이 발견되었다. 본 논문에서는 형태보존암호의 표준인 FF1과 FF3, 그리고 메시지 복구 공격에 대해 연구하고 분석하였다. 또한 이를 바탕으로 메시지 복구 공격에 안전할 수 있는 형태보존암호를 연구하고, 표준화된 FF1과 FF3을 직접 구현하여 제안 방식의 효율성을 검증하였다.

• ETRI Journal
• /
• 제38권1호
• /
• pp.123-132
• /
• 2016

The Boneh, Goh, and Nissim (BGN) cryptosytem is the first homomorphic encryption scheme that allows additions and multiplications of plaintexts on encrypted data. BGN-type cryptosystems permit very small plaintext sizes. The best-known approach for the expansion of a message size by t times is one that requires t implementations of an initial scheme; however, such an approach becomes impractical when t is large. In this paper, we present a method of message expansion of BGN-type homomorphic encryption using composite product pairing, which is practical for relatively large t. In addition, we prove that the indistinguishability under chosen plaintext attack security of our construction relies on the decisional Diffie-Hellman assumption for all subgroups of prime order of the underlying composite pairing group.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2928-2940
• /
• 2013

Key exposure is a major threat to secure cryptosystems. To mitigate the impact caused by key-compromise attacks, a key-insulated cryptographic mechanism is a better alternative. For securing the large message communication in peer-to-peer networks, in this paper, we propose the first novel identity-based key-insulated encryption (IB-KIE) scheme with message linkages. Our scheme has the properties of unbounded time periods and random-access key-updates. In the proposed scheme, each client can periodically update his private key while the corresponding public one remains unchanged. The essential security assumption of our proposed scheme is based on the well-known bilinear Diffie-Hellman problem (BDHP). To ensure the practical feasibility, we also formally prove that the proposed scheme achieves the security requirement of confidentiality against indistinguishability under adaptive chosen-ciphertext attacks (IND-CCA2) in the random oracle model.

• 대한수학회지
• /
• 제50권2호
• /
• pp.361-377
• /
• 2013

In this work we deal with the problem of how to squeeze multiple ciphertexts without losing original message information. To do so, we formalize the notion of decomposability for public-key encryption and investigate why adding decomposability is challenging. We construct an ElGamal encryption scheme over extension fields, and show that it supports the efficient decomposition. We then analyze security of our scheme under the standard DDH assumption, and evaluate the performance of our construction.

• 한국산업정보학회논문지
• /
• 제8권1호
• /
• pp.43-54
• /
• 2003

전자상거래는 개인과 개인, 기업과 기업, 개인과 기업 상호간에 메시지의 교환을 통해서 이루어진다. 전자상거래를 활성화 할 수 있는 가장 중요한 요소는 메시지 인증으로서, 이는 거래당사자들이 수신된 메시지의 진정성을 확인하는 과정이다. 메시지의 진정성은 위조불가, 부인불가, 변경불가, 출처인증으로 구성되어 있고, 공개키 암호화를 통해 수행 할 수 있다. X.400 메시지처리 시스템과 공개키 암호화에 기반을 두고 있는 PGP가 메시지 교환에 널리 사용되고 있다. 본 논문에서는 공개키 암호화와 X.400 프로토콜 그리고 PGP상에 존재하는 메시지 인증문제를 해결하기 위하여 NMAP로 명명된 공개정보 기반 암호화 시스템을 제안하고 이를 설계 구현하였다. 구현된 메시지 인증 프로토콜의 검증을 위해 퍼지적분을 사용하였다. 제안된 시스템은 전자상거래의 활성화와 비대화형 인증 서비스 제공에 사용될 수 있을 것이다.

• 한국정보통신학회논문지
• /
• 제14권8호
• /
• pp.1855-1860
• /
• 2010

본 논문은 웹 서비스 표준을 이용하여 안전한 메시지 전송을 위한 웹서비스 시스템을 구현하였다. 본 시스템은 싱글사인온 모듈과 SSL(Secure Socket Layer) 모듈과 안전한 메시지 모듈로 구성되어 있다. 이들 모듈들을 적용하기 위해 가격비교사이트를 대상모델로 하여 설계하였다. 싱글사인온 모듈은 SAML(Security Assertion Markup Language) 표준을 사용하였으며, 또한 권한부여와 인증을 제공한다. SSL 모듈은 종단 간에 메시지 암호화를 처리하기 때문에, 시스템의 메시지를 안전하게 전송한다. 또한 안전한 메시지 모듈은 웹 서비스 보안 표준을 따르는 XML암호화와 서명을 적용하였다.