#### Filter Results:

#### Publication Year

2005

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this work, we introduce algorithms to speedup and to scale a classical secure multicast protocol that currently goes unused due to its computational and data management requirements when the audience becomes large. This is in spite of its agreeable cryptographic properties, which offers real applicability. A core component of such an algorithm is the… (More)

We introduce a hierarchical approach for secure multicast where rekeying of groups of users is made through a method based on Euclid’s algorithm for computing GCD. We consider tree arrangements of users that decrease requirements on bandwidth as protocols of the same nature, but also show that computational requirements are less than in other similar… (More)

Media distribution over the Internet is a fact. Finding a way to protect content streaming is a hot topic. This paper presents both a new and efficient key multicasting protocol based on the use of orthogonal systems in vector spaces, and its scalable implementation by means of a platform independent server. The protocol outstands in exchanging a small… (More)

We show that every finitely generated left R-module in the Auslander class over an n-perfect ring R having a dualizing module and admitting a Matlis dualizing module has a Gorenstein projective cover. In 1966 [1], Auslander introduced a class of finitely generated modules having a certain complete resolution by projective modules. Then using these modules,… (More)

- ‹
- 1
- ›