DocumentCode :
144804
Title :
A lookup tree based security for one-to-many communication
Author :
Abuelyaman, Eltayeb
Author_Institution :
Dept. of Comput. Sci., Univ. of Nizwa, Nizwa, Oman
Volume :
2
fYear :
2014
fDate :
26-28 April 2014
Firstpage :
1293
Lastpage :
1297
Abstract :
This paper proposes a scheme that optimizes overhead resulting from revocation and/or admission of participants in one-to-many secure group meetings. The scheme requires transmission of only the identifications of involved participants to settle changes. For added security, an automatic key refreshing mechanism with no transmission overhead is suggested. Periodical refreshing of the ciphering key is used as a countermeasure against hacking.
Keywords :
cryptography; telecommunication security; automatic key refreshing mechanism; ciphering key; hacking; lookup tree based security; one-to-many communication; one-to-many secure group meetings; periodical refreshing; secure distributed message delivery systems; Atmospheric measurements; Computer science; Encryption; Particle measurements; Protocols; broadcasting; decryption; encryption; key; prime numbers; revocation; subscriber;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Science, Electronics and Electrical Engineering (ISEEE), 2014 International Conference on
Conference_Location :
Sapporo
Print_ISBN :
978-1-4799-3196-5
Type :
conf
DOI :
10.1109/InfoSEEE.2014.6947880
Filename :
6947880
Link To Document :
بازگشت