#### Filter Results:

- Full text PDF available (85)

#### Publication Year

1993

2017

- This year (3)
- Last 5 years (27)
- Last 10 years (59)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jaap-Henk Hoepman
- ArXiv
- 2004

Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximum weighted matching of that graph. We show that a variant of the obvious sequential greedy algorithm [Pre99], that computes a weighted matching at most a factor 2 away from the… (More)

- Jaap-Henk Hoepman
- Financial Cryptography
- 2004

In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not yet know each other. We focus on the ephemeral version of this problem. Ephemeral pairings occur, for example, when electronic business cards are exchanged between two people that meet, or… (More)

- Gerhard de Koning Gans, Jaap-Henk Hoepman, Flavio D. Garcia
- CARDIS
- 2008

The mifare Classic is the most widely used contactless smart card in the market. Its design and implementation details are kept secret by its manufacturer. This paper studies the architecture of the card and the communication protocol between card and reader. It reveals command codes and structure that so far were unknown. It also gives a practical,… (More)

- Jaap-Henk Hoepman
- ArXiv
- 2012

In this paper we define the notion of a privacy design strategy. These strategies help to support privacy by design throughout the full software development life cycle, even before the design phase. Using current data protection legislation as point of departure we derive the following eight privacy design strategies: MINIMISE, HIDE, SEPARATE, AGGREGATE,… (More)

- Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman
- FTCS
- 1995

In this paper we consider a model where malicious agents can corrupt hosts and move around in a network of processors. We consider a family of mobilefault models MF( t n−1 , ρ). In MF( t n−1 , ρ) there are a total of n processors, the maximum number of mobile faults is t, and their roaming pace is ρ (for example, ρ = 3 means that it takes an agent at least… (More)

The first generation of European e-passports will be issued in 2006. We discuss how borders are crossed regarding the security and privacy erosion of the proposed schemes, and show which borders need to be crossed to improve the security and the privacy protection of the next generation of e-passports. In particular we discuss attacks on Basic Access… (More)

- Gergely Alpár, Jaap-Henk Hoepman, Johanneke Siljee
- ArXiv
- 2011

This paper studies the current ‘identity crisis’ caused by the substantial security, privacy and usability shortcomings encountered in existing systems for identity management. Some of these issues are well known, while others are much less understood. This paper brings them together in a single, comprehensive study and proposes recommendations to resolve… (More)

- Jaap-Henk Hoepman
- SPC
- 2005

The ephemeral pairing problem requires two or more specific physical nodes in a wireless broadcast network, that do not yet know each other, to establish a short-term relationship between them. Such shortlived pairings occur, for example, when one pays at a check-out using a wireless wallet. This problem is equivalent to the ephemeral key exchange problem,… (More)

Unsolicited bulk email (aka. spam) is a major problem on the Internet. To counter spam, several techniques, ranging from spam filters to mail protocol extensions like hashcash, have been proposed. In this paper we investigate the effectiveness of several spam filtering techniques and technologies. Our analysis was performed by simulating email traffic under… (More)

- Jaap-Henk Hoepman, Bart Jacobs
- Commun. ACM
- 2007

It may seem counterintuitive, but going "open" all the way offers the most security.