AN EFFICIENT METHODOLOGY TO LIMIT PATH LENGTH GUARANTEEING ANONYMITY IN OVERLAY NETWORKS

Juan Pedro Muñoz-Gea; Josemaria Malgosa-Sanahuja; Pilar Manzanares-Lopez; Juan Carlos Sanchez-Aarnoutse; Joan Garcia-Haro

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

AN EFFICIENT METHODOLOGY TO LIMIT PATH LENGTH GUARANTEEING ANONYMITY IN OVERLAY NETWORKS

Topics: Peer-To-Peer Security

In Proceedings of the International Conference on Security and Cryptography - Volume 0ICETE, 205-208, 2008 , Porto, Portugal

Authors: Juan Pedro Muñoz-Gea ; Josemaria Malgosa-Sanahuja ; Pilar Manzanares-Lopez ; Juan Carlos Sanchez-Aarnoutse and Joan Garcia-Haro

Affiliation: Polytechnic University of Cartagena, Spain

Keyword(s): Anonymity, multi-hop paths, overlay networks.

Related Ontology Subjects/Areas/Topics: Peer-To-Peer Security

Abstract: An alternative to guarantee anonymity in overlay networks may be achieved by building a multi-hop path between the origin and the destination. However, one hop in the overlay network can consist of multiple Internet Protocol (IP) hops. Therefore, the length of the overlay multi-hop path must be reduced in order to maintain a good balance between the cost and the benefit provided by the anonymity facility. Unfortunately, the simple Time-To-Live (TTL) algorithm cannot be directly applied here since its use could reveal valuable information to break anonymity. In this paper, a new mechanism which reduces the length of the overlay multi-hop paths is presented. The anonymity level is evaluated by means of simulation and good results are reported.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.116.40.177

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Pedro Muñoz-Gea, J.; Malgosa-Sanahuja, J.; Manzanares-Lopez, P.; Carlos Sanchez-Aarnoutse, J. and Garcia-Haro, J. (2008). AN EFFICIENT METHODOLOGY TO LIMIT PATH LENGTH GUARANTEEING ANONYMITY IN OVERLAY NETWORKS. In Proceedings of the International Conference on Security and Cryptography (ICETE 2008) - SECRYPT; ISBN 978-989-8111-59-3; ISSN 2184-3236, SciTePress, pages 205-208. DOI: 10.5220/0001916202050208

@conference{secrypt08,
author={Juan {Pedro Muñoz{-}Gea}. and Josemaria Malgosa{-}Sanahuja. and Pilar Manzanares{-}Lopez. and Juan {Carlos Sanchez{-}Aarnoutse}. and Joan Garcia{-}Haro.},
title={AN EFFICIENT METHODOLOGY TO LIMIT PATH LENGTH GUARANTEEING ANONYMITY IN OVERLAY NETWORKS},
booktitle={Proceedings of the International Conference on Security and Cryptography (ICETE 2008) - SECRYPT},
year={2008},
pages={205-208},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001916202050208},
isbn={978-989-8111-59-3},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the International Conference on Security and Cryptography (ICETE 2008) - SECRYPT
TI - AN EFFICIENT METHODOLOGY TO LIMIT PATH LENGTH GUARANTEEING ANONYMITY IN OVERLAY NETWORKS
SN - 978-989-8111-59-3
IS - 2184-3236
AU - Pedro Muñoz-Gea, J.
AU - Malgosa-Sanahuja, J.
AU - Manzanares-Lopez, P.
AU - Carlos Sanchez-Aarnoutse, J.
AU - Garcia-Haro, J.
PY - 2008
SP - 205
EP - 208
DO - 10.5220/0001916202050208
PB - SciTePress