Multiparty Communications Security
The goal of this project is to study security issues in the context of
multipoint communications.
Multipoint communications encompass several models ranging from the
usual 1-to-N pattern of multicast to the generalized N-to-N
scenario. In the initial stage, the project addresses the key
distribution problem in multicast communication. The main design
criteria are scalability and security with large dynamic recipient
groups.
Solutions derived from common asymmetric techniques are first
explored. Spreading of symmetric algorithms along the multicast tree
will further be investigated at the next stage of the project in order
to exploit the higher performance of symmetric techniques for bulk
data encryption. Multicast on Internet and web proxies in caching will
be addressed next as the application of the secure multicast schemes
developed in the project.
Team
Publications
| [MP00] |
Refik Molva and Alain Pannetrat.
Scalable Multicast Security with Dynamic
Recipient Groups. ACM Transactions on Information and System Security,
3, August 2000.
PDF |
| [MP99] |
R. Molva and A. Pannetrat.
Scalable Multicast Security in Dynamic
Groups. In Proceedings of the 6th ACM Conference on Computer and
Communications Security, Singapore, November 1999.
PDF |
| [Pan98] |
A. Pannetrat.
Scalable multicast key distribution.
Technical Report RR-98-044, June 1998. Master thesis, D.E.A. R.S.D., Université
de Nice Sophia Antipolis. |
|