A protocol for secure content distribution in pure P2P networks

Proceedings - International Workshop on Database and Expert Systems Applications, DEXA

Volumn , Issue , 2006, Pages 712-716

  Palomar, Esther ^a   Estevez Tapiador, Juan M ^a   Hernandez Castro, Julio C ^a   Ribagorda, Arturo ^a  

^a UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CERTIFICATION AUTHORITIES; COMPUTATIONAL EFFORT; CONTENT AUTHENTICATION; CONTENT DISTRIBUTION; CONTENT MODIFICATION; PEER-TO-PEER SYSTEM; SECURITY MECHANISM; TRUSTED THIRD PARTIES;

DISTRIBUTED COMPUTER SYSTEMS; EXPERT SYSTEMS; NETWORK SECURITY;

PEER TO PEER NETWORKS;

EID: 77952394488     PISSN: 15294188     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. M. Abadi, M. Burrows, M. Manasse, and T. Wobber. Moderately hard, memory-bound functions. ACM Transactions on Internet Technology, 5(2):299-327, May 2005.
2. E. Damiani, S. D. Capitani, S. Paraboschi, P. Samarati, and F. Violante. A reputation-based approach for choosing reliable resources in peer-to-peer networks. In Proceedings of the 9th ACM Conference on Computer and Communications Security, pages 207-216, Washington, USA, November 2002. ACM.
3. N. Daswani and H. Garcia-Molina. Pong-cache poisoning in guess. In Proceedings of the 11th ACM conference on Computer and communications security, pages 98-109, Washington, USA, October 2004. ACM.
4. J. Douceur. The sybil attack. In Proceedings of the 1st InternationalWorkshop on Peer-to-Peer Systems, pages 251-260, Cambridge, USA, March 2002.
5. C. Dwork and M. Naor. Pricing via processing or combatting junk mail. In Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, volume 740, pages 139-147, 1992.
6. A. Juels and J. Brainard. Client puzzles: A cryptographic defense against connection depletion attacks. In Proceedings of the Networks and Distributed Security Systems, pages 151-165, California, USA, February 1999.
7. L. Lamport, R. Shostak, and M. Pease. The byzantine general problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
8. P. Maniatis, T. Giuli, M. Roussopoulos, D. Rosenthal, and M. Baker. Impeding attrition attacks in p2p systems. In Proceedings of the 11th ACM SIGOPS European Workshop, Leuven, Belgium, September 2004. ACM.
9. D. Mankins, R. Krishnan, C. Boyd, J. Zao, and M. Frentz. Mitigating distributed denial of service attacks with dynamic resource pricing. In Proceedings of the 17th Annual conference on Computer Security Applications, June 2001.
10. V. Pathak and L. Iftode. Byzantine fault tolerant public key authentication in peer-to-peer systems. Computer Networks Special Issue on Management in Peer-to-Peer Systems: Trust, Reputation and Security, 50(4):579-596, March 2006.
11. D. Rosenthal, M. Roussopoulos, P. Maniatis, and M. Baker. Economic measures to resist attacks on a peer-to-peer network. In Proceedings of the Workshop on Economics of Peer-to-Peer Systems, Berkeley, USA, June 2003.
12. P. Syverson. Weakly secret bit commitment: Applications to lotteries and fair exchange. In Proceedings of the 11th IEEE Computer Security Foundations Workshop, pages 2- 13, 1998.