The Experts below are selected from a list of 27348 Experts worldwide ranked by ideXlab platform
Jürgen Schönwälder - One of the best experts on this subject based on the ideXlab platform.
-
Prefix- and Lexicographical-order-preserving Ip Address Anonymization
2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006, 2006Co-Authors: M. Harvan, Jürgen SchönwälderAbstract:The anonymization of SNMP traffic traces requires an Ip Address anonymization scheme which is prefix-preserving and lexicographical-order-preserving. We present an anonymization scheme satisfying these two requirements which has been derived from the prefix-preserving cryptography-based scheme Crypto-PAn. We formally prove the correctness of the scheme and we describe an embeddable implementation. Limits of the proposed anonymization scheme and some security aspects are discussed as well
M. Harvan - One of the best experts on this subject based on the ideXlab platform.
-
Prefix- and Lexicographical-order-preserving Ip Address Anonymization
2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006, 2006Co-Authors: M. Harvan, Jürgen SchönwälderAbstract:The anonymization of SNMP traffic traces requires an Ip Address anonymization scheme which is prefix-preserving and lexicographical-order-preserving. We present an anonymization scheme satisfying these two requirements which has been derived from the prefix-preserving cryptography-based scheme Crypto-PAn. We formally prove the correctness of the scheme and we describe an embeddable implementation. Limits of the proposed anonymization scheme and some security aspects are discussed as well
Walid Dabbous - One of the best experts on this subject based on the ideXlab platform.
-
Linking a Social Identity to an Ip Address
Ercim News, 2012Co-Authors: Arnaud Legout, Walid DabbousAbstract:Linking a social identity such as a name to an Ip Address is generally believed to be difficult for an individual with no dedicated infrastructure or privileged information. Although an individual’s ISP has access to this information, it is kept private except in the case of a legal decision. Similarly, some big Internet companies such as Facebook and Google might be privy to this information but it will never be communicated as it is an industrial secret used for targeted advertisements. In the context of the bluebear project, we show that it is possible for an individual to inconspicuously make the link between social identity and Ip Address for all Skype users.
-
survey and taxonomy of Ip Address lookup algorithms
IEEE Network, 2001Co-Authors: M A Ruizsanchez, Ernst W Biersack, Walid DabbousAbstract:Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per second are commonly deployed. To handle gigabit-per-second traffic rates, the backbone routers must be able to forward millions of packets per second on each of their ports. Fast Ip Address lookup in the routers, which uses the packet's destination Address to determine for each packet the next hop, is therefore crucial to achieve the packet forwarding rates required. Ip Address lookup is difficult because it requires a longest matching prefix search. In the last couple of years, various algorithms for high-performance Ip Address lookup have been proposed. We present a survey of state-of-the-art Ip Address lookup algorithms and compare their performance in terms of lookup speed, scalability, and update overhead.
M A Ruizsanchez - One of the best experts on this subject based on the ideXlab platform.
-
survey and taxonomy of Ip Address lookup algorithms
IEEE Network, 2001Co-Authors: M A Ruizsanchez, Ernst W Biersack, Walid DabbousAbstract:Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per second are commonly deployed. To handle gigabit-per-second traffic rates, the backbone routers must be able to forward millions of packets per second on each of their ports. Fast Ip Address lookup in the routers, which uses the packet's destination Address to determine for each packet the next hop, is therefore crucial to achieve the packet forwarding rates required. Ip Address lookup is difficult because it requires a longest matching prefix search. In the last couple of years, various algorithms for high-performance Ip Address lookup have been proposed. We present a survey of state-of-the-art Ip Address lookup algorithms and compare their performance in terms of lookup speed, scalability, and update overhead.
Ernst W Biersack - One of the best experts on this subject based on the ideXlab platform.
-
survey and taxonomy of Ip Address lookup algorithms
IEEE Network, 2001Co-Authors: M A Ruizsanchez, Ernst W Biersack, Walid DabbousAbstract:Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per second are commonly deployed. To handle gigabit-per-second traffic rates, the backbone routers must be able to forward millions of packets per second on each of their ports. Fast Ip Address lookup in the routers, which uses the packet's destination Address to determine for each packet the next hop, is therefore crucial to achieve the packet forwarding rates required. Ip Address lookup is difficult because it requires a longest matching prefix search. In the last couple of years, various algorithms for high-performance Ip Address lookup have been proposed. We present a survey of state-of-the-art Ip Address lookup algorithms and compare their performance in terms of lookup speed, scalability, and update overhead.
