@inproceedings{3c3614f461af43ce96369db04f23abaa,
title = "Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries",
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.",
keywords = "oblivious computation, scalability, secret-sharing, verification",
author = "Peeyush Gupta and Yin Li and Sharad Mehrotra and Nisha Panwar and Shantanu Sharma",
note = "Publisher Copyright: {\textcopyright} 2020 ACM.; 10th ACM Conference on Data and Application Security and Privacy, CODASPY 2020 ; Conference date: 16-03-2020 Through 18-03-2020",
year = "2020",
month = mar,
day = "16",
doi = "10.1145/3374664.3379533",
language = "English (US)",
series = "CODASPY 2020 - Proceedings of the 10th ACM Conference on Data and Application Security and Privacy",
publisher = "Association for Computing Machinery, Inc",
pages = "165--167",
booktitle = "CODASPY 2020 - Proceedings of the 10th ACM Conference on Data and Application Security and Privacy",
}