Ateniese et al. introduced the primitive of matchmaking encryption (ME) at CRYPTO 2019 and left open several important questions, which include extending ME to fuzzy cases or giving an efficient ME in the identity-based setting without relying on random oracles. The main challenge is to achieve fuzzy bilateral access control while providing identity privacy of the sender and receiver, message confidentiality and authenticity without random oracles. In this work, we resolve the question by formalizing the first fuzzy identity-based ME (IB-ME) and presenting a concrete construction. Specifically, we propose the formal syntax definition of fuzzy IB-ME. In fuzzy IB-ME, the identities of senders and receivers are characterized by attribute sets. A ciphertext can be correctly decrypted if the overlaps between the attribute set of the sender or receiver and the attribute set specified by the other party are simultaneously greater than a threshold, which can be applied to many attractive applications such as fuzzy bilateral access control in online social dating. Then, we present concrete details of fuzzy IB-ME based on fuzzy identity-based encryption, which does not rely on other cryptographic tools such as two-input functional encryption and non-interactive zero-knowledge proof systems. In this process, fuzzy bilateral access control and identity privacy are achieved through the formalism of arranged ME and the splitting technique while message authenticity is provided through the authentication and binding of the encryption key. The identity privacy of the sender and receiver, confidentiality, and authenticity of messages are reduced to the decisional bilinear Diffie-Hellman, decision linear, and computational bilinear Diffie-Hellman assumptions in the selective model without random oracles. Finally, we implement the scheme and evaluate its performance through theoretical analyses and experiments to demonstrate its efficiency.
Attribute-based encryption can be used to realize fine-grained data sharing in open networks. However, in practical applications, we have to address further challenging issues, such as attribute revocation and data search. How do data users search for the data they need in massive amounts of data? When users leave the system, they lose the right to decrypt the shared data. In this case, how do we ensure that revoked users cannot decrypt shared data? In this paper, we successfully address these issues by proposing a hidden policy attribute-based data sharing scheme with direct revocation and keyword search. In the proposed scheme, the direct revocation of attributes does not need to update the private key of non-revoked users during revocation. In addition, a keyword search is realized in our scheme, and the search time is constant with the increase in attributes. In particular, the policy is hidden in our scheme, and hence, users’ privacy is protected. Our security and performance analyses show that the proposed scheme can tackle the security and efficiency concerns in cloud computing.
26 April 2022 in IEEE Transactions on Cloud Computing
Forward secure searchable encryption (FSSE) scheme allows one data user to search on encrypted databases while resisting the file injection attack. The data utilization can be further improved by extending the single-user scenario to the multi-user scenario. However, there are some issues needed to be considered when a data owner shares data with multiple data users. First, the public cloud server can not be completely trusted as it may be dishonest returning incorrect or incomplete results. Second, authorized users may trade their private keys for financial benefit. To our knowledge, state-of-the-art searchable encryption schemes only consider part of the following desirable features: the verifiability of results, the resistance to file injection attacks, the traceability and revocation of malicious users who abuse their private keys in the multi-user setting. Based on these motivations, we first propose enabling traceable and verifiable multi-user FSSE, which achieves the above functionalities. Besides, we carry out the security proof which demonstrates that our scheme can meet the requirements of security. We also assess the performance from theoretical analysis and experimental analysis, which shows that compared with other similar schemes, our scheme has richer functionalities with comparable efficiency.
20 January 2021 in Security and Communication Networks
The emergence of the cloud storage has brought great convenience to people’s life. Many individuals and enterprises have delivered a large amount of data to the third-party server for storage. Thus, the privacy protection of data retrieved by the user needs to be guaranteed. Searchable encryption technology for the cloud environment is adopted to ensure that the user information is secure with retrieving data. However, most schemes only support single-keyword search and do not support file updates, which limit the flexibility of the scheme. To eliminate these problems, we propose a blockchain-enabled public key encryption scheme with multi-keyword search (BPKEMS), and our scheme supports file updates. In addition, smart contract is used to ensure the fairness of transactions between data owner and user without introducing a third party. At the data storage stage, our scheme realizes the verifiability by numbering the files, which ensures that the ciphertext received by the user is complete. In terms of security and performance, our scheme is secure against inside keyword guessing attacks (KGAs) and has better computation overhead than other related schemes.
30 May 2017 in Journal of Ambient Intelligence and Humanized Computing
Mobile crowdsensing (MCS) utilizes ubiquitous mobile devices to collect massive amounts of data and offer various high-quality services. During the data collection and upload process, bilateral access control is implemented to recruit qualified data providers and prevent unauthorized access to collected data. However, the efficiency of existing bilateral access control schemes applicable in the data collection phase is dissatisfactory, as their ciphertext sizes are linear with the number of attributes. Additionally, data confidentiality and authenticity, as well as lightweight encryption and decryption processes, are crucial for the deployment of MCS since the former eliminate the risks of data abuse and false data injection, and the latter are typically limited in their computation and communication resources. To reduce the resource consumption of these devices, we present EBAC-CC, an efficient bilateral access control with constant-size ciphertexts that ensures data confidentiality and authenticity and allows for flexible threshold bilateral access control. Besides, offline/online techniques and outsourced decryption are employed to quickly generate ciphertexts and recover perceptual data, which also alleviates their computation burdens. We also prove its privacy and authenticity in the standard model and evaluate its efficacy theoretically and experimentally, demonstrating its superiority over other bilateral access control schemes.