![](images/logo.png?v=2)
International Journal For Multidisciplinary Research
E-ISSN: 2582-2160
•
Impact Factor: 9.24
A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal
Home
Research Paper
Submit Research Paper
Publication Guidelines
Publication Charges
Upload Documents
Track Status / Pay Fees / Download Publication Certi.
Editors & Reviewers
View All
Join as a Reviewer
Reviewer Referral Program
Get Membership Certificate
Current Issue
Publication Archive
Conference
Publishing Conf. with IJFMR
Upcoming Conference(s) ↓
WSMCDD-2025
GSMCDD-2025
Conferences Published ↓
RBS:RH-COVID-19 (2023)
ICMRS'23
PIPRDA-2023
Contact Us
Plagiarism is checked by the leading plagiarism checker
Call for Paper
Volume 6 Issue 5
September-October 2024
Indexing Partners
![Academia.edu Academia](images/index-partners/academia.png)
![Advanced Sciences Index Advanced Sciences Index](images/index-partners/advanced-sciences.png)
![Bielefeld Academic Search Engine Bielefeld Academic Search Engine](images/index-partners/bielefeld.gif)
![CiteSeer CiteSeer](images/index-partners/cite-seer.png)
![DRJI DRJI](images/index-partners/drji.png)
![Google Scholar Google Scholar](images/index-partners/google-scholar.png)
![Independent Search Engine & Directory Network (isedn.org) Independent Search Engine & Directory Network](images/index-partners/isedn.jpg)
![ISI (International Scientific Indexing) ISI (International Scientific Indexing)](images/index-partners/isi.png)
![Issuu Issuu](images/index-partners/issuu.png)
![Mendeley Research Networks Mendeley Research Networks](images/index-partners/mendeley.png)
![RefSeek RefSeek](images/index-partners/ref-seek.png)
![ResearcherId - Thomson Reuters ResearcherId - Thomson Reuters](images/index-partners/researcher-id.png)
![ResearchGate ResearchGate](images/index-partners/research-gate.png)
![Scirus Scirus](images/index-partners/scirus.png)
![Scribd Scribd](images/index-partners/scribd.gif)
![Semantic Scholar Semantic Scholar](images/index-partners/semantic-scholar.png)
![UTeM - Universiti Teknikal Malaysia Melaka UTeM - Universiti Teknikal Malaysia Melaka](images/index-partners/utem.png)
![Wiki for Call for Papers Wiki for Call for Papers](images/index-partners/wiki-cfp.png)
![WorldCat WorldCat](images/index-partners/world-cat.png)
An Efficient Technique for Secure Message Broadcasting
Author(s) | C.Althaf, Vasantha Venu Gopal Sudheer, Manideep Kandepu, Filia Mary A S, E. Indhuja |
---|---|
Country | India |
Abstract | In contemporary cryptographic discourse, traditional broadcast encryption (BE) schemes have emerged as a robust method for secure broadcasting to specific subsets of members within a group. However, these schemes typically necessitate the involvement of a trusted entity for the distribution of decryption keys, which introduces vulnerabilities. Conversely, group key agreement (GKA) protocols offer a means of negotiating a shared encryption key among a group of members across open networks, thereby ensuring that only authorized group members possess the capability to decrypt ciphertexts encrypted under this key. Nonetheless, GKA protocols lack the flexibility to allow senders to selectively exclude specific members from decrypting ciphertexts. In response to this dichotomy, we present a pioneering hybrid cryptographic primitive termed Contributory Broadcast Encryption (ConBE), which ingeniously amalgamates the strengths of both BE and GKA paradigms. In this innovative approach, a cohesive group of members collaboratively negotiates a shared public encryption key, with each member possessing an associated decryption key. This setup empowers senders, upon accessing the public group encryption key, to exercise granular control over decryption, selectively restricting access to a subset of designated recipients. Expounding upon this foundational framework, we introduce a ConBE scheme distinguished by succinct ciphertexts, thus optimizing computational efficiency without compromising on security guarantees. Through rigorous analysis, our scheme is proven to be fully collusion-resistant under the decision n- Bilinear Diffie-Hellman Exponentiation (BDHE) assumption, thereby ensuring robust security within the standard cryptographic model. Furthermore, in a complementary contribution, we unveil a novel BE scheme endowed with aggregatable properties, which hold paramount significance in the construction of advanced cryptographic protocols. These properties facilitate the aggregation of decryption rights across multiple ciphertexts, thereby enhancing scalability and versatility in cryptographic applications. Our comprehensive exploration and formalization of ConBE, alongside the development of efficient cryptographic schemes, represent a significant stride forward in the realm of secure data transmission and access control mechanisms. This endeavor underscores our commitment to advancing cryptographic methodologies that reconcile security, efficiency, and flexibility in contemporary distributed computing environments |
Keywords | Broadcast Encryption (BE), Group Key Agreement (GKA). |
Field | Computer |
Published In | Volume 6, Issue 2, March-April 2024 |
Published On | 2024-03-23 |
Cite This | An Efficient Technique for Secure Message Broadcasting - C.Althaf, Vasantha Venu Gopal Sudheer, Manideep Kandepu, Filia Mary A S, E. Indhuja - IJFMR Volume 6, Issue 2, March-April 2024. DOI 10.36948/ijfmr.2024.v06i02.14240 |
DOI | https://doi.org/10.36948/ijfmr.2024.v06i02.14240 |
Short DOI | https://doi.org/gtn322 |
Share this
![](images/issn-logo.png)
E-ISSN 2582-2160
![](images/ean-13-barcode.gif)
CrossRef DOI is assigned to each research paper published in our journal.
IJFMR DOI prefix is
10.36948/ijfmr
Downloads
All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.
![](images/loading.gif)