テクノロジーの進歩に関する国際ジャーナル
オープンアクセス

概要

A Multicasting Scheme Based on Signcryption for Dynamic Groups

Sanjeev Agnihotri and Uma Kumari

A cryptographic primitive is termed as “signcryption" which simultaneously fulfills both the functions of digital signature and public key encryption in a logically single step and with cost significantly smaller than that required by signature-then-encryption as proved by Zheng[1]. Signcryption satisfies unforgeability and it focuses on point-to-point communication . In this algorithm a new signcryption scheme has been proposed for multiple broadcasters and for multiple recipients in distributed environments by creating a new hierarchical tree for every broadcaster having scalability and containment features. This is achieved by the use of routers connected to various stages which will perform the proxy encryption work. At any stage any of the routers may perform the filtering work as it can act as filter and can perform whether incoming packet is for connected subtree. The beauty of this algorithm is that there can be any number of users connected to the routers. The users may be added or deleted time to time we can use untrusted parties as intermediatery routers which won’t get any idea of what is broadcasted.