Abstract

Nowadays, the widely deployed and high performance Internet of Things (IoT) facilitates the communication between its terminal nodes. To enhance data sharing among terminal devices and ensure the recipients’ privacy protection, a few anonymous multi-recipient broadcast encryption (AMBE) proposals are recently given. Nevertheless, the majority of these AMBE proposals are only proven be securely against adaptively chosen plain-text attack (CPA) or selectively chosen ciphertext attack (CCA). Furthermore, all AMBE proposals are subjected to key escrow issue due to inherent characteristics of the ID-based public cryptography (ID-PKC), and cannot furnish secure de-duplication detection. However, for cloud storage, it is very important for expurgating duplicate copies of the identical message since de-duplication can save the bandwidth of network and storage space. To address the above problems, in the work, we present a privacy-preserving multi-receiver certificateless broadcast encryption scheme with de-duplication (PMCBED) in the cloud-computing setting based on certificateless cryptography and anonymous broadcast encryption. In comparison with the prior AMBE proposals, our scheme has the following three characteristics. First, it can fulfill semantic security notions of data-confidentiality and receiver identity anonymity, whereas the existing proposals only accomplish them by formalizing the weaker security models. Second, it achieves duplication detection of the ciphertext for the identical message encrypted with our broadcast encryption. Finally, it also avoids the key escrow problem of the AMBE schemes.

Highlights

  • With development of various Internet of Things (IoT) applications, the communication amongst smart IoT devices has become more and more frequent and convenient

  • Only the receivers that belong to the subset S can recover the message by their private key, while the other receivers outside of S can obtain no information about the delivered data

  • We think that the Decisional Diffie–Hellman problem (DDH) problem holds against A if the algorithm A is capable of distinguishing the difference of a1 b1 P1 and W in a non-negligible probability ε > 1/2

Read more

Summary

Introduction

With development of various Internet of Things (IoT) applications, the communication amongst smart IoT devices has become more and more frequent and convenient. Let us consider an example: a user wants to share some sensitive files with its friends in the cloud; for individual privacy, the user does not want its friends to learn about the others’ identity because they might be the opponent This problem is very similar to blind carbon copy (BCC) in the email system. Attribute-based encryption provides scalable encryption while supporting anonymity for users in the same group, that is, with the same attributes [19,20] They have been applied widely in cloud computing to support access control for data sharing [21]. Our construction is characterised as follows: firstly, it is the first anonymous certificateless broadcast encryption scheme with de-duplication; secondly, it is capable of simultaneously achieving confidentiality and anonymity of the receivers’ identities under adaptive CCA security.

Related Works
Bilinear Groups
Security Assumptions
System Model
Security Models
Our Scheme
Discussion
Security Analysis
Performance Analysis
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call