Abstract

Broadcast encryption ( BE ) allows a sender to encrypt a message to an arbitrary target set of legitimate users and to prevent non-legitimate users from recovering the broadcast information. BE has numerous practical applications such as satellite geolocation systems, file sharing systems, pay-TV systems, e-Health, social networks, cloud storage systems, etc. This paper presents two new decentralized BE schemes. Decentralization means that there is no single authority responsible for generating secret cryptographic keys for system users. Therefore, the scheme eliminates the concern of having a single point of failure as the central authority could be attacked, become malicious, or become unavailable. Recent attacks have shown that the centralized approach could lead to system malfunctioning or to leaking sensitive information. Another achievement of the proposed BE schemes is their performance characteristics that make them suitable for environments with light-weight clients, such as in Internet-of-Things (IoT) applications. The proposed approach improves the performance over existing decentralized BE schemes by simultaneously achieving constant size ciphertext, constant size secret key and fast decryption.

Highlights

  • Broadcast encryption (BE) was first introduced by Fiat and Naor in [1]

  • Constant-size ciphertext; constant-size secret key: in our first scheme, the secret key includes a maximum of two elements; fast decryption: to decrypt, the user only computes two Pairings in the prime order setting; decryption key size is linear in the maximum number of users in the system; The scheme is categorized as Level 2

  • Recent attacks have shown that a single authority for managing keys creates a single point of failure as this authority could be hacked or could become unavailable

Read more

Summary

Introduction

Broadcast encryption (BE) was first introduced by Fiat and Naor in [1]. BE enables a sender to encrypt a message for an arbitrary target set of legitimate users and to prevent non-legitimate users from obtaining any information about the broadcast content, even if some or all of them collude. Second is the bottleneck problem arising from having a single point of failure This problem is caused by the fact that we have only one authority who generates secret keys for all users. Each user colluding at the setup phase plays the role of an authority to generate a partial secret key for a new user. The full secret key of the new user is built from all of these partial secret keys This level obviously deals well with the problem of trusting a single authority with the keys, but does not handle the bottleneck problem. Level 3: To deal with the problem of malfunctioning authority in Level 2, in this level, the system is able to revoke the right of generating partial secret keys for new users from a malfunctioning authority. The proposed methods can simultaneously achieve the very desirable properties of constant size ciphertext, constant size secret key and fast decryption, which are important in environments with weak clients (such as mobile phones, smart cards or IoT devices)

Related Work
Our Contributions
Paper Organization
Preliminaries
Decentralized Broadcast Encryption
Security Model
Linear Secret Sharing Matrix
Construction
Security
Second Scheme
Performance Analysis
Encryption
Findings
Conclusions

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.