Parallel decryption queries in bounded chosen ciphertext attacks

DOI10.1007/978-3-642-19379-8_15MaRDI QIDQ3084351zbMATH OpenOpenAlexFDO

Authors Takahiro Matsuda, Kanta Matsuura

Publication date 15 March 2011

Published in Public Key Cryptography – PKC 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19379-8_15

zbMATH Keywords

public key encryptionblack-box constructionbounded CCA securityparallel decryption queryrelations among security notions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Bounded CCA2-Secure Encryption
• Advances in Cryptology - CRYPTO 2003
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Security in Communication Networks

Cited in

(8)

• Bounded CCA2-Secure Encryption
• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• Detecting dangerous queries: a new approach for chosen ciphertext security
• A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
• Counting Keys in Parallel After a Side Channel Attack
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• Indistinguishability against chosen ciphertext verification attack revisited: the complete picture
• Ciphertext-only attack on \(d\times d\) Hill in \(O(d 13^d)\)

This page was built for publication: Parallel decryption queries in bounded chosen ciphertext attacks

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