The direction of updatable encryption does matter

DOI10.1007/978-3-030-97131-1_7zbMath1519.94180MaRDI QIDQ6169034

Ryo Nishimaki

Publication date: 10 August 2023

Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-97131-1_7

zbMATH Keywords

lattice; key update; updatable encryption

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Unidirectional updatable encryption and proxy re-encryption from DDH, Backward-leak uni-directional updatable encryption from (homomorphic) public key encryption, Updatable searchable symmetric encryption: definitions and constructions, The direction of updatable encryption does matter, Epoch confidentiality in updatable encryption, No-directional and backward-leak uni-directional updatable encryption are equivalent

Cites Work

• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Updatable encryption with post-compromise security
• Key rotation for authenticated encryption
• Universal proxy re-encryption
• Fast and secure updatable encryption
• Symmetric primitives with structured secrets
• (R)CCA secure updatable encryption with integrity protection
• The direction of updatable encryption does not matter much
• Improving speed and security in updatable encryption schemes
• CCA updatable encryption against malicious re-encryption attacks
• Key Homomorphic PRFs and Their Applications
• Key-Private Proxy Re-encryption under LWE
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions
• Packed Ciphertexts in LWE-Based Homomorphic Encryption
• How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• On the (im)possibility of obfuscating programs
• Re-encryption, Functional Re-encryption, and Multi-hop Re-encryption: A Framework for Achieving Obfuscation-Based Security and Instantiations from Lattices
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
• On lattices, learning with errors, random linear codes, and cryptography
• Indistinguishability obfuscation from well-founded assumptions
• The direction of updatable encryption does matter