Cloud-based Private Querying of Databases by Means of Homomorphic Encryption

被引：1

作者：

Abbar, Yassine ^{[1
]}

Aubry, Pascal ^{[2
]}

Barry, Thierno ^{[1
]}

Carpov, Sergiu ^{[4
]}

Mallick, Sayanta ^{[1
]}

Krichen, Mariem ^{[3
]}

Ligier, Damien ^{[3
]}

Shpak, Sergey ^{[3
]}

Sirdey, Renaud ^{[2
]}

机构：

[1] Capgemini DEMS France Res & Innovat, Paris, France

[2] Univ Paris Saclay, LIST, CEA, Paris, France

[3] Wallix, Paris, France

[4] Inpher, Lausanne, Switzerland

来源：

PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON INTERNET OF THINGS, BIG DATA AND SECURITY (IOTBDS) | 2021年

关键词：

Private Database Querying; Homomorphic Encryption; Privacy-by-Design;

D O I：

10.5220/0010378801230131

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper deals with several use-cases for privately querying corpora of documents in both settings where the corpus is public or private with respect to an honest-but-curious infrastructure executing the query. We address these scenarios using Fully Homomorphic Encryption (FHE) hybridized with other techniques such as Symmetric Searchable Encryption (SSE) and Private Information Retrieval (PIR) to achieve acceptable system level performances. The paper also presents the prototypes developed to validate the approach and reports on the performances obtained as well as their capacity to scale.

引用

页码：123 / 131

页数：9

共 11 条

[1]

Aguilar-Melchor Carlos, 2016, Proceedings on Privacy Enhancing Technologies, V2016, P155, DOI 10.1515/popets-2016-0010

[2]

Angel S., 2017, INT C SECURITY PRIVA

[3]

Aubry, CT RSA, P345

[4] Compiling Low Depth Circuits for Practical Secure Computation [J].

Buescher, Niklas ;

Holzer, Andreas ;

Weber, Alina ;

Katzenbeisser, Stefan .

COMPUTER SECURITY - ESORICS 2016, PT II, 2016, 9879 :80-98

[5] A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits [J].

Carpov, Sergiu ;

Aubry, Pascal ;

Sirdey, Renaud .

COMBINATORIAL ALGORITHMS, IWOCA 2017, 2018, 10765 :275-286

[6]

Chatterjee A., 2015, IACR Cryptol. ePrint Arch., V2015, P981

[7] Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds [J].

Chillotti, Ilaria ;

Gama, Nicolas ;

Georgieva, Mariya ;

Izabachene, Malika .

ADVANCES IN CRYPTOLOGY - ASIACRYPT 2016, PT I, 2016, 10031 :3-33

[8]

Fan J., 2012, IACR Cryptol. ePrint Arch., V2012, P144

[9] TERM-WEIGHTING APPROACHES IN AUTOMATIC TEXT RETRIEVAL [J].

SALTON, G ;

BUCKLEY, C .

INFORMATION PROCESSING & MANAGEMENT, 1988, 24 (05) :513-523

[10] Privacy-Preserving Relevance Ranking Scheme and Its Application in Multi-keyword Searchable Encryption [J].

Shen, Peisong ;

Chen, Chi ;

Zhu, Xiaojie .

SECURITY AND PRIVACY IN COMMUNICATION NETWORKS, SECURECOMM 2017, 2018, 238 :128-146

← 1 2 →