Topic
Plaintext-aware encryption
About: Plaintext-aware encryption is a research topic. Over the lifetime, 1980 publications have been published within this topic receiving 101775 citations. The topic is also known as: Plaintext awareness.
Papers published on a yearly basis
Papers
More filters
Patent•
29 Apr 2014
TL;DR: In this paper, a threshold encryption system based on Cramer-Shoup encryption is proposed, which uses linearly homomorphic signatures as publicly verifiable proofs of ciphertext validity.
Abstract: A threshold encryption system comprising a sender device ( 120 ) configured to generate ciphertexts and at least one entity device ( 110 ) configured to perform partial decryption of ciphertexts. The system is based on Cramer-Shoup encryption systems and use linearly homomorphic signatures as publicly verifiable proofs of ciphertext validity.
19 citations
24 Feb 2016
TL;DR: This work presents an efficient implementation of QC- MDPC Niederreiter for ARM Cortex-M4 microcontrollers and the first implementation of Persichetti's IND-CCA hybrid encryption scheme from PQCrypto'13 instantiated with QC-MDPC NIEDerreitter for key encapsulation and AES-CBC/AES-CMAC for data encapsulation.
Abstract: QC-MDPC McEliece attracted significant attention as promising alternative public-key encryption scheme believed to be resistant against quantum computing attacks. Compared to binary Goppa codes, it achieves practical key sizes and was shown to perform well on constrained platforms such as embedded microcontrollers and FPGAs.
However, so far none of the published QC-MDPC McEliece/Niederreiter implementations provide indistinguishability under chosen plaintext or chosen ciphertext attacks. Common ways for the McEliece and Niederreiter encryption schemes to achieve IND-CPA/IND-CCA security are surrounding constructions that convert them into secured schemes. In this work we take a slightly different approach presenting 1 an efficient implementation of QC-MDPC Niederreiter for ARM Cortex-M4 microcontrollers and 2 the first implementation of Persichetti's IND-CCA hybrid encryption scheme from PQCrypto'13 instantiated with QC-MDPC Niederreiter for key encapsulation and AES-CBC/AES-CMAC for data encapsulation. Both implementations achieve practical performance for embedded microcontrollers, at 80-bit security hybrid encryption takes 16.5i¾źms, decryption 111i¾źms and key-generation 386.4i¾źms.
19 citations
16 Oct 2009
TL;DR: This paper constructs a generic construciton of TRE-PC from a chosen-ciphertext secure public key encryption scheme (PKE), a chosen plaintext secure identity-based encryption (IBE) scheme with specific property that the authors call target collision resistance for randomness , and a one-time signature scheme.
Abstract: In 2005, Hwang et al. proposed a concept of timed-release encryption with pre-open capability (TRE-PC), where a receiver can decrypt a ciphertext not only by using a time-release key which is provided after its release-time, but also using a secret information called a pre-open key provided from a sender even before the release-time. Though there are several concrete constructions of TRE-PC proposed so far, no generic construction has been known. In this paper, we show a generic construciton of TRE-PC. Specifically, we construct a TRE-PC scheme from a chosen-ciphertext secure public key encryption scheme (PKE), a chosen plaintext secure identity-based encryption (IBE) scheme with specific property that we call target collision resistance for randomness , and a one-time signature scheme.
Interestingly, our proposed construction of TRE-PC is essentially the same as the generic construciton of (normal) TRE based on multiple encryption of IBE and PKE. As one of the consequences of our result, we can build a TRE-PC scheme secure in the standard model based on weaker assumptions than the ones used by the existing standard model TRE-PC scheme.
19 citations
Patent•
27 Jan 1998TL;DR: In this paper, the authors proposed a method of evaluating a cryptosystem to determine whether the crypto-system can withstand a fault analysis attack, which includes the steps of providing a cryptographic system having an encrypting process to encrypt a plaintext into a ciphertext, introducing a fault into the encryption process to generate a cipher text with faults, and comparing the ciphertext with the corrupted ciphertext in an attempt to recover a key of the cryptographic system.
Abstract: A method of evaluating a cryptosystem to determine whether the cryptosystem can withstand a fault analysis attack, the method includes the steps of providing a cryptosystem having an encrypting process to encrypt a plaintext into a ciphertext, introducing a fault into the encrypting process to generate a ciphertext with faults, and comparing the ciphertext with the ciphertext with faults in an attempt to recover a key of the cryptosystem.
19 citations
TL;DR: This paper finds that the security of MCKBA can be broken with a differential attack, which requires only four chosen plain-images, and performance of the attack is verified by experimental results.
Abstract: Recently, a chaos-based image encryption algorithm called MCKBA (Modified Chaotic-Key Based Algorithm) was proposed This paper analyzes the security of MCKBA and finds that it can be broken with a differential attack, which requires only four chosen plain-images Performance of the attack is verified by experimental results In addition, some defects of MCKBA, including insensitivity with respect to changes of plain-image/secret key, are reported
19 citations