default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter van Rossum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j4]Miguel E. Andrés, Catuscia Palamidessi
, Peter van Rossum, Ana Sokolova:
Information hiding in probabilistic concurrent systems. Theor. Comput. Sci. 412(28): 3072-3089 (2011)- 2010
- [c16]Flavio D. Garcia, Peter van Rossum:
Modeling Privacy for Off-Line RFID Systems. CARDIS 2010: 194-208 - [c15]Flavio D. Garcia, Peter van Rossum, Roel Verdult, Ronny Wichers Schreur:
Dismantling SecureMemory, CryptoMemory and CryptoRF. CCS 2010: 250-259 - [c14]Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum:
Safe Equivalences for Security Properties. IFIP TCS 2010: 55-70 - [c13]Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Ana Sokolova:
Information Hiding in Probabilistic Concurrent Systems. QEST 2010: 17-26 - [c12]Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Geoffrey Smith:
Computing the Leakage of Information-Hiding Systems. TACAS 2010: 373-389 - [i6]Flavio D. Garcia, Peter van Rossum, Roel Verdult, Ronny Wichers Schreur:
Dismantling SecureMemory, CryptoMemory and CryptoRF. IACR Cryptol. ePrint Arch. 2010: 169 (2010)
2000 – 2009
- 2009
- [c11]Lukasz Chmielewski, Jaap-Henk Hoepman, Peter van Rossum:
Client-Server Password Recovery. OTM Conferences (2) 2009: 861-878 - [c10]Flavio D. Garcia, Peter van Rossum, Roel Verdult, Ronny Wichers Schreur:
Wirelessly Pickpocketing a Mifare Classic Card. SP 2009: 3-15 - [i5]Lukasz Chmielewski, Jaap-Henk Hoepman, Peter van Rossum:
Client-Server Password Recovery (Extended Abstract). CoRR abs/0906.4668 (2009) - 2008
- [j3]Flavio D. Garcia, Peter van Rossum:
Sound and complete computational interpretation of symbolic hashes in the standard model. Theor. Comput. Sci. 394(1-2): 112-133 (2008) - [c9]Flavio D. Garcia, Gerhard de Koning Gans, Ruben Muijrers, Peter van Rossum, Roel Verdult, Ronny Wichers Schreur, Bart Jacobs:
Dismantling MIFARE Classic. ESORICS 2008: 97-114 - [c8]Miguel E. Andrés, Pedro R. D'Argenio, Peter van Rossum:
Significant Diagnostic Counterexamples in Probabilistic Model Checking. Haifa Verification Conference 2008: 129-148 - [c7]David Galindo, Flavio D. Garcia, Peter van Rossum:
Computational Soundness of Non-Malleable Commitments. ISPEC 2008: 361-376 - [c6]Miguel E. Andrés, Peter van Rossum:
Conditional Probabilities over Probabilistic and Nondeterministic Systems. TACAS 2008: 157-172 - [i4]Miguel E. Andrés, Pedro R. D'Argenio, Peter van Rossum:
Significant Diagnostic Counterexamples in Probabilistic Model Checking. CoRR abs/0806.1139 (2008) - 2007
- [i3]Flavio D. Garcia, Peter van Rossum, Ana Sokolova:
Probabilistic Anonymity and Admissible Schedulers. CoRR abs/0706.1019 (2007) - 2006
- [j2]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani:
Efficient theory combination via boolean search. Inf. Comput. 204(10): 1493-1525 (2006) - [c5]Flavio D. Garcia, Peter van Rossum:
Sound Computational Interpretation of Symbolic Hashes in the Standard Model. IWSEC 2006: 33-47 - [i2]Flavio D. Garcia, Peter van Rossum:
Sound Computational Interpretation of Formal Hashes. IACR Cryptol. ePrint Arch. 2006: 14 (2006) - [i1]Flavio D. Garcia, Peter van Rossum:
Completeness of Formal Hashes in the Standard Model. IACR Cryptol. ePrint Arch. 2006: 146 (2006) - 2005
- [j1]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani:
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures. J. Autom. Reason. 35(1-3): 265-293 (2005) - [c4]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani:
The MathSAT 3 System. CADE 2005: 315-321 - [c3]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani:
Efficient Satisfiability Modulo Theories via Delayed Theory Combination. CAV 2005: 335-349 - [c2]Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Peter van Rossum:
Provable anonymity. FMSE 2005: 63-72 - [c1]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani:
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic. TACAS 2005: 317-333
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
