4/2020 - 9 |
A Comparison on Broadcast Encryption Schemes: A New Broadcast Encryption SchemeBODUR, H. , KARA, R. |
Extra paper information in |
Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF (1,588 KB) | Citation | Downloads: 960 | Views: 2,049 |
Author keywords
cryptography, public key, random number generation, data security, digital signatures
References keywords
secure(18), group(18), management(16), communications(13), networks(11), security(9), network(9), efficient(9), information(8), cloud(8)
No common words between the references section and the paper title.
About this article
Date of Publication: 2020-11-30
Volume 20, Issue 4, Year 2020, On page(s): 69 - 80
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2020.04009
Web of Science Accession Number: 000594393400009
SCOPUS ID: 85098194995
Abstract
In broadcast communication, the schemes in which encryption methods are employed are often used to transmit messages from a source to multiple users. There are three types of scheme categories: central, contributory and hybrid schemes. In this work, three central techniques which are widely used nowadays are discussed: Logical Key Hierarchy (LKH), One-way Function Tree (OFT) and One-way Function Chain (OFC). A new central broadcast scheme has also been proposed. This scheme uses an asymmetric encryption method in the root node and the user nodes and, as opposed to other central schemes, a symmetric encryption method as well. It contains a hash() function in the intermediate node calculations. The proposed scheme was compared with the existing schemes in terms of number of key transmissions, number of operations, number of user keys, size of user keys, and size of key transmission in user adding/removing and batch user adding/removing operations. The results are shown graphically. |
References | | | Cited By |
Web of Science® Times Cited: 1 [View]
View record in Web of Science® [View]
View Related Records® [View]
Updated today
SCOPUS® Times Cited: 1
View record in SCOPUS® [Free preview]
View citations in SCOPUS® [Free preview]
[1] Security Protocol Function Using Quantum Elliptic Curve Cryptography Algorithm, Sudharson, K., Arun, S., Intelligent Automation & Soft Computing, ISSN 1079-8587, Issue 3, Volume 34, 2022.
Digital Object Identifier: 10.32604/iasc.2022.026483 [CrossRef]
Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.
Web of Science® is a registered trademark of Clarivate Analytics, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.