On IND-CCA security modeling in cryptographic protocols

MaRDI QIDQ3421466zbMATH OpenFDO

Authors Dennis Hofheinz, Joern Mueller-Quade, Rainer Steinwandt

Publication date 13 February 2007

zbMATH Keywords

cryptographic protocolsformal cryptographyprobabilistic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1618038
• Cryptography and Coding
• Relaxing IND-CCA: indistinguishability against chosen ciphertext verification attack
• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• Security in Communication Networks

Cited in

(13)

• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• Revisiting (R)CCA security and replay protection
• Joint state composition theorems for public-key encryption and digital signature functionalities with local computation
• scientific article; zbMATH DE number 1618038 (Why is no real title available?)
• An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model
• Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks
• Relaxing IND-CCA: indistinguishability against chosen ciphertext verification attack
• Initiator-resilient universally composable key exchange
• Efficient KEMs with Partial Message Recovery
• Towards Key-Dependent Message Security in the Standard Model
• Long-term security and universal composability
• A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels
• Public‐Key Encryption and Security Notions

This page was built for publication: On IND-CCA security modeling in cryptographic protocols

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