Recipient Revocable Broadcast Encryption Schemes Without Random Oracles

2018 ◽  
pp. 191-213 ◽  
Author(s):  
Kamalesh Acharya ◽  
Ratna Dutta
Keyword(s):  
Broadcast Encryption ◽  
Random Oracles ◽  
Encryption Schemes

Public Key Broadcast Encryption Schemes With Shorter Transmissions

2008 ◽  
Vol 54 (3) ◽  
pp. 401-411 ◽  
Author(s):  
Jong Hwan Park ◽  
Hee Jean Kim ◽  
M.H. Sung ◽  
Dong Hoon Lee
Keyword(s):  
Public Key ◽  
Broadcast Encryption ◽  
Encryption Schemes

Lattice-based Dynamical and Anonymous Broadcast Encryption Scheme for Wireless Ad Hoc Networks

2015 ◽  
Vol 15 (03n04) ◽  
pp. 1540005
Author(s):  
FENGHE WANG ◽  
XU AN WANG ◽  
CHUNXIAO WANG
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Broadcast Encryption ◽  
Encryption Scheme ◽  
Semantic Security ◽  
The Standard Model ◽  
Encryption Schemes ◽  
Hoc Networks ◽  
Learning With Errors Problem

A lattice-based broadcast encryption scheme is proposed for ad hoc networks in this paper. The proposed scheme is dynamical and anonymous simultaneously. The achievements of the dynamic and anonymity properties are efficient. In fact, the broadcaster can send the message to any receivers set without any added operations. The anonymity properties of the proposed scheme can protect the identity of an authorized receiver. Both dynamic and anonymity properties are important for broadcast encryption to used in many cases like wireless ad hoc network. The semantic security of the proposed scheme is proven in the standard model under the hardness of the learning with errors problem (LWE). Compared with known lattice-based broadcast encryption schemes, the proposed scheme shares some advantages with respect to the ciphtertext length and the message-ciphtertext expanse factor.

scholarly journals Verifiable Encryption and Applications to Group Signatures and Signature Sharing

1998 ◽  
Vol 5 (32) ◽  
Author(s):  
Jan Camenisch ◽  
Ivan B. Damgård
Keyword(s):  
Digital Signatures ◽  
Encryption Scheme ◽  
Random Oracles ◽  
Group Signatures ◽  
Wide Range ◽  
Encryption Schemes ◽  
Verifiable Encryption

We generalise and improve the security and efficiency of the verifiable encryption scheme of Asokan et al., such that it can rely on more general assumptions, and can be proven secure without relying on random oracles. We show a new application of verifiable encryption to group signatures with separability, these schemes do not need special purpose keys but can work with a wide range of signature and encryption schemes already in use. Finally, we extend our basic primitive to verifiable threshold and group encryption. By encrypting digital signatures this way, one gets new solutions to the verifiable signature sharing problem.

Sign in / Sign up

Export Citation Format

Share Document