Symmetric polynomial based dynamic conference scheme with extension in bursty operation

Abstract

Secure Group Communications (SGC) is becoming an extremely important research area because of its potentially enormous application paradigms. Symmetric polynomial based dynamic conference scheme is a typical technique for specific SGC applications. In this paper, we extend the symmetric polynomial based dynamic conference scheme. The extended scheme will allow any subset of users of any size to form a privileged subgroup, allow users to join and leave dynamically, and can perform bursty operation, especially when multiple users leave, in a very efficient way.

Byrav Ramamurthy
Byrav Ramamurthy
Professor & PI

My research areas include optical and wireless networks, peer-to-peer networks for multimedia streaming, network security and telecommunications. My research work is supported by the U.S. National Science Foundation, U.S. Department of Energy, U.S. Department of Agriculture, NASA, AT&T Corporation, Agilent Tech., Ciena, HP and OPNET Inc.