From 6fbd614e98e4aa68a9d3434b1091e36104516b5c Mon Sep 17 00:00:00 2001 From: "S.Q. Lai" <5236111+shangqimonash@users.noreply.github.com> Date: Fri, 1 Jan 2021 13:06:13 +0800 Subject: [PATCH 1/5] Update README.md --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index ed0b751..524e54e 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # Aura -This repository contains the implementation of Aura, a non-interactive dynamic searchable symmetric encryption (DSSE) scheme. This is the first DSSE scheme that achieves forward and Type-II backward privacy [1] while supporting non-interactive queries. The detailed construction and security proof are presented in our NDSS'20 paper [2]. +This repository contains the implementation of Aura, a non-interactive dynamic searchable symmetric encryption (DSSE) scheme. This is the first DSSE scheme that achieves forward and Type-II backward privacy [1] while supporting non-interactive queries. The detailed construction and security proof are presented in our NDSS'21 paper [2]. @@ -48,7 +48,7 @@ All the above executable files can be executed without extra parameters. [1] Raphaël Bost, Brice Minaud, and Olga Ohrimenko. 2017. Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives. In *Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security* (*CCS '17*). Association for Computing Machinery, New York, NY, USA, 1465–1482. DOI: https://doi.org/10.1145/3133956.3133980 -[2] Shi-Feng Sun, Ron Steinfeld, Shangqi Lai, Xingliang Yuan, Amin Sakzad, Joseph Liu, Surya Nepal, and Dawu Gu. 2020. Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy. In the Network and Distributed System Security Symposium (NDSS). DOI: https://dx.doi.org/10.14722/ndss.2021.24162 +[2] Shi-Feng Sun, Ron Steinfeld, Shangqi Lai, Xingliang Yuan, Amin Sakzad, Joseph Liu, Surya Nepal, and Dawu Gu. 2021. Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy. In the Network and Distributed System Security Symposium (NDSS). DOI: https://dx.doi.org/10.14722/ndss.2021.24162 From f2b077d4e5833689964c0f6ce44cce3f54288bdf Mon Sep 17 00:00:00 2001 From: Shangqi Date: Fri, 1 Jan 2021 14:18:01 +0800 Subject: [PATCH 2/5] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index ed0b751..f8e81c4 100644 --- a/README.md +++ b/README.md @@ -48,7 +48,7 @@ All the above executable files can be executed without extra parameters. [1] Raphaël Bost, Brice Minaud, and Olga Ohrimenko. 2017. Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives. In *Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security* (*CCS '17*). Association for Computing Machinery, New York, NY, USA, 1465–1482. DOI: https://doi.org/10.1145/3133956.3133980 -[2] Shi-Feng Sun, Ron Steinfeld, Shangqi Lai, Xingliang Yuan, Amin Sakzad, Joseph Liu, Surya Nepal, and Dawu Gu. 2020. Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy. In the Network and Distributed System Security Symposium (NDSS). DOI: https://dx.doi.org/10.14722/ndss.2021.24162 +[2] Shi-Feng Sun, Ron Steinfeld, Shangqi Lai, Xingliang Yuan, Amin Sakzad, Joseph Liu, Surya Nepal, and Dawu Gu. 2020. Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy. In *the Network and Distributed System Security Symposium* (*NDSS*). DOI: https://dx.doi.org/10.14722/ndss.2021.24162 From 253c04ab29b608ccb8409b442c8996822f1d896a Mon Sep 17 00:00:00 2001 From: Shangqi Date: Fri, 1 Jan 2021 14:20:01 +0800 Subject: [PATCH 3/5] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 524e54e..fd753c2 100644 --- a/README.md +++ b/README.md @@ -48,7 +48,7 @@ All the above executable files can be executed without extra parameters. [1] Raphaël Bost, Brice Minaud, and Olga Ohrimenko. 2017. Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives. In *Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security* (*CCS '17*). Association for Computing Machinery, New York, NY, USA, 1465–1482. DOI: https://doi.org/10.1145/3133956.3133980 -[2] Shi-Feng Sun, Ron Steinfeld, Shangqi Lai, Xingliang Yuan, Amin Sakzad, Joseph Liu, Surya Nepal, and Dawu Gu. 2021. Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy. In the Network and Distributed System Security Symposium (NDSS). DOI: https://dx.doi.org/10.14722/ndss.2021.24162 +[2] Shi-Feng Sun, Ron Steinfeld, Shangqi Lai, Xingliang Yuan, Amin Sakzad, Joseph Liu, Surya Nepal, and Dawu Gu. 2021. Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy. In *the Network and Distributed System Security Symposium* (*NDSS*). DOI: https://dx.doi.org/10.14722/ndss.2021.24162 From b16804027a1e3d2aa4babbff9d8e677ed2046bbd Mon Sep 17 00:00:00 2001 From: "S.Q. Lai" <5236111+shangqimonash@users.noreply.github.com> Date: Fri, 1 Jan 2021 14:39:55 +0800 Subject: [PATCH 4/5] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index fd753c2..e675964 100644 --- a/README.md +++ b/README.md @@ -40,7 +40,7 @@ All the above executable files can be executed without extra parameters. ## Feedback - [Submit an issue](https://github.com/shangqimonash/Aura/issues/new) -- Email the authors: shifeng.sun@monash.edu, shangqi.lai@monash.edu +- Email the authors: shifeng.sun@monash.edu, shangqi.lai@monash.edu, xingliang.yuan@monash.edu From 4cef1370fd90159633692b4ebca1690ce6b3ce7d Mon Sep 17 00:00:00 2001 From: shangqi Date: Wed, 12 May 2021 16:24:14 +0800 Subject: [PATCH 5/5] Fix bug in the Bloom filter implementation --- BF/BloomFilter.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/BF/BloomFilter.h b/BF/BloomFilter.h index d3faec9..bc4ef76 100644 --- a/BF/BloomFilter.h +++ b/BF/BloomFilter.h @@ -20,7 +20,7 @@ class BloomFilter { void add_tag(uint8_t *key) { for (int i = 0; i < num_of_hashes; ++i) { long index = SpookyHash::Hash64(key, key_len, i) % num_of_bits; - bits.flip(index); + bits.set(index); } }