![]() | ![]() |
| 2012 | ||
|---|---|---|
| 78 | Marc Fischlin, Johannes Buchmann, Mark Manulis: Public Key Cryptography - PKC 2012 - 15th International Conference on Practice and Theory in Public Key Cryptography, Darmstadt, Germany, May 21-23, 2012. Proceedings Springer 2012 | |
| 77 | Christina Brzuska, Özgür Dagdelen, Marc Fischlin: TLS, PACE, and EAC: ACryptographic View at Modern Key Exchange Protocols. Sicherheit 2012: 71-82 | |
| 76 | Lassaad Cheikhrouhou, Werner Stephan, Özgür Dagdelen, Marc Fischlin, Markus Ullmann: Merging the Cryptographic Security Analysis and the Algebraic-Logic Security Proof of PACE. Sicherheit 2012: 83-94 | |
| 75 | Marc Fischlin, Cristina Onete: Provably Secure Distance-Bounding: an Analysis of Prominent Protocols. IACR Cryptology ePrint Archive 2012: 128 (2012) | |
| 74 | Christina Brzuska, Marc Fischlin, Nigel P. Smart, Bogdan Warinschi, Stephen C. Williams: Less is More: Relaxed yet Composable Security Notions for Key Exchange. IACR Cryptology ePrint Archive 2012: 242 (2012) | |
| 2011 | ||
| 73 | Christina Brzuska, Marc Fischlin, Bogdan Warinschi, Stephen C. Williams: Composability of bellare-rogaway key exchange protocols. ACM Conference on Computer and Communications Security 2011: 51-62 | |
| 72 | Marc Fischlin, Cristina Onete: Relaxed Security Notions for Signatures of Knowledge. ACNS 2011: 309-326 | |
| 71 | Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, Mark Zhandry: Random Oracles in a Quantum World. ASIACRYPT 2011: 41-69 | |
| 70 | Marc Fischlin, Benoît Libert, Mark Manulis: Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security. ASIACRYPT 2011: 468-485 | |
| 69 | Paul Baecher, Marc Fischlin: Random Oracle Reducibility. CRYPTO 2011: 21-38 | |
| 68 | Christina Brzuska, Marc Fischlin, Heike Schröder, Stefan Katzenbeisser: Physically Uncloneable Functions in the Universal Composition Framework. CRYPTO 2011: 51-70 | |
| 67 | Marc Fischlin, Benny Pinkas, Ahmad-Reza Sadeghi, Thomas Schneider, Ivan Visconti: Secure Set Intersection with Untrusted Hardware Tokens. CT-RSA 2011: 1-16 | |
| 66 | Paul Baecher, Marc Fischlin, Dominique Schröder: Expedient Non-malleability Notions for Hash Functions. CT-RSA 2011: 268-283 | |
| 65 | Ulrich Dürholz, Marc Fischlin, Michael Kasper, Cristina Onete: A Formal Approach to Distance-Bounding RFID Protocols. ISC 2011: 47-62 | |
| 64 | Marc Fischlin, Anna Lysyanskaya, Ueli Maurer, Alexander May: Public-Key Cryptography (Dagstuhl Seminar 11391). Dagstuhl Reports 1(9): 76-94 (2011) | |
| 63 | Marc Fischlin, Anja Lehmann, Dominique Schröder: History-Free Sequential Aggregate Signatures. IACR Cryptology ePrint Archive 2011: 231 (2011) | |
| 62 | Ulrich Dürholz, Marc Fischlin, Michael Kasper, Cristina Onete: A Formal Approach to Distance-Bounding RFID Protocols. IACR Cryptology ePrint Archive 2011: 321 (2011) | |
| 61 | Christina Brzuska, Marc Fischlin, Heike Schröder, Stefan Katzenbeisser: Physically Uncloneable Functions in the Universal Composition Framework. IACR Cryptology ePrint Archive 2011: 681 (2011) | |
| 60 | Marc Fischlin, Roger Fischlin: Efficient Non-Malleable Commitment Schemes. J. Cryptology 24(1): 203-244 (2011) | |
| 2010 | ||
| 59 | Christina Brzuska, Heike Busch, Özgür Dagdelen, Marc Fischlin, Martin Franz, Stefan Katzenbeisser, Mark Manulis, Cristina Onete, Andreas Peter, Bertram Poettering, Dominique Schröder: Redactable Signatures for Tree-Structured Data: Definitions and Constructions. ACNS 2010: 87-104 | |
| 58 | David Galindo, Benoît Libert, Marc Fischlin, Georg Fuchsbauer, Anja Lehmann, Mark Manulis, Dominique Schröder: Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions. AFRICACRYPT 2010: 333-350 | |
| 57 | Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Thomas Shrimpton, Martijn Stam, Stefano Tessaro: Random Oracles with(out) Programmability. ASIACRYPT 2010: 303-320 | |
| 56 | Marc Fischlin, Anja Lehmann, Daniel Wagner: Hash Function Combiners in TLS and SSL. CT-RSA 2010: 268-283 | |
| 55 | Marc Fischlin, Dominique Schröder: On the Impossibility of Three-Move Blind Signature Schemes. EUROCRYPT 2010: 197-215 | |
| 54 | Özgür Dagdelen, Marc Fischlin: Security Analysis of the Extended Access Control Protocol for Machine Readable Travel Documents. ISC 2010: 54-68 | |
| 53 | Christina Brzuska, Marc Fischlin, Anja Lehmann, Dominique Schröder: Unlinkability of Sanitizable Signatures. Public Key Cryptography 2010: 444-461 | |
| 52 | Alexander W. Dent, Marc Fischlin, Mark Manulis, Martijn Stam, Dominique Schröder: Confidential Signatures and Deterministic Signcryption. Public Key Cryptography 2010: 462-479 | |
| 51 | Oliver Eikemeier, Marc Fischlin, Jens-Fabian Götzmann, Anja Lehmann, Dominique Schröder, Peter Schröder, Daniel Wagner: History-Free Aggregate Message Authentication Codes. SCN 2010: 309-328 | |
| 50 | Paul Baecher, Marc Fischlin, Lior Gordon, Robert Langenberg, Michael Lützow, Dominique Schröder: CAPTCHAs: The Good, the Bad, and the Ugly. Sicherheit 2010: 353-365 | |
| 49 | Marc Fischlin, Anja Lehmann: Delayed-Key Message Authentication for Streams. TCC 2010: 290-307 | |
| 48 | Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner: Random Oracles in a Quantum World CoRR abs/1008.0931: (2010) | |
| 47 | Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, Mark Zhandry: Random Oracles in a Quantum World. IACR Cryptology ePrint Archive 2010: 428 (2010) | |
| 2009 | ||
| 46 | Marc Fischlin: Topics in Cryptology - CT-RSA 2009, The Cryptographers' Track at the RSA Conference 2009, San Francisco, CA, USA, April 20-24, 2009. Proceedings Springer 2009 | |
| 45 | Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi: Foundations of Non-malleable Hash and One-Way Functions. ASIACRYPT 2009: 524-541 | |
| 44 | Christina Brzuska, Marc Fischlin, Anja Lehmann, Dominique Schröder: Santizable Signatures: How to Partially Delegate Control for Authenticated Data. BIOSIG 2009: 117-128 | |
| 43 | Jens Bender, Marc Fischlin, Dennis Kügler: Security Analysis of the PACE Key-Agreement Protocol. ISC 2009: 33-48 | |
| 42 | Marc Fischlin, Dominique Schröder: Security of Blind Signatures under Aborts. Public Key Cryptography 2009: 297-316 | |
| 41 | Christina Brzuska, Marc Fischlin, Tobias Freudenreich, Anja Lehmann, Marcus Page, Jakob Schelbert, Dominique Schröder, Florian Volk: Security of Sanitizable Signatures Revisited. Public Key Cryptography 2009: 317-336 | |
| 40 | Alexander W. Dent, Marc Fischlin, Mark Manulis, Martijn Stam, Dominique Schröder: Confidential Signatures and Deterministic Signcryption. IACR Cryptology ePrint Archive 2009: 588 (2009) | |
| 39 | Jens Bender, Marc Fischlin, Dennis Kügler: Security Analysis of the PACE Key-Agreement Protocol. IACR Cryptology ePrint Archive 2009: 624 (2009) | |
| 38 | Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi: Foundations of Non-Malleable Hash and One-Way Functions. IACR Cryptology ePrint Archive 2009: 65 (2009) | |
| 37 | Marc Fischlin, Roger Fischlin: Efficient Non-malleable Commitment Schemes. J. Cryptology 22(4): 530-571 (2009) | |
| 2008 | ||
| 36 | Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas Ristenpart: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. CRYPTO 2008: 360-378 | |
| 35 | Marc Fischlin: Security of NMACand HMACBased on Non-malleability. CT-RSA 2008: 138-154 | |
| 34 | Marc Fischlin, Anja Lehmann, Krzysztof Pietrzak: Robust Multi-property Combiners for Hash Functions Revisited. ICALP (2) 2008: 655-666 | |
| 33 | Marc Fischlin, Anja Lehmann: Multi-property Preserving Combiners for Hash Functions. TCC 2008: 375-392 | |
| 32 | Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas Ristenpart: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. IACR Cryptology ePrint Archive 2008: 267 (2008) | |
| 2007 | ||
| 31 | Marc Fischlin, Anja Lehmann: Security-Amplifying Combiners for Collision-Resistant Hash Functions. CRYPTO 2007: 224-243 | |
| 30 | Daniel Dönigus, Stefan Endler, Marc Fischlin, Andreas Hülsing, Patrick Jäger, Anja Lehmann, Sergey Podrazhansky, Sebastian Schipp, Erik Tews, Sven Vowe, Matthias Walthart, Frederik Weidemann: Security of Invertible Media Authentication Schemes Revisited. Information Hiding 2007: 189-203 | |
| 29 | Marc Fischlin: Anonymous Signatures Made Easy. Public Key Cryptography 2007: 31-42 | |
| 28 | Alexandra Boldyreva, Marc Fischlin, Adriana Palacio, Bogdan Warinschi: A Closer Look at PKI: Security and Efficiency. Public Key Cryptography 2007: 458-475 | |
| 2006 | ||
| 27 | Alexandra Boldyreva, Marc Fischlin: On the Security of OAEP. ASIACRYPT 2006: 210-225 | |
| 26 | Marc Fischlin: Round-Optimal Composable Blind Signatures in the Common Reference String Model. CRYPTO 2006: 60-77 | |
| 25 | Marc Fischlin: Universally Composable Oblivious Transfer in the Multi-party Setting. CT-RSA 2006: 332-349 | |
| 2005 | ||
| 24 | Marc Fischlin: Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. CRYPTO 2005: 152-168 | |
| 23 | Alexandra Boldyreva, Marc Fischlin: Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes. CRYPTO 2005: 412-429 | |
| 22 | Marc Fischlin: Completely Non-malleable Schemes. ICALP 2005: 779-790 | |
| 2004 | ||
| 21 | Marc Fischlin: Fast Verification of Hash Chains. CT-RSA 2004: 339-352 | |
| 20 | Matthias Enzmann, Marc Fischlin, Markus Schneider: A Privacy-Friendly Loyalty System Based on Discrete Logarithms over Elliptic Curves. Financial Cryptography 2004: 24-38 | |
| 2003 | ||
| 19 | Marc Fischlin: Progressive Verification: The Case of Message Authentication: (Extended Abstract). INDOCRYPT 2003: 416-429 | |
| 18 | Marc Fischlin: The Cramer-Shoup Strong-RSASignature Scheme Revisited. Public Key Cryptography 2003: 116-129 | |
| 2002 | ||
| 17 | Marc Fischlin: On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function. CT-RSA 2002: 79-95 | |
| 16 | Marc Fischlin, Roger Fischlin: The Representation Problem Based on Factoring. CT-RSA 2002: 96-113 | |
| 15 | Marc Fischlin: The Cramer-Shoup Strong-RSA Signature Scheme Revisited. IACR Cryptology ePrint Archive 2002: 17 (2002) | |
| 2001 | ||
| 14 | Ran Canetti, Marc Fischlin: Universally Composable Commitments. CRYPTO 2001: 19-40 | |
| 13 | Marc Fischlin: A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. CT-RSA 2001: 457-472 | |
| 12 | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure against Reset Attacks. EUROCRYPT 2001: 495-511 | |
| 11 | Ran Canetti, Marc Fischlin: Universally Composable Commitments. IACR Cryptology ePrint Archive 2001: 55 (2001) | |
| 10 | Marc Fischlin: Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions. Theor. Comput. Sci. 268(2): 199-219 (2001) | |
| 2000 | ||
| 9 | Marc Fischlin: A Note on Security Proofs in the Generic Model. ASIACRYPT 2000: 458-469 | |
| 8 | Marc Fischlin, Roger Fischlin: Efficient Non-malleable Commitment Schemes. CRYPTO 2000: 413-431 | |
| 7 | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure Against Reset Attacks. IACR Cryptology ePrint Archive 2000: 15 (2000) | |
| 6 | Marc Fischlin: Implications of the Nontriviality of Entropy Approximation. IACR Cryptology ePrint Archive 2000: 3 (2000) | |
| 1999 | ||
| 5 | Marc Fischlin: Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications. EUROCRYPT 1999: 432-445 | |
| 1998 | ||
| 4 | Marc Fischlin: Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions. ALT 1998: 72-86 | |
| 1997 | ||
| 3 | Marc Fischlin: Practical Memory Checkers for Stacks, Queues and Deques. ACISP 1997: 114-125 | |
| 2 | Marc Fischlin: Incremental Cryptography and Memory Checkers. EUROCRYPT 1997: 293-408 | |
| 1 | Marc Fischlin: Lower Bounds for the Signature Size of Incremental Schemes. FOCS 1997: 438-447 | |
Colors in the list of coauthors
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page