Bestie: Very Practical Searchable Encryption with Forward and Backward Security

Chen, Tianyang; Xu, Peng; Wang, Wei; Zheng, Yubo; Susilo, Willy; Jin, Hai

doi:10.1007/978-3-030-88428-4_1

Cited by 23 publications

(7 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Secondly, we propose improvements to address existing security flaws, modeling the improved protocol through CPN Tools, and adding the same Dolev-Yao attacker model to detect the security of the new scheme. Finally, comparing the performance and security of the original protocol and the improved protocol, it was found that the improved scheme can enhance the security attributes of the protocol, effectively resist man-in-the-middle attacks, and ensure the forward security and backward security of the key [40,41] while being able to resist malicious instruction injection attacks. The improvement scheme proposed in this article is not only applicable to the EIBsec protocol but also has great reference value for other protocols in building automation systems such as BACnet, LonWroks, and OPC-UA [42].…”

Section: Discussionmentioning

confidence: 99%

Security Evaluation and Improvement of the Extended Protocol EIBsec for KNX/EIB

Feng,

Zhang

2023

Information

View full text Add to dashboard Cite

The European Installation Bus(EIB) protocol, also known as KNX/EIB, is widely used in building and home automation. An extension of the KNX/EIB protocol, EIBsec, is primarily designed to meet the requirements for data transmission security in distributed building automation systems. However, this protocol has some security issues in the request, key distribution, and identity authentication processes. This paper employs a formal analysis method that combines Colored Petri Net (CPN) theory with the Dolev-Yao attack model to evaluate and enhance the EIBsec protocol. It utilizes the CPN Tools to conduct CPN modeling analysis on the protocol and introduces a security assessment model to carry out intrusion detection and security assessment. Through this analysis, vulnerabilities in the protocol, such as tampering and replay attacks, are identified. To address these security concerns, we introduce hash verification and timestamp judgment methods into the original protocol to enhance its security. Subsequently, based on the improved protocol, we conduct CPN modeling and verify the security of the new scheme. Finally, through a comparison and analysis of the performance and security between the original protocol and the improved scheme, it is found that the improved scheme has higher security.

show abstract

Section: Discussionmentioning

confidence: 99%

Security Evaluation and Improvement of the Extended Protocol EIBsec for KNX/EIB

Feng,

Zhang

2023

Information

View full text Add to dashboard Cite

show abstract

“…A robust DSSE scheme must guarantee the desired correctness and claimed security when the client issues irrational update queries. Unfortunately, up to now, besides the scheme ROSE proposed by Xu et al,only MONETA [4] and Bestie [46] achieve robustness. However, those robust DSSE schemes fail to achieve Type-I − backward privacy.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Searchable Symmetric Encryption With Strong Security and Robustness

Dou,

Dan,

et al. 2024

IEEE Trans.Inform.Forensic Secur.

Self Cite

View full text Add to dashboard Cite

Dynamic Searchable Symmetric Encryption (DSSE) is a prospective technique in the field of cloud storage for secure search over encrypted data. A DSSE client can issue update queries to an honest-but-curious server for adding or deleting his ciphertexts to or from the server and delegate keyword search over those ciphertexts to the server. Numerous investigations focus on achieving strong security, like forward-and-Type-I −backward security, to reduce the information leakage of DSSE to the server as much as possible. However, the existing DSSE with such strong security cannot keep search correctness and stable security (or robustness, in short) if irrational queries are issued by the client, like duplicate add or delete queries and the delete queries for removing non-existed entries, to the server unintentionally. Hence, this work proposes two new DSSE schemes, named SR-DSSEa and SR-DSSE b , respectively. Both two schemes achieve forward-and-Type-I − -backward security while keeping robustness when irrational queries are issued. In terms of performance, SR-DSSEa has more efficient communication costs and roundtrips than SR-DSSE b . In contrast, SR-DSSE b has a more efficient search performance than SR-DSSEa. Its search performance is close to the existing DSSE scheme with the same security but fails to achieve robustness.

show abstract

“…Bost et al introduced another security notion, backward security [12], which limits the information leaked from the deleted ciphertexts during search queries. Since then, various DSSE schemes have been proposed to achieve both forward and backward security without loss of efficiency, e.g., [17], [18], [21], [25], [65], [66], [71], [73].…”

Section: A Motivationmentioning

confidence: 99%

“…Bost et al [12] formalized three types of backward security with leakage functions. Since then, many research works have proposed forward and backward secure constructions to achieve small search leakage [18], [52], [73], robustness under fault operations [71], constant client storage [25], [38], and practical search performance [17], [21], [65], [66].…”

Section: Dsse Revisited and Related Workmentioning

confidence: 99%

The Power of Bamboo: On the Post-Compromise Security for Searchable Symmetric Encryption

Chen¹,

Xu²,

Picek³

et al. 2023

Proceedings 2023 Network and Distributed System Security Symposium

View full text Add to dashboard Cite

Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated encrypted databases to an honest-but-curious server without losing keyword privacy. This paper studies a new and practical security risk to DSSE, namely, secret key compromise (e.g., a user's secret key is leaked or stolen), which threatens all the security guarantees offered by existing DSSE schemes. To address this open problem, we introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates. We further define the notion of post-compromise secure with respect to leakage functions to study whether DSSE schemes can still provide data security after the client's secret key is compromised. We demonstrate that post-compromise security is achievable with a proposed protocol called "Bamboo". Interestingly, the leakage functions of Bamboo satisfy the requirements for both forward and backward security. We conduct a performance evaluation of Bamboo using a real-world dataset and compare its runtime efficiency with the existing forward-and-backward secure DSSE schemes. The result shows that Bamboo provides strong security with better or comparable performance.

show abstract

Bestie: Very Practical Searchable Encryption with Forward and Backward Security

Cited by 23 publications

References 23 publications

Security Evaluation and Improvement of the Extended Protocol EIBsec for KNX/EIB

Security Evaluation and Improvement of the Extended Protocol EIBsec for KNX/EIB

Dynamic Searchable Symmetric Encryption With Strong Security and Robustness

The Power of Bamboo: On the Post-Compromise Security for Searchable Symmetric Encryption

Contact Info

Product

Resources

About