Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pars Mutaf

dblp:64/6374 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 2 first-authorSecurity and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Cryptographic protocols and secure computation · 50% Network security · 25% Authentication and access control · 25%
Computer networks
2 papers
Internet architecture and protocols · 77% Internet of things and sensor networks · 23%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › attack resilience › attack mitigation
denial-of-service defense
0.112005
Compact neighbor discovery: a bandwidth defense through bandwidth optimization · INFOCOM 2005
Authentication and access control
device pairing
0.112005
Shake them up!: a movement-based pairing protocol for CPU-constrained devices · MobiSys 2005
Cryptographic protocols and secure computation
key exchange
0.112005
Shake them up!: a movement-based pairing protocol for CPU-constrained devices · MobiSys 2005
Cryptographic protocols and secure computation › key exchange
pairing protocols
0.112005
Shake them up!: a movement-based pairing protocol for CPU-constrained devices · MobiSys 2005

Methods — techniques the papers use, named apart from their topics

shared secret establishment · 0.1bloom filter · 0.1
YearPublicationVenuePosition
2005 Compact neighbor discovery: a bandwidth defense through bandwidth optimization
abstract
We present a stateless defense against the neighbor discovery denial-of-service (ND-DoS) attack in IPv6. The ND-DoS attack consists of remotely flooding a target subnet with bogus packets destined for random interface identifiers; a different one for each malicious packet. The 128-bit IPv6 address reserves its 64 low-order bits for the interface ID. Consequently, the malicious packets are very likely to fall on previously unresolved addresses and the target access router (or leaf router) is obligated to resolve these addresses by sending neighbor solicitation packets. Neighbor solicitation packets are link layer multicast (or broadcast), and hence also forwarded by bridges. As a consequence, the attack may consume important bandwidth in subnets with wireless bridges, or access points. This problem is particularly important in the presence of mobile IPv6 devices that expect incoming sessions from the Internet. In this case, address resolution is crucial for the access router to reliably deliver incoming sessions to idle mobile devices with unknown MAC addresses. We propose a novel neighbor solicitation technique using Bloom filters. Multiple IPv6 addresses (bogus or real) that are waiting in the access router's address resolution queue are compactly represented using a Bloom filter. By broadcasting a single neighbor solicitation message that carries the Bloom filter, multiple IPv6 addresses are concurrently solicited. Legitimate neighbor solicitation triggering packets are not denied service. An on-link host can detect its address in the received Bloom filter and return its MAC address to the access router. A bandwidth gain around 40 can be achieved in all cells of the target subnet. This approach that we call compact neighbor discovery (CND) is the first bandwidth DoS defense that we are aware of to employ a bandwidth optimization.
Pars Mutaf, Claude Castelluccia
INFOCOM1
2005 Shake them up!: a movement-based pairing protocol for CPU-constrained devices
abstract
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this is the first software pairing scheme that does not rely on expensive public-key cryptography, out-of-band channels (such as a keyboard or a display) or specific hardware, making it inexpensive and suitable for CPU-constrained devices such as sensors.
Claude Castelluccia, Pars Mutaf
MobiSys2
2004 Hash-Based Dynamic Source Routing
Claude Castelluccia, Pars Mutaf
NETWORKING2
2004 Hash-Based Paging and Location Update Using Bloom Filters
Pars Mutaf, Claude Castelluccia
Mob. Networks Appl.1
2003 IP paging considered unnecessary: Mobile IPv6 and IP paging for dormant mode location update in macrocellular and hotspot networks
abstract
Cellular telephones save power by switching to a low power or dormant mode when there is no active traffic. In dormant mode, the telephone periodically checks for a beacon, and if the beacon indicates that the phone has moved to a new paging area, the telephone performs a paging area update. Paging area update signaling requires considerably less power than is required to move an active traffic channel. When a call comes in, the network pages the telephone by flood signaling the paging area on a special channel, and the telephone brings up an active traffic channel. Recent work has attempted to extend paging to IP networks, in particular, networks running the Mobile IP mobility management protocol. In this paper, we compare mobile IPv6 and IP paging for dormant mode location updating. Simulations are presented for a typical macrocellular scenario and a hotspot scenario, where broadband microcells supplement the narrowband macrocells. The results show that Mobile IPv6 dormant mode location management is roughly comparable to IP paging.
James Kempf, Pars Mutaf
WCNC2
1999 Defending against a Denial-of-Service Attack on TCP
Pars Mutaf
Recent Advances in Intrusion Detection1