Equivalence Between Non-malleability Against Replayable CCA and Other RCCA-Security Notions

DOI10.1007/978-3-030-26834-3_15MaRDI QIDQ6488937zbMATH OpenFDO

Authors Fuyuki Kitagawa, Yusuke Sakai, Goichiro Hanaoka, Kanta Matsuura

Publication date 14 March 2024

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Advances in Cryptology - CRYPTO 2003
• Revisiting (R)CCA security and replay protection
• Theory of Cryptography
• Natural sd-RCCA secure public-key encryptions
• Publication:4941877

Cites work

• scientific article; zbMATH DE number 1302836 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Characterization of security notions for probabilistic private-key encryption
• Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks
• Malleable proof systems and applications
• Probabilistic encryption
• RCCA-secure multi-use bidirectional proxy re-encryption with master secret security
• Relations Among Notions of Non-malleability for Encryption
• Rerandomizable RCCA Encryption
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• Tag-KEM/DEM: A new framework for hybrid encryption
• Theory of Cryptography
• Theory of Cryptography
• Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption

This page was built for publication: Equivalence Between Non-malleability Against Replayable CCA and Other RCCA-Security Notions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488937)