Request-based comparable encryption

DOI10.1007/978-3-642-40203-6_8MaRDI QIDQ2925564zbMATH OpenOpenAlexFDO

Authors Jun Furukawa

Publication date 16 October 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40203-6_8

zbMATH Keywords

database encryptionorder-preserving encryptionrange queryrequest-based

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Short comparable encryption
• Efficient request-based comparable encryption scheme based on sliding window method
• An Almost Non-interactive Order Preserving Encryption Scheme
• Order-Preserving Symmetric Encryption
• Order-preserving encryption revisited: improved security analysis and alternative solutions

Cited in

(5)

• Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation
• A reusable and single-interactive model for secure approximate k-nearest neighbor query in cloud
• Efficient request-based comparable encryption scheme based on sliding window method
• Short comparable encryption
• An Almost Non-interactive Order Preserving Encryption Scheme

This page was built for publication: Request-based comparable encryption

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