scholarly journals Adaptive CCA Broadcast Encryption with Constant-Size Secret Keys and Ciphertexts

2012 ◽  
pp. 308-321 ◽  
Author(s):  
Duong-Hieu Phan ◽  
David Pointcheval ◽  
Siamak F. Shahandashti ◽  
Mario Strefler
Keyword(s):  
Broadcast Encryption ◽  
Constant Size ◽  
Secret Keys

scholarly journals Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts

2013 ◽  
Vol 12 (4) ◽  
pp. 251-265 ◽  
Author(s):  
Duong-Hieu Phan ◽  
David Pointcheval ◽  
Siamak F. Shahandashti ◽  
Mario Strefler
Keyword(s):  
Broadcast Encryption ◽  
Constant Size ◽  
Secret Keys

Necessity of Key Aggregation Cryptosystem for Data Sharing in Cloud Computing

2019 ◽  
pp. 1393-1407
Author(s):  
R. Deepthi Crestose Rebekah ◽  
Dhanaraj Cheelu ◽  
M. Rajasekhara Babu
Keyword(s):  
Cloud Computing ◽  
Data Sharing ◽  
Data Protection ◽  
Cloud Storage ◽  
Symmetric Encryption ◽  
Secure Storage ◽  
Constant Size ◽  
Secret Keys ◽  
Protection Mechanisms ◽  
Existing Data

Cloud computing is one of the most exciting technologies due to its ability to increase flexibility and scalability for computer processes, while reducing cost associated with computing. It is important to share the data securely, efficiently, and flexibly in cloud storage. Existing data protection mechanisms such as symmetric encryption techniques are unsuccessful in preventing data sharing securely. This article suggests Key aggregate cryptosystem which produce constant size ciphertexts in order to delegate decryption rights for any set of ciphertexts. The uniqueness is that one can aggregate any number of secret keys and make them as compact as a single key. This compact aggregate key can be easily sent to others with very limited secure storage.

Accountable authority identity-based broadcast encryption with constant-size private keys and ciphertexts

2020 ◽  
Vol 809 ◽  
pp. 73-87 ◽  
Author(s):  
Zhen Zhao ◽  
Fuchun Guo ◽  
Jianchang Lai ◽  
Willy Susilo ◽  
Baocang Wang ◽  
...  
Keyword(s):  
Broadcast Encryption ◽  
Constant Size ◽  
Identity Based

Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles

2014 ◽  
Vol 6 (2) ◽  
pp. 40-51 ◽  
Author(s):  
Xie Li ◽  
Ren Yanli
Keyword(s):  
Prime Order ◽  
Broadcast Encryption ◽  
Broadcast Channel ◽  
Adaptive Security ◽  
Random Oracles ◽  
Constant Size ◽  
Diffie Hellman ◽  
Identity Based ◽  
Bilinear Groups

Broadcast encryption provides a method of secure multi-receiver communications, where a broadcaster can encrypt a message for a set S of users who are listening to a broadcast channel. Most identity-based broadcast encryption (IBBE) schemes are not anonymous, which means the attacker can obtain the identities of all receivers from the ciphertext. In this paper, the authors propose an efficient anonymous IBBE scheme in bilinear groups of prime order, where any attacker cannot get the identities of the receivers from the ciphertext. The scheme has constant size ciphertext and achieves adaptive security based on the asymmetric decisional bilinear Diffie-Hellman Exponent (DBDHE) assumption without random oracles. The proposed scheme improves efficiency and security of anonymous IBBE schemes simultaneously.

scholarly journals Decentralized Broadcast Encryption Schemes with Constant Size Ciphertext and Fast Decryption

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 969
Author(s):  
Qutaibah Malluhi ◽  
Vinh Duc Tran ◽  
Viet Cuong Trinh
Keyword(s):  
Cloud Storage ◽  
Single Point ◽  
Broadcast Encryption ◽  
Sensitive Information ◽  
Secret Key ◽  
Practical Applications ◽  
Constant Size ◽  
Cryptographic Keys ◽  
Encryption Schemes ◽  
Target Set

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.

scholarly journals Adaptive Security of Broadcast Encryption, Revisited

2017 ◽  
Vol 2017 ◽  
pp. 1-16 ◽  
Author(s):  
Bingxin Zhu ◽  
Puwen Wei ◽  
Mingqiang Wang
Keyword(s):  
General Result ◽  
Real World ◽  
Broadcast Encryption ◽  
Adaptive Security ◽  
Key Generation ◽  
Constant Size ◽  
Real World Setting ◽  
Target User ◽  
Symmetric Key ◽  
Security Notion

We provide a strong security notion for broadcast encryption, called adaptive security in the multichallenge setting (MA-security), where the adversary can adaptively have access to the key generation oracle and the encryption oracle many times (multichallenge). The adversary specially can query for the challenge ciphertexts on different target user sets adaptively, which generalizes the attacks against broadcast encryptions in the real world setting. Our general result shows that the reduction of the adaptive secure broadcast encryption will lose a factor of q in the MA setting, where q is the maximum number of encryption queries. In order to construct tighter MA-secure broadcast encryptions, we investigate Gentry and Water’s transformation and show that their transformation can preserve MA-security at the price of reduction loss on the advantage of the underlying symmetric key encryption. Furthermore, we remove the q-type assumption in Gentry and Water’s semistatically secure broadcast encryption by using Hofheinz-Koch-Striecks techniques. The resulting scheme instantiated in a composite order group is MA-secure with constant-size ciphertext header.

Sign in / Sign up

Export Citation Format

Share Document