Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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, 2009• 47 citations
Publisher
DOI
10.1007/978-3-642-00862-7_16

Related papers

A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions

Yehuda Lindell

Lecture notes in computer science•Jan 1, 2003•51 citations

On the CCA2 Security of McEliece in the Standard Model

Edoardo Persichetti

Lecture notes in computer science•Jan 1, 2018•6 citations

Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions

Lin Lyu, Shengli Liu, Shuai Han +1 more

Lecture notes in computer science•Jan 1, 2018•14 citations

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

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.

•Jan 1, 2008•1 citation

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, 2010•1 citation

The Efficient CCA Secure Public-Key Encryption Scheme

Kang Li, Zhiyi Wang

Chinese Journal of Computers•May 19, 2011•2 citations
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.