Open AccessProceedings Article
Answering aggregation queries in a secure system model
Tingjian Ge,Stan Zdonik +1 more
- pp 519-530
TLDR
A comprehensive study on answering SUM and AVG aggregation queries in a read-optimized DBMS for data warehousing applications by using a secure homomorphic encryption scheme in a novel way, demonstrating that the performance of such a solution is comparable to a traditional symmetric encryption scheme.Abstract:
As more sensitive data is captured in electronic form, security becomes more and more important. Data encryption is the main technique for achieving security. While in the past enterprises were hesitant to implement database encryption because of the very high cost, complexity, and performance degradation, they now have to face the ever-growing risk of data theft as well as emerging legislative requirements. Data encryption can be done at multiple tiers within the enterprise. Different choices on where to encrypt the data offer different security features that protect against different attacks. One class of attack that needs to be taken seriously is the compromise of the database server, its software or administrator. A secure way to address this threat is for a DBMS to directly process queries on the ciphertext, without decryption. We conduct a comprehensive study on answering SUM and AVG aggregation queries in such a system model by using a secure homomorphic encryption scheme in a novel way. We demonstrate that the performance of such a solution is comparable to a traditional symmetric encryption scheme (e.g., DES) in which each value is decrypted and the computation is performed on the plaintext. Clearly this traditional encryption scheme is not a viable solution to the problem because the server must have access to the secret key and the plaintext, which violates our system model and security requirements. We study the problem in the setting of a read-optimized DBMS for data warehousing applications, in which SUM and AVG are frequent and crucial.read more
Citations
More filters
Proceedings ArticleDOI
CryptDB: protecting confidentiality with encrypted query processing
TL;DR: The evaluation shows that CryptDB has low overhead, reducing throughput by 14.5% for phpBB, a web forum application, and by 26% for queries from TPC-C, compared to unmodified MySQL.
Journal Article
Data Management in the Cloud: Limitations and Opportunities.
TL;DR: There exist an increasing number of large companies that are offering cloud computing infrastructure products and services that do not entirely resemble the visions of these individual compo- firms.
Journal ArticleDOI
Processing analytical queries over encrypted data
TL;DR: MONOMI introduces split client/server query execution, which can execute arbitrarily complex queries over encrypted data, as well as several techniques that improve performance for such workloads, including per-row precomputation, space-efficient encryption, grouped homomorphic addition, and pre-filtering.
Proceedings Article
BatchCrypt: Efficient homomorphic encryption for cross-silo federated learning
TL;DR: BatchCrypt is presented, a system solution for cross-silo FL that substantially reduces the encryption and communication overhead caused by HE, and develops new quantization and encoding schemes along with a novel gradient clipping technique.
Proceedings ArticleDOI
TrustedDB: a trusted hardware based database with privacy and data confidentiality
Sumeet Bajaj,Radu Sion +1 more
TL;DR: TrustedDB is an outsourced database prototype that allows clients to execute SQL queries with privacy and under regulatory compliance constraints by leveraging server-hosted, tamper-proof trusted hardware in critical query processing stages, thereby removing any limitations on the type of supported queries.
References
More filters
Book ChapterDOI
Public-key cryptosystems based on composite degree residuosity classes
TL;DR: A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.
Proceedings ArticleDOI
Practical techniques for searches on encrypted data
TL;DR: This work describes the cryptographic schemes for the problem of searching on encrypted data and provides proofs of security for the resulting crypto systems, and presents simple, fast, and practical algorithms that are practical to use today.
Journal ArticleDOI
An overview of data warehousing and OLAP technology
Surajit Chaudhuri,Umeshwar Dayal +1 more
TL;DR: An overview of data warehousing and OLAP technologies, with an emphasis on their new requirements, is provided, based on a tutorial presented at the VLDB Conference, 1996.
Journal ArticleDOI
Modular multiplication without trial division
TL;DR: A method for multiplying two integers modulo N while avoiding division by N, a representation of residue classes so as to speed modular multiplication without affecting the modular addition and subtraction algorithms.
Book
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Michael Mitzenmacher,Eli Upfal +1 more
TL;DR: Preface 1. Events and probability 2. Discrete random variables and expectation 3. Moments and deviations 4. Chernoff bounds 5. Balls, bins and random graphs 6. Probabilistic method 7. Markov chains and random walks 8. Continuous distributions and the Poisson process