Multi-user dynamic searchable encryption for prefix-fixing predicates from symmetric-key primitives

DOI10.1007/978-3-031-82852-2_5MaRDI QIDQ6970685zbMATH OpenFDO

Authors Takato Hirano, Yutaka Kawai, Yoshihiro Koseki, Satoshi Yasuda, Yohei Watanabe, Takumi Amada, Mitsugu Iwamoto, Kazuo Ohta

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-82852-2_5

zbMATH Keywords

access controlmulti-user dynamic searchable symmetric encryptionprefix-fixing predicates

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• An efficient key-policy attribute-based searchable encryption in prime-order groups
• An efficient non-interactive multi-client searchable encryption with support for Boolean queries
• Ciphertext-policy delegatable hidden vector encryption and its application to searchable encryption in multi-user setting
• Constrained pseudorandom functions and their applications
• Dynamic searchable symmetric encryption with minimal leakage and efficient updates on commodity hardware
• Functional signatures and pseudorandom functions
• Fuzzy Identity-Based Encryption
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)

This page was built for publication: Multi-user dynamic searchable encryption for prefix-fixing predicates from symmetric-key primitives

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