An efficient query recovery attack against a graph encryption scheme

DOI10.1007/978-3-031-17140-6_16MaRDI QIDQ6173294zbMATH OpenOpenAlexFDO

Authors Francesca Falzon, Kenneth G. Paterson

Publication date 21 July 2023

Published in Computer Security – ESORICS 2022 (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/20.500.11850/564478

zbMATH Keywords

attackscryptanalysisencrypted databases

Mathematics Subject Classification ID

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

Recommendations

• SecGDB: graph encryption for exact shortest distance queries with efficient updates
• PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
• Structured encryption and controlled disclosure
• scientific article; zbMATH DE number 4035882
• Private analysis of graph structure

Cites work

• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• Introduction to algorithms.
• SecGDB: graph encryption for exact shortest distance queries with efficient updates
• Structured encryption and controlled disclosure
• Structured encryption for conceptual graphs

Cited in

(2)

• PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
• SecGDB: graph encryption for exact shortest distance queries with efficient updates

This page was built for publication: An efficient query recovery attack against a graph encryption scheme

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