Tightness subtleties for multi-user PKE notions

DOI10.1007/978-3-030-92641-0_5zbMath1492.94120OpenAlexW4205467408MaRDI QIDQ2149787

Martijn Stam, Hans Heum

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)

Related Items (1)

Multi-instance secure public-key encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tightly secure signatures and public-key encryption
• A modular analysis of the Fujisaki-Okamoto transformation
• Multi-key authenticated encryption with corruptions: reductions are lossy
• Analyzing multi-key security degradation
• Hybrid encryption in a multi-user setting, revisited
• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• Everybody's a target: scalability in public-key encryption
• Tightly-secure authenticated key exchange, revisited
• Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
• On tightly secure primitives in the multi-instance setting
• Highly efficient key exchange protocols with optimal tightness
• Selective Opening Security for Receivers
• Tightly CCA-Secure Encryption Without Pairings
• Notions of Black-Box Reductions, Revisited
• Multi-instance Security and Its Application to Password-Based Cryptography
• Standard Security Does Not Imply Indistinguishability Under Selective Opening
• Magic Functions
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Tightly-Secure Authenticated Key Exchange
• Why Proving HIBE Systems Secure Is Difficult
• Theory of Cryptography
• On the Impossibility of Tight Cryptographic Reductions
• Theory of Cryptography

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