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 条

[1] Obscure: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries on Secret-Shared Outsourced Data
Gupta, Peeyush
Li, Yin
Mehrotra, Sharad
Panwar, Nisha
Sharma, Shantanu
Almanee, Sumaya
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (02) : 843 - 864
[2] OBSCURE: Information-Theoretic Oblivious and Verifiable Aggregation Queries
Gupta, Peeyush
Li, Yin
Mehrotra, Sharad
Panwar, Nisha
Sharma, Shantanu
Almanee, Sumaya
PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 12 (09): : 1030 - 1043
[3] INFORMATION-THEORETICALLY SECURE STRONG VERIFIABLE SECRET SHARING
Lin, Changlu
Harn, Lein
Ye, Dingfeng
SECRYPT 2009: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY, 2009, : 233 - +
[4] Information-theoretically secure oblivious polynomial evaluation in the commodity-based model
Tonicelli, Rafael
Nascimento, Anderson C. A.
Dowsley, Rafael
Mueller-Quade, Joern
Imai, Hideki
Hanaoka, Goichiro
Otsuka, Akira
INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2015, 14 (01) : 73 - 84
[5] Information-theoretically secure oblivious polynomial evaluation in the commodity-based model
Rafael Tonicelli
Anderson C. A. Nascimento
Rafael Dowsley
Jörn Müller-Quade
Hideki Imai
Goichiro Hanaoka
Akira Otsuka
International Journal of Information Security, 2015, 14 : 73 - 84
[6] Information-theoretically secure keyless authentication
Korjik, V
Bakin, M
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 20 - 20
[7] Information-Theoretically Secure Key Generation and Management
Yang, En-Hui
Wu, Xin-Wen
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1529 - 1533
[8] On the Security of Pseudorandomized Information-Theoretically Secure Schemes
Nuida, Koji
Hanaoka, Goichiro
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (01) : 635 - 652
[9] On the Security of Pseudorandomized Information-Theoretically Secure Schemes
Nuida, Koji
Hanaoka, Goichiro
INFORMATION THEORETIC SECURITY, 2010, 5973 : 56 - 73
[10] On Optimal Information-Theoretically Secure Key Management
Yang, En-Hui
Wu, Xin-Wen
2019 16TH CANADIAN WORKSHOP ON INFORMATION THEORY (CWIT), 2019,

← 1 2 3 4 5 →