Efficient Content Authentication in Peer-to-Peer Networks

DOI10.1007/978-3-540-72738-5_23MaRDI QIDQ3612392zbMATH OpenOpenAlexFDO

Authors Roberto Tamassia, Nikos Triandopoulos

Publication date 10 March 2009

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72738-5_23

Mathematics Subject Classification ID

Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Reliable resource searching in P2P networks
• scientific article; zbMATH DE number 1690176
• scientific article; zbMATH DE number 1931793
• Byzantine fault tolerant public key authentication in peer-to-peer systems
• A general model for authenticated data structures

Cited in

(8)

• KRB-CCN: lightweight authentication and access control for private content-centric networks
• Byzantine fault tolerant public key authentication in peer-to-peer systems
• Authenticated hash tables based on cryptographic accumulators
• Reliable resource searching in P2P networks
• Super-Efficient Verification of Dynamic Outsourced Databases
• Efficient authenticated data structures for graph connectivity and geometric search problems
• Efficient reliable communication over partially authenticated networks
• Data distribution in a peer to peer storage system

This page was built for publication: Efficient Content Authentication in Peer-to-Peer Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612392)