| 2008 |
|---|
| 29 | EE | Marc Fischlin:
Security of NMACand HMACBased on Non-malleability.
CT-RSA 2008: 138-154 |
| 28 | EE | Marc Fischlin,
Anja Lehmann:
Multi-property Preserving Combiners for Hash Functions.
TCC 2008: 375-392 |
| 2007 |
|---|
| 27 | EE | Marc Fischlin,
Anja Lehmann:
Security-Amplifying Combiners for Collision-Resistant Hash Functions.
CRYPTO 2007: 224-243 |
| 26 | EE | 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 |
| 25 | EE | Marc Fischlin:
Anonymous Signatures Made Easy.
Public Key Cryptography 2007: 31-42 |
| 24 | EE | Alexandra Boldyreva,
Marc Fischlin,
Adriana Palacio,
Bogdan Warinschi:
A Closer Look at PKI: Security and Efficiency.
Public Key Cryptography 2007: 458-475 |
| 2006 |
|---|
| 23 | EE | Alexandra Boldyreva,
Marc Fischlin:
On the Security of OAEP.
ASIACRYPT 2006: 210-225 |
| 22 | EE | Marc Fischlin:
Round-Optimal Composable Blind Signatures in the Common Reference String Model.
CRYPTO 2006: 60-77 |
| 21 | EE | Marc Fischlin:
Universally Composable Oblivious Transfer in the Multi-party Setting.
CT-RSA 2006: 332-349 |
| 2005 |
|---|
| 20 | EE | Marc Fischlin:
Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors.
CRYPTO 2005: 152-168 |
| 19 | EE | Alexandra Boldyreva,
Marc Fischlin:
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes.
CRYPTO 2005: 412-429 |
| 18 | EE | Marc Fischlin:
Completely Non-malleable Schemes.
ICALP 2005: 779-790 |
| 2004 |
|---|
| 17 | EE | Marc Fischlin:
Fast Verification of Hash Chains.
CT-RSA 2004: 339-352 |
| 16 | EE | Matthias Enzmann,
Marc Fischlin,
Markus Schneider:
A Privacy-Friendly Loyalty System Based on Discrete Logarithms over Elliptic Curves.
Financial Cryptography 2004: 24-38 |
| 2003 |
|---|
| 15 | EE | Marc Fischlin:
Progressive Verification: The Case of Message Authentication: (Extended Abstract).
INDOCRYPT 2003: 416-429 |
| 14 | EE | Marc Fischlin:
The Cramer-Shoup Strong-RSASignature Scheme Revisited.
Public Key Cryptography 2003: 116-129 |
| 2002 |
|---|
| 13 | EE | Marc Fischlin:
On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function.
CT-RSA 2002: 79-95 |
| 12 | EE | Marc Fischlin,
Roger Fischlin:
The Representation Problem Based on Factoring.
CT-RSA 2002: 96-113 |
| 2001 |
|---|
| 11 | EE | Ran Canetti,
Marc Fischlin:
Universally Composable Commitments.
CRYPTO 2001: 19-40 |
| 10 | EE | Marc Fischlin:
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires.
CT-RSA 2001: 457-472 |
| 9 | EE | Mihir Bellare,
Marc Fischlin,
Shafi Goldwasser,
Silvio Micali:
Identification Protocols Secure against Reset Attacks.
EUROCRYPT 2001: 495-511 |
| 8 | EE | 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 |
|---|
| 7 | EE | Marc Fischlin:
A Note on Security Proofs in the Generic Model.
ASIACRYPT 2000: 458-469 |
| 6 | EE | Marc Fischlin,
Roger Fischlin:
Efficient Non-malleable Commitment Schemes.
CRYPTO 2000: 413-431 |
| 1999 |
|---|
| 5 | EE | Marc Fischlin:
Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications.
EUROCRYPT 1999: 432-445 |
| 1998 |
|---|
| 4 | EE | 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 | EE | Marc Fischlin:
Incremental Cryptography and Memory Checkers.
EUROCRYPT 1997: 293-408 |
| 1 | EE | Marc Fischlin:
Lower Bounds for the Signature Size of Incremental Schemes.
FOCS 1997: 438-447 |
