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

Peter van Rossum

dblp:98/3298 · DBLP profile ↗
← Back
14ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Security and privacy · 5Theory of computation · 5Software engineering, systems software and programming languages · 4Artificial intelligence and machine learning · 2

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 primitives and cryptanalysis · 47% Cyber-physical and IoT security · 25% Hardware security and side channels · 22%
Theoretical computer science
2 papers
Automated reasoning and model checking · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking
satisfiability modulo theories
0.122006
Efficient theory combination via boolean search · Inf. Comput. 2006
Efficient Satisfiability Modulo Theories via Delayed Theory Combination · CAV 2005
Cyber-physical and IoT security
embedded system security
0.112010
Dismantling SecureMemory, CryptoMemory and CryptoRF · CCS 2010
Cryptographic primitives and cryptanalysis
stream cipher
0.112010
Dismantling SecureMemory, CryptoMemory and CryptoRF · CCS 2010
Hardware security and side channels
side-channel attack
0.112009
Wirelessly Pickpocketing a Mifare Classic Card · SP 2009
Cryptographic primitives and cryptanalysis
stream cipher cryptanalysis
0.112009
Wirelessly Pickpocketing a Mifare Classic Card · SP 2009
Automated reasoning and model checking › satisfiability modulo theories
theory combination
0.112006
Efficient theory combination via boolean search · Inf. Comput. 2006
Authentication and access control › user authentication
smart card authentication
0.012009
Wirelessly Pickpocketing a Mifare Classic Card · SP 2009

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

keystream correlation analysis · 0.1brute-force attack · 0.1man-in-the-middle attack · 0.1known-plaintext attack · 0.1boolean search · 0.1satisfiability modulo theories · 0.1
YearPublicationVenuePosition
2011 Information hiding in probabilistic concurrent systems
Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Ana Sokolova
Theor. Comput. Sci.3
2010 Modeling Privacy for Off-Line RFID Systems
Flavio D. Garcia, Peter van Rossum
CARDIS2
2010 Dismantling SecureMemory, CryptoMemory and CryptoRF
abstract
The Atmel chip families SecureMemory, CryptoMemory, and CryptoRF use a proprietary stream cipher to guarantee authenticity, confidentiality, and integrity. This paper describes the cipher in detail and points out several weaknesses. One is the fact that the three components of the cipher operate largely independently; another is that the intermediate output generated by two of those components is strongly correlated with the generated keystream. For SecureMemory, a single eavesdropped trace is enough to recover the secret key with probability 0.57 in 2^{39} cipher ticks. This is a factor of 2^{31.5} faster than a brute force attack. On a 2 GHz laptop, this takes around 10 minutes. With more traces, the secret key can be recovered with virtual certainty without significant additional cost in time. For CryptoMemory and CryptoRF, if one has 2640 traces it is possible to recover the key in 2^{52} cipher ticks, which is 2^{19} times faster than brute force. On a 50 machine cluster of 2 GHz quad-core machines this would take less than 2 days.
Flavio D. Garcia, Peter van Rossum, Roel Verdult, Ronny Wichers Schreur
CCS2
2010 Computing the Leakage of Information-Hiding Systems
Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Geoffrey Smith 0001
TACAS3
2009 Wirelessly Pickpocketing a Mifare Classic Card
abstract
The Mifare Classic is the most widely used contactless smartcard on the market. The stream cipher CRYPTO1 used by the classic has recently been reverse engineered and serious attacks have been proposed. The most serious of them retrieves a secret key in under a second. In order to clone a card, previously proposed attacks require that the adversary either has access to an eavesdropped communication session or executes a message-by-message man-in-the-middle attack between the victim and a legitimate reader. Although this is already disastrous from a cryptographic point of view, system integrators maintain that these attacks cannot be performed undetected.This paper proposes four attacks that can be executed by an adversary having only wireless access to just a card (and not to a legitimate reader). The most serious of them recovers a secret key in less than a second on ordinary hardware. Besides the cryptographic weaknesses, we exploit other weaknesses in the protocol stack. A vulnerability in the computation of parity bits allows an adversary to establish a side channel. Another vulnerability regarding nested authentications provides enough plaintext for a speedy known-plaintext attack.
Flavio D. Garcia, Peter van Rossum, Roel Verdult, Ronny Wichers Schreur
SP2
2008 Dismantling MIFARE Classic
Flavio D. Garcia, Gerhard de Koning Gans, Ruben Muijrers, Peter van Rossum, Roel Verdult, Ronny Wichers Schreur, Bart Jacobs 0001
ESORICS4
2008 Computational Soundness of Non-Malleable Commitments
David Galindo, Flavio D. Garcia, Peter van Rossum
ISPEC3
2008 Conditional Probabilities over Probabilistic and Nondeterministic Systems
Miguel E. Andrés, Peter van Rossum
TACAS2
2008 Sound and complete computational interpretation of symbolic hashes in the standard model
Flavio D. Garcia, Peter van Rossum
Theor. Comput. Sci.2
2006 Efficient theory combination via boolean search
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani
Inf. Comput.6
2005 The MathSAT 3 System
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz 0001, Roberto Sebastiani
CADE5
2005 Efficient Satisfiability Modulo Theories via Delayed Theory Combination
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani
CAV6
2005 An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz 0001, Roberto Sebastiani
TACAS5
2005 MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz 0001, Roberto Sebastiani
J. Autom. Reason.5