TY - GEN
T1 - Obric
T2 - 5th International Conference on Blockchain and Trustworthy Systems, BlockSys 2023
AU - Zhao, Xin
AU - Yang, Xu
AU - Wang, Jianfeng
AU - Qi, Saiyu
N1 - Publisher Copyright:
© 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
PY - 2024
Y1 - 2024
N2 - Access pattern disclosure can reveal sensitive information related to search queries, posing a threat to user privacy. Malicious attackers may infer users’ search intentions, behavior, and interests from access patterns, which can be used for targeted attacks, phishing, or identity theft. Access pattern disclosure may also jeopardize the confidentiality of the searched data, as it may reveal sensitive information related to the queried data. Traditional searchable encryption allows for searching encrypted data directly, but suffers from privacy leaks due to access pattern disclosure and cannot guarantee data integrity. Additionally, traditional searchable encryption only supports single-keyword search and leads to significant computational overhead when searching for a large number of ciphertexts. To address these issues, we propose a two-stage protected ciphertext retrieval scheme called Obric that supports oblivious multi-keyword search in hyperledger fabric platform. In specific, we store encrypted data using the distributed point function (DPFs) on the Order node set and the ORAM encryption algorithm on the Peer nodes. Finally, we implement a secret information storage system so that users’ access pattern privacy is not compromised by malicious adversaries.
AB - Access pattern disclosure can reveal sensitive information related to search queries, posing a threat to user privacy. Malicious attackers may infer users’ search intentions, behavior, and interests from access patterns, which can be used for targeted attacks, phishing, or identity theft. Access pattern disclosure may also jeopardize the confidentiality of the searched data, as it may reveal sensitive information related to the queried data. Traditional searchable encryption allows for searching encrypted data directly, but suffers from privacy leaks due to access pattern disclosure and cannot guarantee data integrity. Additionally, traditional searchable encryption only supports single-keyword search and leads to significant computational overhead when searching for a large number of ciphertexts. To address these issues, we propose a two-stage protected ciphertext retrieval scheme called Obric that supports oblivious multi-keyword search in hyperledger fabric platform. In specific, we store encrypted data using the distributed point function (DPFs) on the Order node set and the ORAM encryption algorithm on the Peer nodes. Finally, we implement a secret information storage system so that users’ access pattern privacy is not compromised by malicious adversaries.
KW - Blockchain
KW - Keyword search
KW - Privacy protection
KW - Searchable encryption
UR - https://www.scopus.com/pages/publications/85178640172
U2 - 10.1007/978-981-99-8104-5_14
DO - 10.1007/978-981-99-8104-5_14
M3 - 会议稿件
AN - SCOPUS:85178640172
SN - 9789819981038
T3 - Communications in Computer and Information Science
SP - 176
EP - 191
BT - Blockchain and Trustworthy Systems - 5th International Conference, BlockSys 2023, Proceedings
A2 - Chen, Jiachi
A2 - Wen, Bin
A2 - Chen, Ting
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 8 August 2023 through 10 August 2023
ER -