Tightness subtleties for multi-user PKE notions

DOI10.1007/978-3-030-92641-0_5MaRDI QIDQ2149787zbMATH OpenOpenAlexFDO

Authors Hans Heum, Martijn Stam

Publication date 29 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-92641-0_5

zbMATH Keywords

indistinguishabilitypublic key encryptionmulti-user securityadaptive corruptions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
• Generalized public-key cryptography with tight security
• scientific article; zbMATH DE number 5009203
• New security notions and relations for public-key encryption
• Memory-tight multi-challenge security of public-key encryption

Cites work

• scientific article; zbMATH DE number 5009203 (Why is no real title available?)
• scientific article; zbMATH DE number 1302834 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1302836 (Why is no real title available?)
• A modular analysis of the Fujisaki-Okamoto transformation
• Analyzing multi-key security degradation
• Everybody's a target: scalability in public-key encryption
• Highly efficient key exchange protocols with optimal tightness
• Hybrid encryption in a multi-user setting, revisited
• Introduction to modern cryptography
• Magic functions
• Multi-instance security and its application to password-based cryptography
• Multi-key authenticated encryption with corruptions: reductions are lossy
• Notions of black-box reductions, revisited
• On the impossibility of tight cryptographic reductions
• On tightly secure primitives in the multi-instance setting
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Selective Opening Security for Receivers
• Standard security does not imply indistinguishability under selective opening
• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• Theory of Cryptography
• Theory of Cryptography
• Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
• Tightly CCA-secure encryption without pairings
• Tightly secure signatures and public-key encryption
• Tightly-secure authenticated key exchange
• Tightly-secure authenticated key exchange, revisited
• Why Proving HIBE Systems Secure Is Difficult

Cited in

(4)

• Generalized public-key cryptography with tight security
• Multi-instance secure public-key encryption
• SoK: public key encryption with openings
• Another look at tightness. II: Practical issues in cryptography

This page was built for publication: Tightness subtleties for multi-user PKE notions

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