Efficient query protocol for database's privacy

DOI10.1007/978-3-642-24999-0_15MaRDI QIDQ2917423zbMATH OpenOpenAlexFDO

Authors Xianping Yuan, Hong Zhong, Lei Yi

Publication date 28 September 2012

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24999-0_15

zbMATH Keywords

commutative encryptionsecure multi-party computationprivacy preservingsecure query

Mathematics Subject Classification ID

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

Recommendations

• Constant-Round Private Database Queries
• Private database access with HE-over-ORAM architecture
• Private database queries using somewhat homomorphic encryption
• scientific article; zbMATH DE number 4051007
• Security improvements of several basic quantum private query protocols with \(O(\log N)\) communication complexity

Cites work

• Public Key Cryptography - PKC 2005

Cited in

(6)

• Robust high capability QKD-based database private query
• Multiuser private queries over encrypted databases
• Enhancing user privacy in SARG04-based private database query protocols
• Constant-Round Private Database Queries
• A practical privacy preserving protocol in database-driven cognitive radio networks
• CPP: towards comprehensive privacy preserving for query processing in information networks

This page was built for publication: Efficient query protocol for database's privacy

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