More efficient construction of bounded KDM secure encryption

DOI10.1007/978-3-319-61204-1_18MaRDI QIDQ6487209zbMATH OpenFDO

Authors Kaoru Kurosawa

Publication date 1 July 2022

Full work available at URL https://doi.org/10.1007/978-3-319-61204-1_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Bounded key-dependent message security
• Efficient circuit-size independent public key encryption with KDM security
• Bounded KDM security from iO and OWF
• Efficient key dependent message security amplification against chosen ciphertext attacks
• scientific article; zbMATH DE number 1951605

Cites work

• Bounded key-dependent message security
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular-Secure Encryption from Decision Diffie-Hellman
• Efficient circuit-size independent public key encryption with KDM security
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Key-dependent message security: generic amplification and completeness
• Universal circuits (Preliminary Report)

Cited in

(5)

• How to prove KDM security of BHHO
• KDM-secure public-key encryption from constant-noise LPN
• Bounded KDM security from iO and OWF
• Efficient circuit-size independent public key encryption with KDM security
• Bounded key-dependent message security

This page was built for publication: More efficient construction of bounded KDM secure encryption

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