Verifiable searchable encryption with aggregate keys for data sharing system

Liu, Zheli; Li, Tong; Li, Ping; Jia, Chunfu; Li, Jin

doi:10.1016/j.future.2017.02.024

Cited by 110 publications

(152 citation statements)

References 24 publications

Supporting

Mentioning

152

Contrasting

Order By: Relevance

“…Cuckoo hash table is used here for this private verifiable scheme. With multiowner setting, Liu et al [12] have presented a VSSE with aggregate keys. Miao et al [15] presented a VSSE in same multi-owner setting.…”

Section: Related Workmentioning

confidence: 99%

“…There are single keyword search VSSE schemes which are either new constructions supporting verifiability or design techniques to achieve verifiability on the existing SSE schemes by proposing generic algorithm. VSSE with single keyword search has been studied in [5], [7], [12]. In [20], [22] etc., VSSE scheme with conjunctive query has been studied.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE Scheme

Sardar

Ruj

2019

Provable Security

View full text Add to dashboard Cite

A symmetric searchable encryption (SSE) scheme allows a client (data owner) to search on encrypted data outsourced to an untrusted cloud server. The search may either be a single keyword search or a complex query search like conjunctive or Boolean keyword search. Information leakage is quite high for dynamic SSE, where data might be updated. It has been proven that to avoid this information leakage an SSE scheme with dynamic data must be forward private. A dynamic SSE scheme is said to be forward private, if adding a keyword-document pair does not reveal any information about the previous search result with that keyword.In SSE setting, the data owner has very low computation and storage power. In this setting, though some schemes achieve forward privacy with honest-but-curious cloud, it becomes difficult to achieve forward privacy when the server is malicious, meaning that it can alter the data. Verifiable dynamic SSE requires the server to give a proof of the result of the search query. The data owner can verify this proof efficiently. In this paper, we have proposed a generic publicly verifiable dynamic SSE (DSSE) scheme that makes any forward private DSSE scheme verifiable without losing forward privacy. The proposed scheme does not require any extra storage at owner-side and requires minimal computational cost as well for the owner. Moreover, we have compared our scheme with the existing results and show that our scheme is practical.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE Scheme

Sardar

Ruj

2019

Provable Security

View full text Add to dashboard Cite

show abstract

“…It should be noted that in this case we have Eqs. (8) and (9). For further analysis, we define a new event, denoted by Evt 3 , as…”

Section: Theorem 2 Assume That a Is An Attacker In The Experiments Expmentioning

confidence: 99%

“…Generally, a cloud storage system should ensure availability (e.g., for any legitimate customer, (s)he can reach his/her uploaded data from some Internet-connected devices), reliability (of user data outsourced to the cloud), efficient retrieval (of user data outsourced to the cloud), data sharing (between authorized users), security (i.e., both confidentiality and integrity [5]), and other features required/stated in the service level agreements (SLAs). Cryptographic schemes, such as proxy re-encryption, attributebased encryption, searchable encryption [6][7][8][9], have been designed to achieve several of these features.…”

mentioning

confidence: 99%

An IND-CCA2 secure post-quantum encryption scheme and a secure cloud storage use case

Zeng

Chen

Choo

2019

Hum. Cent. Comput. Inf. Sci.

View full text Add to dashboard Cite

Code-based public key encryption (PKE) is a popular choice to achieve post-quantum security, partly due to its capability to achieve fast encryption/decryption. However, code-based PKE has larger ciphertext and public key sizes in comparison to conventional PKE schemes (e.g., those based on RSA). In 2018, Lau and Tan proposed a new rank metric code-based PKE scheme, which has smaller public key and ciphertext sizes compared to other code-based PKE schemes. They also proved that their scheme achieves IND-CPA security, assuming the intractability of the decisional rank syndrome decoding problem. It is known that IND-CCA2 security is the strongest and most popular security assurance for PKE schemes. Therefore, in this paper, we obtain a new code-based PKE scheme from Lau and Tan’s scheme, in order to inherit the underlying small public key and ciphertext sizes. However, our new scheme is shown to achieve IND-CCA2 security, instead of the weaker IND-CPA security. Specifically, the respective public key size and ciphertext size in our new scheme are 15.06 KB and 1.37 KB under 141-bit security level, and 16.76 KB and 1.76 KB under 154-bit security level. We then present a use case for the proposed scheme, that is for secure cloud storage.

show abstract

“…At the same time, another of his methods [21] makes the routing and the storage and retrieval of resources in a Kademlia network more secure through exploiting reputation techniques for the Sybil attack in the network layer. With the development of public cloud storage [22] and new schemes for outsourced databases recently, the new encryption methods [23,24,25] and a practical oblivious RAM with a variable block size [26] may solve the privacy and security problems caused by the Sybil attack. This paper mainly discusses the attack detection of the physical layer in the WLAN [27], so the application of these algorithms will not be done.…”

Section: Related Workmentioning

confidence: 99%

Accurate Sybil Attack Detection Based on Fine-Grained Physical Channel Information

Wang

Zhu

Gong

et al. 2018

Sensors

Self Cite

View full text Add to dashboard Cite

With the development of the Internet-of-Things (IoT), wireless network security has more and more attention paid to it. The Sybil attack is one of the famous wireless attacks that can forge wireless devices to steal information from clients. These forged devices may constantly attack target access points to crush the wireless network. In this paper, we propose a novel Sybil attack detection based on Channel State Information (CSI). This detection algorithm can tell whether the static devices are Sybil attackers by combining a self-adaptive multiple signal classification algorithm with the Received Signal Strength Indicator (RSSI). Moreover, we develop a novel tracing scheme to cluster the channel characteristics of mobile devices and detect dynamic attackers that change their channel characteristics in an error area. Finally, we experiment on mobile and commercial WiFi devices. Our algorithm can effectively distinguish the Sybil devices. The experimental results show that our Sybil attack detection system achieves high accuracy for both static and dynamic scenarios. Therefore, combining the phase and similarity of channel features, the multi-dimensional analysis of CSI can effectively detect Sybil nodes and improve the security of wireless networks.

show abstract

Verifiable searchable encryption with aggregate keys for data sharing system

Cited by 110 publications

References 24 publications

FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE Scheme

FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE Scheme

An IND-CCA2 secure post-quantum encryption scheme and a secure cloud storage use case

Accurate Sybil Attack Detection Based on Fine-Grained Physical Channel Information

Contact Info

Product

Resources

About