On the deductive security of queries to databases with multi-bit records

DOI10.3103/S0278641918010028zbMath1397.68040OpenAlexW2783245471MaRDI QIDQ1789206

Yanyan Li

Publication date: 10 October 2018

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641918010028

zbMATH Keywords

complexitydatabasecloud computingdeductive securityhomomorphic cryptosystem

Mathematics Subject Classification ID

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

Cites Work

• On the existence of provably secure cloud computing systems
• On the deductive security of queries to confidential databases in cloud computing systems
• Secure cloud computing based on threshold homomorphic encryption
• Private Database Queries Using Somewhat Homomorphic Encryption
• Fully Homomorphic Encryption with Polylog Overhead
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Fully homomorphic encryption using ideal lattices
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

This page was built for publication: On the deductive security of queries to databases with multi-bit records