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

DOI10.1007/978-3-030-26834-3_15MaRDI QIDQ6488937FDOQ6488937

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

Publication date: 14 March 2024

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

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)