Efficient content authentication in peer-to-peer networks

Roberto Tamassia, Nikos Triandopoulos

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

22 Scopus citations

Abstract

We study a new model for data authentication over peer-to-peer (p2p) storage networks, where data items are stored, queried and authenticated in a totally decentralized fashion. The model captures the security requirements of emerging distributed computing applications. We present an efficient construction of a distributed Merkle tree (DMT), which realizes an authentication tree over a p2p network, thus extending a fundamental cryptographic technique to distributed environments. We show how our DMT can be used to design an authenticated distributed hash table that is secure against replay attacks and consistent with the update history. Our scheme is built on top of a broad class of existing p2p overlay networks and achieves generality by using only the basic functionality of object location. We use this scheme to design the first efficient distributed authenticated dictionary.

Original languageEnglish
Title of host publicationApplied Cryptography and Network Security - 5th International Conference, ACNS 2007, Proceedings
Pages354-372
Number of pages19
DOIs
StatePublished - 2007
Event5th International Conference on Applied Cryptography and Network Security, ACNS 2007 - Zhuhai, China
Duration: 5 Jun 20078 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4521 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Applied Cryptography and Network Security, ACNS 2007
Country/TerritoryChina
CityZhuhai
Period5/06/078/06/07

Fingerprint

Dive into the research topics of 'Efficient content authentication in peer-to-peer networks'. Together they form a unique fingerprint.

Cite this