{"id":{"repo_id":"ohiolink","oai_identifier":"oai:etd.ohiolink.edu:bgsu1363638271"},"canonical_url":"https://search.dev.ndltd.org/etd/ohiolink/oai:etd.ohiolink.edu:bgsu1363638271","repository":{"repo_id":"ohiolink","name":"OhioLINK","base_url":"https://etd.ohiolink.edu/acprod/odb_etd/ws/oai/oai"},"display":{"title":"Bucketization Techniques for Encrypted Databases: Quantifying the Impact of Query Distributions","abstract":"An ongoing problem in Database As a Service (DAS) is how to increase the efficiency of retrieving encrypted data from remote untrusted servers without compromising security. Bucketization is a privacy preserving technique for executing SQL queries over encrypted data on a DAS server. Bucketization partitions encrypted attributes into queryable tables (buckets), thereby disguising which records are requested. While a number of bucketization techniques are optimized for uniform query access, many Internet and private network access patterns reflect a non-uniform or Zipf-like trend. If query access is non-uniform, existing techniques may be subject to substantial performance degradation. In order to evaluate that possibility, this thesis presents new bucketization technique, Query Sensitive Bucketization (QSB), that capitalizes on the probability distribution of non-uniform queries. Two existing uniform bucketization techniques were implemented to (1) evaluate their performance when the distribution of queries is non-uniform, and (2) evaluate their performance relative to QSB. Among the measures used for performance analysis, a new security metric is presented, which quantifies the risk of an adversary estimating the true value distribution of an encrypted data store. Unlike existing security metrics, the new metric expresses information disclosed by the pattern of query access over an encrypted bucket set. Results showed that QSB improves query efficiency over uniform techniques, while maintaining a high level of data security. QSB is not only an efficient example of query-based bucketization for DAS, but a conceptual model for future research, in which data are organized to accommodate a variety of query access patterns, thereby improving query efficiency and database security.","abstract_html":"An ongoing problem in Database As a Service (DAS) is how to increase the efficiency of retrieving encrypted data from remote untrusted servers without compromising security. Bucketization is a privacy preserving technique for executing SQL queries over encrypted data on a DAS server. Bucketization partitions encrypted attributes into queryable tables (buckets), thereby disguising which records are requested. While a number of bucketization techniques are optimized for uniform query access, many Internet and private network access patterns reflect a non-uniform or Zipf-like trend. If query access is non-uniform, existing techniques may be subject to substantial performance degradation. In order to evaluate that possibility, this thesis presents new bucketization technique, Query Sensitive Bucketization (QSB), that capitalizes on the probability distribution of non-uniform queries. Two existing uniform bucketization techniques were implemented to (1) evaluate their performance when the distribution of queries is non-uniform, and (2) evaluate their performance relative to QSB. Among the measures used for performance analysis, a new security metric is presented, which quantifies the risk of an adversary estimating the true value distribution of an encrypted data store. Unlike existing security metrics, the new metric expresses information disclosed by the pattern of query access over an encrypted bucket set. Results showed that QSB improves query efficiency over uniform techniques, while maintaining a high level of data security. QSB is not only an efficient example of query-based bucketization for DAS, but a conceptual model for future research, in which data are organized to accommodate a variety of query access patterns, thereby improving query efficiency and database security.","abstract_has_math":false,"creators":["Raybourn, Tracey"],"institution":"Bowling Green State University","degree_name":"Master of Science (MS)","degree_level":"masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kresman, Ray"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-05-06","date_published":"2013-05-06","updated_at":"2026-07-24T03:37:01Z","subjects":["Computer Science","Database security","Query Distributions","Database Bucketization","Data Privacy"],"languages":["English"],"rights":["unrestricted","This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1363638271","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kresman, Ray"]},{"key":"dc:creator","label":"Author","values":["Raybourn, Tracey"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013-05-06"]},{"key":"dc:publisher","label":"Institution","values":["Bowling Green State University / OhioLINK"]},{"key":"dc:type","label":"Dc Type","values":["Electronic Thesis or Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Bowling Green State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science","Database security","Query Distributions","Database Bucketization","Data Privacy"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["unrestricted","This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1363638271"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["An ongoing problem in Database As a Service (DAS) is how to increase the efficiency of retrieving encrypted data from remote untrusted servers without compromising security. Bucketization is a privacy preserving technique for executing SQL queries over encrypted data on a DAS server. Bucketization partitions encrypted attributes into queryable tables (buckets), thereby disguising which records are requested. While a number of bucketization techniques are optimized for uniform query access, many Internet and private network access patterns reflect a non-uniform or Zipf-like trend. If query access is non-uniform, existing techniques may be subject to substantial performance degradation. In order to evaluate that possibility, this thesis presents new bucketization technique, Query Sensitive Bucketization (QSB), that capitalizes on the probability distribution of non-uniform queries. Two existing uniform bucketization techniques were implemented to (1) evaluate their performance when the distribution of queries is non-uniform, and (2) evaluate their performance relative to QSB. Among the measures used for performance analysis, a new security metric is presented, which quantifies the risk of an adversary estimating the true value distribution of an encrypted data store. Unlike existing security metrics, the new metric expresses information disclosed by the pattern of query access over an encrypted bucket set. Results showed that QSB improves query efficiency over uniform techniques, while maintaining a high level of data security. QSB is not only an efficient example of query-based bucketization for DAS, but a conceptual model for future research, in which data are organized to accommodate a variety of query access patterns, thereby improving query efficiency and database security."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf","p.88","1.77 MB"]},{"key":"dc:title","label":"Title","values":["Bucketization Techniques for Encrypted Databases: Quantifying the Impact of Query Distributions"]}]}],"canonical_facts":{"dc:contributor":["Kresman, Ray"],"dc:creator":["Raybourn, Tracey"],"dc:date":["2013-05-06"],"dc:description":["An ongoing problem in Database As a Service (DAS) is how to increase the efficiency of retrieving encrypted data from remote untrusted servers without compromising security. Bucketization is a privacy preserving technique for executing SQL queries over encrypted data on a DAS server. Bucketization partitions encrypted attributes into queryable tables (buckets), thereby disguising which records are requested. While a number of bucketization techniques are optimized for uniform query access, many Internet and private network access patterns reflect a non-uniform or Zipf-like trend. If query access is non-uniform, existing techniques may be subject to substantial performance degradation. In order to evaluate that possibility, this thesis presents new bucketization technique, Query Sensitive Bucketization (QSB), that capitalizes on the probability distribution of non-uniform queries. Two existing uniform bucketization techniques were implemented to (1) evaluate their performance when the distribution of queries is non-uniform, and (2) evaluate their performance relative to QSB. Among the measures used for performance analysis, a new security metric is presented, which quantifies the risk of an adversary estimating the true value distribution of an encrypted data store. Unlike existing security metrics, the new metric expresses information disclosed by the pattern of query access over an encrypted bucket set. Results showed that QSB improves query efficiency over uniform techniques, while maintaining a high level of data security. QSB is not only an efficient example of query-based bucketization for DAS, but a conceptual model for future research, in which data are organized to accommodate a variety of query access patterns, thereby improving query efficiency and database security."],"dc:format":["application/pdf","p.88","1.77 MB"],"dc:identifier":["http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1363638271"],"dc:language":["English"],"dc:publisher":["Bowling Green State University / OhioLINK"],"dc:rights":["unrestricted","This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws."],"dc:subject":["Computer Science","Database security","Query Distributions","Database Bucketization","Data Privacy"],"dc:title":["Bucketization Techniques for Encrypted Databases: Quantifying the Impact of Query Distributions"],"dc:type":["Electronic Thesis or Dissertation"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science (MS)"],"thesis:institution_name":["Bowling Green State University"]},"updated_at":"2026-07-24T03:37:01Z"}