A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model.

Rafael Dowsley, Jörn Müller‐Quade, Anderson C. A. Nascimento

Published Jan 1, 2008• 1 citation

Abstract

We show that a recently proposed construction by Rosen and Segev can be used for obtaining the first public key encryption scheme based on the McEliece assumptions which is secure against adaptive chosen ciphertext attacks in the standard model.

Related papers

A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model

Rafael Dowsley, Jörn Müller‐Quade, Anderson C. A. Nascimento

Lecture notes in computer scienceJan 1, 200947 citations

Adaptively-Secure, Non-Interactive Public-Key Encryption.

Ran Canetti, Shai Halevi, Jonathan I. Katz

Abstract. Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of alreadycorrupted parties. Ideally, an adaptively-secure encryption scheme should, like standard public-key encryption, allow arbitrarily-many parties to use a single encryption key to securely encrypt arbitrarily-many messages to a given receiver who maintains only a single short decryption key. However, it is known that these requirements are impossible to achieve: no non-interactive encryption scheme that supports encryption of an unbounded number of messages and uses a single, unchanging decryption key can be adaptively secure. Impossibility holds even if secure data erasure is possible. We show that this limitation can be overcome by updating the decryption key over time and making some mild assumptions about the frequency of communication between parties. Using this approach, we construct adaptively-secure, completely non-interactive encryption schemes supporting secure encryption of arbitrarily-many messages from arbitrarilymany senders. Our schemes additionally provide forward security and security against chosen-ciphertext attacks. 1

Jan 1, 20041 citation

Public-key encryption scheme based on R-LWE

Wei Zhang

An improved method of generating trapdoor on ideal lattice was proposed by a stronger regularity bound theorem,then with R-LWE encryption algorithm and strongly unforgeable one-time signature tool from ideal lattice,an adaptive chosen-ciphertext attack(CCA) secure PKE scheme under the standard model was designed.The new PKE scheme supported public ciphertext integrity verification,could achieve block encryption and had a high encryption/decryption speed and a low encryption blowup factor,whose security proved reduced to decisional R-LWE assumption tightly.The construction is the first CCA-secure PKE cryptosystem completely based on hard problems from ideal lattice.

Journal of CommunicationsJan 1, 20131 citation

Chosen Ciphertext Secure Identity-based Encryption in the Standard Model

Xiangsong Zhang

In Eurocrypt 2005,Waters' identity-based encryption scheme suffers from a drawback that the scheme only guarantees chosen plaintext security,which hampers its applications in higher security level environments.A chosen ciphertext secure identity-based encryption scheme was proposed to remedy this drawback.The proposed encryption scheme was regarded as the extended version of Waters' scheme with only one additional element in the ciphertext,and guaranteed chosen ciphertext security.The extended scheme's indistinguishability against adaptive chosen ciphertext attacks was proven in the standard model and rested on the hardness of the decisional bilinear Diffie-Hellman intractability assumption.

Jan 1, 20090 citations

CCA-Secure Deterministic Identity-Based Encryption Scheme

Bo Yang, Kaitai Liang, Liang Xue +3 more

Deterministic public-key encryption, encrypting a plaintext into a unique ciphertext without involving any randomness, was introduced by Bellare, Boldyreva, and O'Neill (CRYPTO 2007) as a realistic alternative to some inherent drawbacks in randomized public-key encryption. Bellare, Kiltz, Peikert and Waters (EUROCRYPT 2012) bring deterministic public-key encryption to the identity-based setting, and propose deterministic identity-based encryption scheme (DIBE). Although the construc- tions of chosen plaintext attack (CPA) secure DIBE scheme have been studied intensively, the construction of chosen ciphertext attack (CCA) secure DIBE scheme is still challenging problems. In this paper, we introduce the notion of identity-based all-but-one trapdoor functions (IB-ABO-TDF), which is an extension version of all-but-one lossy trapdoor function in the public-key setting. We give a instantiation of IB-ABO-TDF under decisional linear assumption. Based on an identity-based lossy trapdoor function and our IB-ABO-TDF, we present a generic construction of CCA-secure DIBE scheme.

Apr 7, 20200 citations

Toward CCA-secure bidirectional proxy re-encryption without pairing nor random oracle

Longxia Zhang, Xu An Wang, Wei Wang

Proxy re-encryption, introduced by Blaze et al. in 1998, allows a proxy to transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. An open problem of constructing (bidirectional or unidirectional) IND-PRE-CCA2 secure proxy re-encryption scheme in the standard model yet without pairings was left until now. In this paper, based on Hanaoka's efficient chosen ciphertext secure public key encryption under the computational Diffie-Hellman assumption, we try to solve this open problem by presenting two new bidirectional proxy re-encryption schemes, which are restricted IND-PRE-CCA2 secure without pairing nor random oracle.

International Conference on Signal Processing Systems (ICSPS)Jul 1, 20101 citation