Demo Data from SIGIR 2026 / reviewers in the wild / expert
Peeyush Gupta
dblp:243/6098
· DBLP profile ↗
19ranked-venue papers
6as first author
14since 2021 · last 2025
0000-0001-5160-5446ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 10 · 5 first-author · 8 since 2021Security and privacy · 4 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1Software engineering, systems software and programming languages · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
6 papers |
Query processing and optimization · 39% Distributed and cloud data management · 15% Data models and query languages · 13% | |
| Network and information security
7 papers |
Cryptographic protocols and secure computation · 79% Privacy and data protection · 21% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Performance modeling and evaluation · 100% |
Topics — the 29 heaviest of 32, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
secret sharing |
2.7 | 5 | 2024 | Prism: Privacy-Preserving and Verifiable Set Computation Over Multi-Owner Secret Shared Outsourced Databases · IEEE Trans. Dependable Secur. Comput. 2024 Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries on Secret-Shared Outsourced Data · IEEE Trans. Knowl. Data Eng. 2022 Privacy-Preserving Secret Shared Computations Using MapReduce · IEEE Trans. Dependable Secur. Comput. 2021 |
Cryptographic protocols and secure computation › secure outsourcing
outsourced database computation |
1.3 | 2 | 2024 | Prism: Privacy-Preserving and Verifiable Set Computation Over Multi-Owner Secret Shared Outsourced Databases · IEEE Trans. Dependable Secur. Comput. 2024 PRISM: Private Verifiable Set Computation over Multi-Owner Outsourced Databases · SIGMOD Conference 2021 |
Cryptographic protocols and secure computation
secure multiparty computation |
0.9 | 2 | 2021 | PRISM: Private Verifiable Set Computation over Multi-Owner Outsourced Databases · SIGMOD Conference 2021 Obscure: Information-Theoretic Oblivious and Verifiable Aggregation Queries · Proc. VLDB Endow. 2019 |
Query processing and optimization
analytical query processing |
0.9 | 1 | 2025 | Cloudy With a Chance of JSON · Proc. VLDB Endow. 2025 |
Query processing and optimization › query execution › query operator implementation
columnar execution |
0.9 | 1 | 2025 | Cloudy With a Chance of JSON · Proc. VLDB Endow. 2025 |
Distributed and cloud data management › cloud database
database-as-a-service |
0.9 | 1 | 2025 | Cloudy With a Chance of JSON · Proc. VLDB Endow. 2025 |
Information retrieval › document processing › document analysis
document modeling |
0.9 | 1 | 2025 | Towards Principled, Practical Document Database Design · Proc. VLDB Endow. 2025 |
Data models and query languages › NoSQL database
document-oriented database |
0.9 | 1 | 2025 | Cloudy With a Chance of JSON · Proc. VLDB Endow. 2025 |
Database system architecture and tuning › database design
NoSQL schema design |
0.9 | 1 | 2025 | Towards Principled, Practical Document Database Design · Proc. VLDB Endow. 2025 |
Query processing and optimization
secure query processing |
0.6 | 1 | 2022 | Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries on Secret-Shared Outsourced Data · IEEE Trans. Knowl. Data Eng. 2022 |
Privacy and data protection › privacy-preserving computation
privacy-preserving network measurement |
0.6 | 1 | 2022 | Quest: Privacy-Preserving Monitoring of Network Data: A System for Organizational Response to Pandemics · IEEE Trans. Serv. Comput. 2022 |
Cryptographic protocols and secure computation
verifiable computation |
0.6 | 1 | 2022 | Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries on Secret-Shared Outsourced Data · IEEE Trans. Knowl. Data Eng. 2022 |
Performance modeling and evaluation › simulation
discrete-event simulation |
0.6 | 1 | 2022 | SmartSPEC: Customizable Smart Space Datasets via Event-driven Simulations · PerCom 2022 |
Performance modeling and evaluation
simulation |
0.6 | 1 | 2022 | SmartSPEC: Customizable Smart Space Datasets via Event-driven Simulations · PerCom 2022 |
Distributed and cloud data management › mapreduce
mapreduce query processing |
0.5 | 1 | 2021 | Privacy-Preserving Secret Shared Computations Using MapReduce · IEEE Trans. Dependable Secur. Comput. 2021 |
Privacy and data protection
privacy-preserving query processing |
0.5 | 1 | 2021 | Privacy-Preserving Secret Shared Computations Using MapReduce · IEEE Trans. Dependable Secur. Comput. 2021 |
Internet of things and sensor networks
iot data management |
0.4 | 1 | 2020 | A privacy-enabled platform for COVID-19 applications: poster abstract · SenSys 2020 |
Cryptographic protocols and secure computation
secure query processing |
0.4 | 1 | 2019 | Obscure: Information-Theoretic Oblivious and Verifiable Aggregation Queries · Proc. VLDB Endow. 2019 |
Data models and query languages
conceptual modeling |
0.3 | 1 | 2025 | Towards Principled, Practical Document Database Design · Proc. VLDB Endow. 2025 |
Database theory
normal forms |
0.3 | 1 | 2025 | Towards Principled, Practical Document Database Design · Proc. VLDB Endow. 2025 |
Cryptographic protocols and secure computation
private set intersection |
0.2 | 1 | 2024 | Prism: Privacy-Preserving and Verifiable Set Computation Over Multi-Owner Secret Shared Outsourced Databases · IEEE Trans. Dependable Secur. Comput. 2024 |
Data mining › spatiotemporal data mining › trajectory data mining
human mobility modeling |
0.2 | 1 | 2022 | SmartSPEC: Customizable Smart Space Datasets via Event-driven Simulations · PerCom 2022 |
Query processing and optimization
interactive data exploration |
0.2 | 1 | 2022 | JENNER: Just-in-time Enrichment in Query Processing · Proc. VLDB Endow. 2022 |
Spatial and temporal data management › trajectory data management
trajectory generation |
0.2 | 1 | 2022 | SmartSPEC: Customizable Smart Space Datasets via Event-driven Simulations · PerCom 2022 |
Privacy and data protection › privacy-preserving computation
access pattern hiding |
0.2 | 1 | 2022 | Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries on Secret-Shared Outsourced Data · IEEE Trans. Knowl. Data Eng. 2022 |
Query processing and optimization
SQL query processing |
0.1 | 1 | 2021 | Privacy-Preserving Secret Shared Computations Using MapReduce · IEEE Trans. Dependable Secur. Comput. 2021 |
Privacy and data protection › privacy-preserving data sharing
privacy-preserving data outsourcing |
0.1 | 1 | 2021 | PRISM: Private Verifiable Set Computation over Multi-Owner Outsourced Databases · SIGMOD Conference 2021 |
Privacy and data protection › privacy-preserving data analysis
privacy-preserving data collection |
0.1 | 1 | 2020 | A privacy-enabled platform for COVID-19 applications: poster abstract · SenSys 2020 |
Privacy and data protection
query privacy |
0.1 | 1 | 2019 | Obscure: Information-Theoretic Oblivious and Verifiable Aggregation Queries · Proc. VLDB Endow. 2019 |
Methods — techniques the papers use, named apart from their topics
secret sharing · 2.4secure multiparty computation · 2.3result verification · 1.6semantic modeling · 1.1machine learning · 1.1event-driven simulation · 1.1differential privacy · 1.1mapreduce · 1.0shared-nothing architecture · 0.9conceptual modeling · 0.9anti-pattern analysis · 0.9iot data collection and management · 0.9progressive query processing · 0.6shamir's secret sharing · 0.5information-theoretic security · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Towards Principled, Practical Document Database DesignabstractRelational database design is a well-understood process enabled by a combination of database theory (e.g., normal forms) as well as conceptual modeling (e.g., ER-based design). In contrast, database design for NoSQL databases, notably document databases, is often approached in a much more ad hoc manner. It is frequently driven by application details and physical considerations that muddy the design process in ways all too reminiscent of the pre-relational database era. In this paper, we argue for a return to sanity - for a logical, data-first, conceptually grounded approach to document database design. We explain how such an approach can work, yielding a clean, query-friendly document database design. We also highlight a collection of document (JSON) anti-patterns to avoid. The process and the anti-patterns both stem from the authors' experiences in current and past lives when dealing with a wide variety of JSON document data from commercial applications, government applications, and university research applications. Michael J. Carey 0001, Wail Y. Alkowaileet, Nick Digeronimo, Peeyush Gupta, Sachin Smotra, Till Westmann |
Proc. VLDB Endow. | 4 |
| 2025 | Cloudy With a Chance of JSONabstractCouchbase Capella is a scalable document-oriented database service in the cloud. Its existing Capella Operational service is based on a shared-nothing architecture and supports high volumes of low-latency queries and updates for JSON documents. Its new Capella Columnar cloud service complements the Operational service. The Capella Columnar service supports complex analytical queries (e.g., ad hoc joins and aggregations) over large collections of JSON documents that can originate from a variety of Couchbase and non-Couchbase data sources and formats and can either be stored and managed by the Capella Columnar service or externally stored and accessed on demand at query time. This paper describes the new Capella Columnar service, looking both over and under the hood. Murtadha Al Hubail, Ali Alsuliman, Wail Y. Alkowaileet, Michael Blow, Michael J. Carey 0001, Savyasach Enukonda, Peeyush Gupta, Santosh Hegde, Kamini Jagtiani, Abhishek Jindal, Nawazish Kahn, Mehnaz Tabassum Mahin, Ian Maxon, M. Muralikrishna, Keshav Murthy, Preetham Poluparthi, Ankit Prabhu, Ritik Raj, Vijay Sarathy, Shahrzad Shirazi, Utsav Singh, Hussain Towaileb, Ayush Tripathi, Janhavi Tripurwar, Bo-Chun Wang, Till Westmann |
Proc. VLDB Endow. | 7 |
| 2024 | Prism: Privacy-Preserving and Verifiable Set Computation Over Multi-Owner Secret Shared Outsourced DatabasesabstractPrivate set computation over multi-owner databases is an important problem with many applications — the most well studied of which is private set intersection (PSI). This paper proposesPrism, a secret-sharing based approach to compute private set operations (i.e., intersection and union, as well as aggregates such as count, sum, average, maximum, minimum, and median) over outsourced databases belonging to multiple owners.Prismenables data owners to pre-load the data onto non-colluding servers and exploits the additive and multiplicative properties of secret-shares to compute the above-listed operations.Prismtakes (at most) two rounds of communication between non-colluding servers (storing the secret-shares) and the querier for executing the above-mentioned operations, resulting in a very efficient implementation.Prismalso supports result verification techniques for each operation to detect malicious adversaries. Experimental results show thatPrismscales both in terms of the number of data owners and database sizes, to which prior approaches do not scale. Shantanu Sharma 0001, Yin Li 0001, Sharad Mehrotra, Nisha Panwar, Peeyush Gupta, Dhrubajyoti Ghosh |
IEEE Trans. Dependable Secur. Comput. | 5 |
| 2023 | Supporting Complex Query Time Enrichment For Analytics
Dhrubajyoti Ghosh, Peeyush Gupta, Sharad Mehrotra, Shantanu Sharma 0001 |
EDBT | 2 |
| 2023 | SmartSPEC: A framework to generate customizable, semantics-based smart space datasetsabstractThis paper presents SmartSPEC, an approach to generate customizable synthetic smart space datasets using sensorized spaces in which people and events are embedded. Smart space datasets are critical to design, deploy and evaluate systems and applications under issues of heterogeneity, scalability and robustness, leading to cost-effective operation which improves the safety, comfort and convenience experienced by space occupants. However, many challenges exist in obtaining realistic smart space datasets for testing and validation, from a lack of fine-grained sensing to privacy/security concerns. SmartSPEC is a smart space simulator and data generator that leverages a semantic model augmented with user-defined constraints to represent important attributes, relationships, and external domain knowledge for a smart space. We employ machine learning (ML) approaches to extract relevant patterns from a sensorized space, which are used in an event-driven simulation strategy to generate realistic simulated data about the space (events, trajectories, sensor observation datasets, etc.). To evaluate the realism of the generated data, we develop a structured methodology and metrics to assess various aspects of smart space datasets, including trajectories of people and occupancy of spaces. Our experimental study looks at two real-world settings/datasets: an instrumented smart campus building and a city-wide GPS dataset. Our results show the realism of trajectories produced by SmartSPEC (1.4x to 4.4x more realistic than the best synthetic data baseline when compared to real-world data, depending on the scenario and configuration), as well as sensor data derived from such trajectories which adhere to the underlying semantics of the smart space as compared to synthetic sensor data baselines, even under hypothetical changes. Andrew Chio, Daokun Jiang, Peeyush Gupta, Georgios Bouloukakis, Roberto Yus, Sharad Mehrotra, Nalini Venkatasubramanian |
Pervasive Mob. Comput. | 3 |
| 2022 | Sentaur: Sensor Observable Data Model for Smart SpacesabstractThis paper presents Sentaur, a middleware designed, built, and deployed to support sensor-based smart space analytical applications. Sentaur supports a powerful data model that decouples semantic data (about the application domain) from sensor data (using which the semantic data is derived). By supporting mechanisms to map/translate data, concepts, and queries between the two levels, Sentaur relieves application developers from having to know or reason about either capabilities of sensors or write sensor specific code. This paper describes Sentaur's data model, its translation strategy, and highlights its benefits through real-world case studies. Peeyush Gupta, Sharad Mehrotra, Shantanu Sharma 0001, Roberto Yus, Nalini Venkatasubramanian |
CIKM | 1 |
| 2022 | SmartSPEC: Customizable Smart Space Datasets via Event-driven SimulationsabstractThis paper presents SmartSPEC, an approach to generate customizable smart space datasets using sensorized spaces in which people and events are embedded. Smart space datasets are critical to design, deploy and evaluate robust systems and applications to ensure cost-effective operation and safety/-comfort/convenience of the space occupants. Often, real-world data is difficult to obtain due to the lack of fine-grained sensing; privacy/security concerns prevent the release and sharing of individual and spatial data. SmartSPEC is a smart space simulator and data generator that can create a digital representation (twin) of a smart space and its activities. SmartSPEC uses a semantic model and ML-based approaches to characterize and learn attributes in a sensorized space, and applies an event-driven simulation strategy to generate realistic simulated data about the space (events, trajectories, sensor datasets, etc). To evaluate the realism of the data generated by SmartSPEC, we develop a structured methodology and metrics to assess various aspects of smart space datasets, including trajectories of people and occupancy of spaces. Our experimental study looks at two real-world settings/datasets: an instrumented smart campus building and a city-wide GPS dataset. Our results show that the trajectories produced by SmartSPEC are 1.4x to 4.4x more realistic than the best synthetic data baseline when compared to real-world data, depending on the scenario and configuration. Andrew Chio, Daokun Jiang, Peeyush Gupta, Georgios Bouloukakis, Roberto Yus, Sharad Mehrotra, Nalini Venkatasubramanian |
PerCom | 3 |
| 2022 | QUEST: Privacy-Preserving Monitoring of Network Dataabstract[J1C2 Presentation Abstract at IEEE SERVICES 2021 for IEEE Transactions on Services Computing DOI 10.1109/TSC.2022.3166802] Shantanu Sharma 0001, Sharad Mehrotra, Nisha Panwar, Nalini Venkatasubramanian, Peeyush Gupta, Guoxi Wang |
SERVICES | 5 |
| 2022 | JENNER: Just-in-time Enrichment in Query ProcessingabstractEmerging domains, such as sensor-driven smart spaces and social media analytics, require incoming data to be enriched prior to its use. Enrichment often consists of machine learning (ML) functions that are too expensive/infeasible to execute at ingestion. We develop a strategy entitled Just-in-time ENrichmeNt in quERy Processing (JENNER) to support interactive analytics over data as soon as it arrives for such application context. JENNER exploits the inherent tradeoffs of cost and quality often displayed by the ML functions to progressively improve query answers during query execution. We describe how JENNER works for a large class of SPJ and aggregation queries that form the bulk of data analytics workload. Our experimental results on real datasets (IoT and Tweet) show that JENNER achieves progressive answers performing significantly better than the naive strategies of achieving progressive computation. Dhrubajyoti Ghosh, Peeyush Gupta, Sharad Mehrotra, Roberto Yus, Yasser Altowim |
Proc. VLDB Endow. | 2 |
| 2022 | Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries on Secret-Shared Outsourced DataabstractDespite exciting progress on cryptography, secure and efficient query processing over outsourced data remains an open challenge. We develop a communication-efficient and information-theoretically secure system, entitledObscurefor aggregation queries with conjunctive or disjunctive predicates, using secret-sharing.Obscureis strongly secure (i.e., secure regardless of the computational-capabilities of an adversary) and prevents the network, as well as, the (adversarial) servers to learn the user’s queries, results, or the database. In addition,Obscureprovides additional security features, such as hiding access-patterns (i.e., hiding the identity of the tuple satisfying a query) and hiding query-patterns (i.e., hiding which two queries are identical). Also,Obscuredoes not require any communication between any two servers that store the secret-shared data before/during/after the query execution. Moreover, our techniques deal with the secret-shared data that is outsourced by a single or multiple database owners, as well as, allows a user, which may not be the database owner, to execute the query over secret-shared data. We further develop (non-mandatory) privacy-preserving result verification algorithms that detect malicious behaviors, and experimentally validate the efficiency ofObscureon large datasets, the size of which prior approaches of secret-sharing or multi-party computation systems have not scaled to. Peeyush Gupta, Yin Li 0001, Sharad Mehrotra, Nisha Panwar, Shantanu Sharma 0001, Sumaya Almanee |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2022 | Quest: Privacy-Preserving Monitoring of Network Data: A System for Organizational Response to PandemicsabstractMost modern organizations today support network infrastructure to provide ubiquitous network coverage at their premises. Such a network infrastructure consisting of a set of access points deployed at different locations in buildings can be used to support coarse-level localization of individuals, who connect to the infrastructure using their mobile devices. This paper describes a system, entitledQuestthat supports a variety of applications (e.g., identifying hotspot regions, finding people who are potentially exposed to a condition such as COVID-19, occupancy count of a region/floor/building) based on network data to empower organizations to maintain safety at their workplace/premises.Questbuilds the above functionalities while fully protecting the privacy of individuals.Questincorporates computationally- and information-theoretically-secure protocols that prevent adversaries from gaining knowledge of an individual's location history (based on WiFi data). We describe the architecture, design choices, and implementation of the proposed security/privacy techniques inQuest. We, also, validate the practicality ofQuestand evaluate it thoroughly via an actual campus-scale deployment at our organization over a very large dataset of over 50M rows. Shantanu Sharma 0001, Sharad Mehrotra, Nisha Panwar, Nalini Venkatasubramanian, Peeyush Gupta, Guoxi Wang |
IEEE Trans. Serv. Comput. | 5 |
| 2021 | Concealer: SGX-based Secure, Volume Hiding, and Verifiable Processing of Spatial Time-Series Datasets
Peeyush Gupta, Sharad Mehrotra, Shantanu Sharma 0001, Nalini Venkatasubramanian, Guoxi Wang |
EDBT | 1 |
| 2021 | PRISM: Private Verifiable Set Computation over Multi-Owner Outsourced DatabasesabstractThis paper proposes Prism, a secret sharing based approach to compute private set operations (i.e., intersection and union), as well as aggregates over outsourced databases belonging to multiple owners. Prism enables data owners to pre-load the data onto non-colluding servers and exploits the additive and multiplicative properties of secret-shares to compute the above-listed operations in (at most) two rounds of communication between the servers (storing the secret-shares) and the querier, resulting in a very efficient implementation. Also, Prism does not require communication among the servers and supports result verification techniques for each operation to detect malicious adversaries. Experimental results show that Prism scales both in terms of the number of data owners and database sizes, to which prior approaches do not scale. Yin Li 0001, Dhrubajyoti Ghosh, Peeyush Gupta, Sharad Mehrotra, Nisha Panwar, Shantanu Sharma 0001 |
SIGMOD Conference | 3 |
| 2021 | Privacy-Preserving Secret Shared Computations Using MapReduceabstractData outsourcing allows data owners to keep their data at untrusted clouds that do not ensure the privacy of data and/or computations. One useful framework for fault-tolerant data processing in a distributed fashion is MapReduce, which was developed for trusted private clouds. This paper presents algorithms for data outsourcing based on Shamir's secret-sharing scheme and for executing privacy-preserving SQL queries such as count, selection including range selection, projection, and join while using MapReduce as an underlying programming model. Our proposed algorithms prevent an adversary from knowing the database or the query while also preventing output-size and access-pattern attacks. Interestingly, our algorithms do not involve the database owner, which only creates and distributes secret-shares once, in answering any query, and hence, the database owner also cannot learn the query. Logically and experimentally, we evaluate the efficiency of the algorithms on the following parameters: (i) the number of communication rounds (between a user and a server), (ii) the total amount of bit flow (between a user and a server), and (iii) the computational load at the user and the server. Shlomi Dolev, Peeyush Gupta, Yin Li 0001, Sharad Mehrotra, Shantanu Sharma 0001 |
IEEE Trans. Dependable Secur. Comput. | 2 |
| 2020 | Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation QueriesabstractWe develop a secret-sharing-based prototype, entitled Obscure that provides communication-efficient and information-theoretically secure algorithms for aggregation queries using multi-party computation (MPC). The query execution algorithms over secret-shared data are developed to deal with an honest but curious, as well as, a malicious server by providing result verification algorithms. Obscure prevents an adversary to know the data, the query, and the tuple-identity satisfying the query. Peeyush Gupta, Yin Li 0001, Sharad Mehrotra, Nisha Panwar, Shantanu Sharma 0001 |
CODASPY | 1 |
| 2020 | IoT Expunge: Implementing Verifiable Retention of IoT DataabstractThe growing deployment of Internet of Things (IoT) systems aims to ease the daily life of end-users by providing several value-added services. However, IoT systems may capture and store sensitive, personal data about individuals in the cloud, thereby jeopardizing user-privacy. Emerging legislation, such as California's CalOPPA and GDPR in Europe, support strong privacy laws to protect an individual's data in the cloud. One such law relates to strict enforcement of data retention policies. This paper proposes a framework, entitled IoT Expunge that allows sensor data providers to store the data in cloud platforms that will ensure enforcement of retention policies. Additionally, the cloud provider produces verifiable proofs of its adherence to the retention policies. Experimental results on a real-world smart building testbed show that IoT Expunge imposes minimal overheads to the user to verify the data against data retention policies. Nisha Panwar, Shantanu Sharma 0001, Peeyush Gupta, Dhrubajyoti Ghosh, Sharad Mehrotra, Nalini Venkatasubramanian |
CODASPY | 3 |
| 2020 | A privacy-enabled platform for COVID-19 applications: poster abstractabstractWe present our experiences in adapting and deploying TIPPERS1, a novel privacy-enabled IoT data collection and management system for smart spaces, to facilitate the monitoring of adherence to COVID-19 regulations in a university campus and a military facility. Michael August, Mamadou H. Diallo, Dhrubajyoti Ghosh, Peeyush Gupta, Christopher Graves 0002, Michael Holstrom, Pramod P. Khargonekar, Megan Kline, Sharad Mehrotra, Shantanu Sharma 0001, Nalini Venkatasubramanian, Guoxi Wang, Roberto Yus |
SenSys | 5 |
| 2020 | SmartBench: A Benchmark For Data Management In Smart Spaces
Peeyush Gupta, Michael J. Carey 0001, Sharad Mehrotra, Roberto Yus |
Proc. VLDB Endow. | 1 |
| 2019 | Obscure: Information-Theoretic Oblivious and Verifiable Aggregation QueriesabstractDespite extensive research on cryptography, secure and efficient query processing over outsourced data remains an open challenge. We develop communication-efficient and information-theoretically secure algorithms for privacy-preserving aggregation queries using multi-party computation (MPC). Specifically, query processing techniques over secret-shared data outsourced by single or multiple database owners are developed. These algorithms allow a user to execute queries on the secret-shared database and also prevent the network and the (adversarial) clouds to learn the user's queries, results, or the database. We further develop (non-mandatory) privacy-preserving result verification algorithms that detect malicious behaviors, and experimentally validate the efficiency of our approach over large datasets, the size of which prior approaches to secret-sharing or MPC systems have not scaled to. Peeyush Gupta, Yin Li 0001, Sharad Mehrotra, Nisha Panwar, Shantanu Sharma 0001, Sumaya Almanee |
Proc. VLDB Endow. | 1 |