Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries

Peeyush Gupta, Yin Li, Sharad Mehrotra, Nisha Panwar, Shantanu Sharma

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We 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.

Original languageEnglish
Title of host publicationCODASPY 2020 - Proceedings of the 10th ACM Conference on Data and Application Security and Privacy
PublisherAssociation for Computing Machinery, Inc
Pages165-167
Number of pages3
ISBN (Electronic)9781450371070
DOIs
StatePublished - 16 Mar 2020
Externally publishedYes
Event10th ACM Conference on Data and Application Security and Privacy, CODASPY 2020 - New Orleans, United States
Duration: 16 Mar 202018 Mar 2020

Publication series

NameCODASPY 2020 - Proceedings of the 10th ACM Conference on Data and Application Security and Privacy

Conference

Conference10th ACM Conference on Data and Application Security and Privacy, CODASPY 2020
Country/TerritoryUnited States
CityNew Orleans
Period16/03/2018/03/20

Keywords

  • oblivious computation
  • scalability
  • secret-sharing
  • verification

ASJC Scopus subject areas

  • Software
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries'. Together they form a unique fingerprint.

Cite this