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

被引：0
|
作者：
Gupta, Peeyush [1 ]
Li, Yin [2 ]
Mehrotra, Sharad [1 ]
Panwar, Nisha [1 ,3 ]
Sharma, Shantanu [1 ]
机构：
[1] Univ Calif Irvine, Irvine, CA 92697 USA
[2] Xinyang Normal Univ, Xinyang, Peoples R China
[3] Augusta Univ, Augusta, GA USA
来源：
PROCEEDINGS OF THE TENTH ACM CONFERENCE ON DATA AND APPLICATION SECURITY AND PRIVACY, CODASPY 2020 | 2020年
基金：
中国国家自然科学基金;
关键词：
Oblivious computation; secret-sharing; scalability; verification;
D O I：
10.1145/3374664.3379533
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We develop a secret-sharing-based prototype, entitled Obscure that provides communication-efficient and information-theoretically secure algorithms for aggregation queries using secret-sharing. The query execution algorithms deals with an honest-but-curious, as well as, a malicious server, by supporting result verification. In addition, Obscure prevents an adversary to know the data, the query, and the tuple-identity satisfying the query.
引用
收藏
页码：165 / 167
页数：3
相关论文
共 50 条
  • [31] Information-theoretically secure key insulated encryption: Models, bounds and constructions
    Hanaoka, Y
    Hanaoka, G
    Shikata, J
    Imai, H
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (10) : 2521 - 2532
  • [32] Information-Theoretically Secure Key-Insulated Multireceiver Authentication Codes
    Seito, Takenobu
    Aikawa, Tadashi
    Shikata, Junji
    Matsumoto, Tsutomu
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2010, 2010, 6055 : 148 - 165
  • [33] Information-Theoretically Secure Three-Party Computation with One Corrupted Party
    Wang, Ye
    Ishwar, Prakash
    Rane, Shantanu
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 3160 - +
  • [34] Information-Theoretically Secure Multi-Party Linear Regression and Logistic Regression
    Zhou, Hengcheng
    2023 IEEE/ACM 23RD INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND INTERNET COMPUTING WORKSHOPS, CCGRIDW, 2023, : 192 - 199
  • [35] Information theoretically secure oblivious polynomial evaluation: Model, bounds, and constructions
    Hanaoka, G
    Imai, H
    Mueller-Quade, J
    Nascimento, ACA
    Otsuka, A
    Winter, A
    INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2004, 3108 : 62 - 73
  • [36] VOSA: Verifiable and Oblivious Secure Aggregation for Privacy-Preserving Federated Learning
    Wang, Yong
    Zhang, Aiqing
    Wu, Shu
    Yu, Shui
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2023, 20 (05) : 3601 - 3616
  • [37] On the Security of Verifiable and Oblivious Secure Aggregation for Privacy-Preserving Federated Learning
    Wu, Jiahui
    Zhang, Weizhe
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2024, 21 (05) : 4324 - 4326
  • [38] Information-theoretically Optimal Sparse PCA
    Deshpande, Yash
    Montanari, Andrea
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2197 - 2201
  • [39] Security research on an information-theoretically secure secret key agreement using LDPC matrices
    Yu, Jia
    Luo, Yuan
    Li, Minglu
    PROCEEDINGS OF THE THIRD CHINAGRID ANNUAL CONFERENCE, 2008, : 197 - 201
  • [40] Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption
    Hu, Yanglin
    Ouyang, Yingkai
    Tomamichel, Marco
    QUANTUM, 2023, 7
12345