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

Almost Tightly-Secure Re-randomizable and Replayable CCA-Secure Public Key Encryption

Antonio Faonio, Dennis Hofheinz, Luigi Russo

Published Jan 1, 2023• 2 citations
Publisher
DOI
10.1007/978-3-031-31371-4_10

Related papers

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

Public-Key Anamorphism in (CCA-Secure) Public-Key Encryption and Beyond

Giuseppe Persiano, Duong Hieu Phan, Moti M. Yung

Lecture notes in computer science•Jan 1, 2024•18 citations

The Efficient CCA Secure Public-Key Encryption Scheme

Kang Li, Zhiyi Wang

Chinese Journal of Computers•May 19, 2011•3 citations

Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions

Colin Boyd, Jaimee Brown, Juan González Nieto

Faculty of Science and Technology; Information Security Institute•Jan 1, 2006•0 citations

Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption

Takahiro Matsuda, Goichiro Hanaoka, Kanta Matsuura +1 more

Lecture notes in computer science•Jan 1, 2009•1 citation

Receiver Selective Opening CCA Secure Public-key Encryption from Weaker Assumptions

KEISUKE TANAKA, Keisuke Hara, Yi Lu

•Jan 1, 2020•0 citations