Secure Acknowledgment of multicast messages in open peer-to-peer networks

Antonio Nicolosi, David Mazières

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

Abstract

We propose a new cryptographic technique, Acknowledgment Compression, permitting senders of multicast data to verify that all interested parties have either received the data or lost network connectivity. Joining the system and acknowledging messages both require bandwidth and computation logarithmic in the size of a multicast group. Thus, the technique is well-suited to large-scale, peer-to-peer multicast groups in which neither the source nor any single peer wishes to download a complete list of participants. In the event that sufficiently many nodes are malicious, a message may fail to verify. However, in such cases the source learns the real network address of a number of malicious nodes.

Original languageEnglish
Pages (from-to)259-268
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3279
StatePublished - 2004
EventThird International Workshop on Peer-to-Peer Systems, IPTPS 2004 - La Jolla, CA, United States
Duration: 26 Feb 200427 Feb 2004

Fingerprint

Dive into the research topics of 'Secure Acknowledgment of multicast messages in open peer-to-peer networks'. Together they form a unique fingerprint.

Cite this