scholarly journals Analysis and Improvement of Key Distribution Scheme for Secure Group Communication

2016 ◽  
Vol 2016 ◽  
pp. 1-7
Author(s):  
Jia Ning Luo ◽  
Ming Hour Yang
Keyword(s):  
Group Communication ◽  
Encryption Algorithm ◽  
Forward Secrecy ◽  
Secure Group Communication ◽  
Distribution Scheme ◽  
Key Update ◽  
Malicious Insiders ◽  
And Performance ◽  
Ciphertext Policy ◽  
Group Member

In a secure group communication, messages between a group coordinator and members are protected by session keys. If a group’s membership changes, the session keys should be updated to insure forward secrecy and backward secrecy. Zhou and Huang proposed a key-updated scheme based on ciphertext-policy attribute encryption algorithm to improve the security of key-update mechanism, but their scheme is vulnerable: a malicious group member may send forged key-update messages to control the group. In this paper, we analyze the vulnerability in Zhou and Huang’s scheme and propose an enhanced scheme. In our scheme, only the group initiator can update group keys and the verification of key-update mechanism is improved to prevent malicious insiders from controlling the group. We also give a security and performance analysis of our scheme.

scholarly journals DP5: A Private Presence Service

2015 ◽  
Vol 2015 (2) ◽  
pp. 4-24 ◽  
Author(s):  
Nikita Borisov ◽  
George Danezis ◽  
Ian Goldberg
Keyword(s):  
Sensitive Information ◽  
Forward Secrecy ◽  
Online Presence ◽  
Perfect Forward Secrecy ◽  
High Integrity ◽  
Key Update ◽  
And Performance ◽  
Social Applications ◽  
Infrastructure Services

AbstractUsers of social applications like to be notified when their friends are online. Typically, this is done by a central server keeping track of who is online and offline, as well as of all of the users’ “buddy lists”, which contain sensitive information. We present DP5, a cryptographic service that implements online presence indication in a privacy-friendly way. DP5 allows clients to register their online presence and query the presence of their list of friends while keeping this list secret. Besides presence, high-integrity status updates are supported, to facilitate key update and rendezvous protocols. While infrastructure services are required for DP5 to operate, they are designed to not require any long-term secrets and provide perfect forward secrecy in case of compromise. We provide security arguments for the indistinguishability properties of the protocol, as well as an evaluation of its scalability and performance.

Key-update distribution in secure group communication

2010 ◽  
Vol 33 (6) ◽  
pp. 689-705 ◽  
Author(s):  
Sandeep S. Kulkarni ◽  
Bezawada Bruhadeshwar
Keyword(s):  
Group Communication ◽  
Secure Group Communication ◽  
Key Update

End-to-end secure group communication for the Internet of Things

2021 ◽  
Vol 58 ◽  
pp. 102772
Author(s):  
André Lizardo ◽  
Raul Barbosa ◽  
Samuel Neves ◽  
Jaime Correia ◽  
Filipe Araujo
Keyword(s):  
Internet Of Things ◽  
Group Communication ◽  
The Internet ◽  
Secure Group Communication ◽  
End To End ◽  
The Internet Of Things

Image Encryption Algorithm Based on a Novel 4D Chaotic System

2021 ◽  
Vol 15 (4) ◽  
pp. 118-131
Author(s):  
Sadiq A. Mehdi
Keyword(s):  
Chaotic System ◽  
Initial Conditions ◽  
High Sensitivity ◽  
Encryption Algorithm ◽  
Pseudorandom Sequence ◽  
Key Space ◽  
Xor Operation ◽  
Change Intensity ◽  
And Performance ◽  
Image Cryptosystem

In this paper, a novel four-dimensional chaotic system has been created, which has characteristics such as high sensitivity to the initial conditions and parameters. It also has two a positive Lyapunov exponents. This means the system is hyper chaotic. In addition, a new algorithm was suggested based on which they constructed an image cryptosystem. In the permutation stage, the pixel positions are scrambled via a chaotic sequence sorting. In the substitution stage, pixel values are mixed with a pseudorandom sequence generated from the 4D chaotic system using XOR operation. A simulation has been conducted to evaluate the algorithm, using the standardized tests such as information entropy, histogram, number of pixel change rate, unified average change intensity, and key space. Experimental results and performance analyses demonstrate that the proposed encryption algorithm achieves high security and efficiency.

Sign in / Sign up

Export Citation Format

Share Document