{"id":{"repo_id":"bu","oai_identifier":"oai:open.bu.edu:2144/53346"},"canonical_url":"https://search.ndltd.org/etd/bu/oai:open.bu.edu:2144/53346","repository":{"repo_id":"bu","name":"Boston University","base_url":"https://open.bu.edu/oai/request"},"display":{"title":"Differentially oblivious outsourced databases: from theory to practice","abstract":"The migration of organizational data to public clouds represents a paradigm shift in resource management, offering cost-effective solutions while raising critical concerns about data security and privacy, particularly for sensitive workloads such as financial transactions and medical records. Although cloud providers offer various security primitives for end-to-end data protection, data processing on the server remains vulnerable to side-channel attacks. Honest-but-curious adversaries, such as the cloud server, can infer sensitive information by analyzing a program's execution transcript, including access patterns (the physical addresses accessed) and communication volumes (the lengths of messages exchanged), even when strong encryption is in place. Oblivious query evaluation has emerged as a promising approach to mitigating such side-channel attacks in encrypted database outsourcing. Differential Obliviousness (DO) requires the execution transcripts to satisfy differential privacy (DP), which enables meaningful processing of the data in the cloud and quantifiable privacy loss. In this dissertation, we introduce data management frameworks designed for static and dynamic data that provide DO guarantees against honest-but-curious adversaries. The framework for static data, leveraging Trusted Execution Environments (TEE) or Secure Multi-Party Computation (MPC) as the underlying security primitive, introduces a comprehensive suite of DO analytical query processing algorithms, built upon novel constructions of Private Data Structures within the atomic DP storage model. The framework offers three key benefits: (1) Bounded privacy loss—enabling efficient query processing, including complex queries such as select-joins and multi-way joins, while maintaining strict privacy guarantees. (2) Lossless processing—ensuring exact responses for non-aggregate queries without data omissions. (3) Nontrivial utility—allowing straightforward implementation of all strategies while achieving a satisfactory trade-off among runtime, storage, and communication volume. The framework for dynamic data extends these capabilities and enables efficient handling of inserts and deletes through adaptive oblivious storage that can dynamically adjust its capacity based on workload demands. Our work represents a step forward toward realizing seamless migration to privacy-preserving outsourced databases.","abstract_html":"The migration of organizational data to public clouds represents a paradigm shift in resource management, offering cost-effective solutions while raising critical concerns about data security and privacy, particularly for sensitive workloads such as financial transactions and medical records. Although cloud providers offer various security primitives for end-to-end data protection, data processing on the server remains vulnerable to side-channel attacks. Honest-but-curious adversaries, such as the cloud server, can infer sensitive information by analyzing a program&#x27;s execution transcript, including access patterns (the physical addresses accessed) and communication volumes (the lengths of messages exchanged), even when strong encryption is in place. Oblivious query evaluation has emerged as a promising approach to mitigating such side-channel attacks in encrypted database outsourcing. Differential Obliviousness (DO) requires the execution transcripts to satisfy differential privacy (DP), which enables meaningful processing of the data in the cloud and quantifiable privacy loss. In this dissertation, we introduce data management frameworks designed for static and dynamic data that provide DO guarantees against honest-but-curious adversaries. The framework for static data, leveraging Trusted Execution Environments (TEE) or Secure Multi-Party Computation (MPC) as the underlying security primitive, introduces a comprehensive suite of DO analytical query processing algorithms, built upon novel constructions of Private Data Structures within the atomic DP storage model. The framework offers three key benefits: (1) Bounded privacy loss—enabling efficient query processing, including complex queries such as select-joins and multi-way joins, while maintaining strict privacy guarantees. (2) Lossless processing—ensuring exact responses for non-aggregate queries without data omissions. (3) Nontrivial utility—allowing straightforward implementation of all strategies while achieving a satisfactory trade-off among runtime, storage, and communication volume. The framework for dynamic data extends these capabilities and enables efficient handling of inserts and deletes through adaptive oblivious storage that can dynamically adjust its capacity based on workload demands. Our work represents a step forward toward realizing seamless migration to privacy-preserving outsourced databases.","abstract_has_math":false,"creators":["Qiu, Lina"],"institution":"Boston University","degree_name":"Doctor of Philosophy","degree_level":"doctoral","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Kollios, George"],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025","date_published":"2025","updated_at":"2026-11-18T20:05:36Z","subjects":["Computer science","Data privacy","Differential privacy","Secure databases"],"languages":["en_US"],"rights":["Attribution-NonCommercial-NoDerivatives 4.0 International"],"rights_urls":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2144/53346","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/2144/53346","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.bu.edu/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopen.bu.edu%3A2144%2F53346","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Kollios, George"]},{"key":"dc:creator","label":"Author","values":["Qiu, Lina"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-07-17T17:31:30Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-07-17T17:31:30Z"]},{"key":"dc:date.issued","label":"Date","values":["2025"]},{"key":"dc:date.updated","label":"Dc Date Updated","values":["2026-07-17T16:15:41Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis/Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Boston University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science","Data privacy","Differential privacy","Secure databases"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution-NonCommercial-NoDerivatives 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://creativecommons.org/licenses/by-nc-nd/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2144/53346"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["2025"]},{"key":"dc:description.abstract","label":"Abstract","values":["The migration of organizational data to public clouds represents a paradigm shift in resource management, offering cost-effective solutions while raising critical concerns about data security and privacy, particularly for sensitive workloads such as financial transactions and medical records. Although cloud providers offer various security primitives for end-to-end data protection, data processing on the server remains vulnerable to side-channel attacks. Honest-but-curious adversaries, such as the cloud server, can infer sensitive information by analyzing a program's execution transcript, including access patterns (the physical addresses accessed) and communication volumes (the lengths of messages exchanged), even when strong encryption is in place. Oblivious query evaluation has emerged as a promising approach to mitigating such side-channel attacks in encrypted database outsourcing. Differential Obliviousness (DO) requires the execution transcripts to satisfy differential privacy (DP), which enables meaningful processing of the data in the cloud and quantifiable privacy loss. In this dissertation, we introduce data management frameworks designed for static and dynamic data that provide DO guarantees against honest-but-curious adversaries. The framework for static data, leveraging Trusted Execution Environments (TEE) or Secure Multi-Party Computation (MPC) as the underlying security primitive, introduces a comprehensive suite of DO analytical query processing algorithms, built upon novel constructions of Private Data Structures within the atomic DP storage model. The framework offers three key benefits: (1) Bounded privacy loss—enabling efficient query processing, including complex queries such as select-joins and multi-way joins, while maintaining strict privacy guarantees. (2) Lossless processing—ensuring exact responses for non-aggregate queries without data omissions. (3) Nontrivial utility—allowing straightforward implementation of all strategies while achieving a satisfactory trade-off among runtime, storage, and communication volume. The framework for dynamic data extends these capabilities and enables efficient handling of inserts and deletes through adaptive oblivious storage that can dynamically adjust its capacity based on workload demands. Our work represents a step forward toward realizing seamless migration to privacy-preserving outsourced databases."]},{"key":"dc:title","label":"Title","values":["Differentially oblivious outsourced databases: from theory to practice"]}]}],"canonical_facts":{"dc:contributor.advisor":["Kollios, George"],"dc:creator":["Qiu, Lina"],"dc:date.accessioned":["2026-07-17T17:31:30Z"],"dc:date.available":["2026-07-17T17:31:30Z"],"dc:date.issued":["2025"],"dc:date.updated":["2026-07-17T16:15:41Z"],"dc:description":["2025"],"dc:description.abstract":["The migration of organizational data to public clouds represents a paradigm shift in resource management, offering cost-effective solutions while raising critical concerns about data security and privacy, particularly for sensitive workloads such as financial transactions and medical records. Although cloud providers offer various security primitives for end-to-end data protection, data processing on the server remains vulnerable to side-channel attacks. Honest-but-curious adversaries, such as the cloud server, can infer sensitive information by analyzing a program's execution transcript, including access patterns (the physical addresses accessed) and communication volumes (the lengths of messages exchanged), even when strong encryption is in place. Oblivious query evaluation has emerged as a promising approach to mitigating such side-channel attacks in encrypted database outsourcing. Differential Obliviousness (DO) requires the execution transcripts to satisfy differential privacy (DP), which enables meaningful processing of the data in the cloud and quantifiable privacy loss. In this dissertation, we introduce data management frameworks designed for static and dynamic data that provide DO guarantees against honest-but-curious adversaries. The framework for static data, leveraging Trusted Execution Environments (TEE) or Secure Multi-Party Computation (MPC) as the underlying security primitive, introduces a comprehensive suite of DO analytical query processing algorithms, built upon novel constructions of Private Data Structures within the atomic DP storage model. The framework offers three key benefits: (1) Bounded privacy loss—enabling efficient query processing, including complex queries such as select-joins and multi-way joins, while maintaining strict privacy guarantees. (2) Lossless processing—ensuring exact responses for non-aggregate queries without data omissions. (3) Nontrivial utility—allowing straightforward implementation of all strategies while achieving a satisfactory trade-off among runtime, storage, and communication volume. The framework for dynamic data extends these capabilities and enables efficient handling of inserts and deletes through adaptive oblivious storage that can dynamically adjust its capacity based on workload demands. Our work represents a step forward toward realizing seamless migration to privacy-preserving outsourced databases."],"dc:identifier.uri":["https://hdl.handle.net/2144/53346"],"dc:language.iso":["en_US"],"dc:rights":["Attribution-NonCommercial-NoDerivatives 4.0 International"],"dc:rights.uri":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"dc:subject":["Computer science","Data privacy","Differential privacy","Secure databases"],"dc:title":["Differentially oblivious outsourced databases: from theory to practice"],"dc:type":["Thesis/Dissertation"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["Boston University"]},"updated_at":"2026-11-18T20:05:36Z"}