Updatable public key encryption in the standard model

DOI10.1007/978-3-030-90456-2_9OpenAlexW3214633161MaRDI QIDQ2697895

Yevgeniy Dodis, Harish Karthikeyan, Daniel Wichs

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_9

zbMATH Keywords

forward securityhierarchical identity-based encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Multicast key agreement, revisited ⋮ Unique-path identity based encryption with applications to strongly secure messaging ⋮ Unidirectional updatable encryption and proxy re-encryption from DDH ⋮ A more complete analysis of the signal double ratchet algorithm ⋮ Forward-secure encryption with fast forwarding ⋮ Strongly anonymous ratcheted key exchange

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Key-dependent message security: generic amplification and completeness
• Anonymous IBE, leakage resilience and circular security from new assumptions
• Updatable encryption with post-compromise security
• Towards bidirectional ratcheted key exchange
• Optimal channel security against fine-grained state compromise: the safety of messaging
• Key rotation for authenticated encryption
• Identity-based encryption from the Diffie-Hellman assumption
• From selective IBE to full IBE and selective HIBE
• Bonsai trees, or how to delegate a lattice basis
• Security analysis and improvements for the IETF MLS standard for group messaging
• Fast and secure updatable encryption
• (R)CCA secure updatable encryption with integrity protection
• Efficient ratcheting: almost-optimal guarantees for secure messaging
• Key Homomorphic PRFs and Their Applications
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Circular and KDM Security for Identity-Based Encryption
• Black-Box Circular-Secure Encryption beyond Affine Functions
• Efficient Circuit-Size Independent Public Key Encryption with KDM Security
• Efficient Public-Key Cryptography in the Presence of Key Leakage
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Public-Key Encryption Schemes with Auxiliary Inputs
• Trapdoors for hard lattices and new cryptographic constructions
• Bounded Key-Dependent Message Security
• Efficient Lattice (H)IBE in the Standard Model
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular-Secure Encryption from Decision Diffie-Hellman
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Hierarchical ID-Based Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Public-Key Cryptosystems Resilient to Key Leakage
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Updatable public key encryption in the standard model