Search the dblp DataBase

Publications of Author

1. Marc Fischlin
   Practical Memory Checkers for Stacks, Queues and Deques. [Citation Graph (0, 0)][DBLP]
   ACISP, 1997, pp:114-125 [Conf]
   
2. Marc Fischlin
   Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions. [Citation Graph (0, 0)][DBLP]
   ALT, 1998, pp:72-86 [Conf]
   
3. Alexandra Boldyreva, Marc Fischlin
   On the Security of OAEP. [Citation Graph (0, 0)][DBLP]
   ASIACRYPT, 2006, pp:210-225 [Conf]
   
4. Marc Fischlin
   A Note on Security Proofs in the Generic Model. [Citation Graph (0, 0)][DBLP]
   ASIACRYPT, 2000, pp:458-469 [Conf]
   
5. Ran Canetti, Marc Fischlin
   Universally Composable Commitments. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2001, pp:19-40 [Conf]
   
6. Alexandra Boldyreva, Marc Fischlin
   Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2005, pp:412-429 [Conf]
   
7. Marc Fischlin
   Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2005, pp:152-168 [Conf]
   
8. Marc Fischlin, Roger Fischlin
   Efficient Non-malleable Commitment Schemes. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:413-431 [Conf]
   
9. Marc Fischlin
   Round-Optimal Composable Blind Signatures in the Common Reference String Model. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2006, pp:60-77 [Conf]
   
10. Marc Fischlin
    A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2001, pp:457-472 [Conf]
    
11. Marc Fischlin
    On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2002, pp:79-95 [Conf]
    
12. Marc Fischlin
    Fast Verification of Hash Chains. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2004, pp:339-352 [Conf]
    
13. Marc Fischlin
    Universally Composable Oblivious Transfer in the Multi-party Setting. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2006, pp:332-349 [Conf]
    
14. Marc Fischlin, Roger Fischlin
    The Representation Problem Based on Factoring. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2002, pp:96-113 [Conf]
    
15. Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali
    Identification Protocols Secure against Reset Attacks. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:495-511 [Conf]
    
16. Marc Fischlin
    Incremental Cryptography and Memory Checkers. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1997, pp:293-408 [Conf]
    
17. Marc Fischlin
    Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:432-445 [Conf]
    
18. Matthias Enzmann, Marc Fischlin, Markus Schneider 0002
    A Privacy-Friendly Loyalty System Based on Discrete Logarithms over Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2004, pp:24-38 [Conf]
    
19. Marc Fischlin
    Lower Bounds for the Signature Size of Incremental Schemes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:438-447 [Conf]
    
20. Marc Fischlin
    Completely Non-malleable Schemes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:779-790 [Conf]
    
21. Marc Fischlin
    Progressive Verification: The Case of Message Authentication: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2003, pp:416-429 [Conf]
    
22. Marc Fischlin
    The Cramer-Shoup Strong-RSASignature Scheme Revisited. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2003, pp:116-129 [Conf]
    
23. Marc Fischlin
    Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:2, pp:199-219 [Journal]
    
24. Marc Fischlin, Anja Lehmann
    Security-Amplifying Combiners for Collision-Resistant Hash Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:224-243 [Conf]
    
25. Alexandra Boldyreva, Marc Fischlin, Adriana Palacio, Bogdan Warinschi
    A Closer Look at PKI: Security and Efficiency. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2007, pp:458-475 [Conf]
    
26. Marc Fischlin
    Anonymous Signatures Made Easy. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2007, pp:31-42 [Conf]
    
27. 
    Redactable Signatures for Tree-Structured Data: Definitions and Constructions. [Citation Graph (, )][DBLP]
    
    
28. 
    Foundations of Non-malleable Hash and One-Way Functions. [Citation Graph (, )][DBLP]
    
    
29. 
    Santizable Signatures: How to Partially Delegate Control for Authenticated Data. [Citation Graph (, )][DBLP]
    
    
30. 
    Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. [Citation Graph (, )][DBLP]
    
    
31. 
    Hash Function Combiners in TLS and SSL. [Citation Graph (, )][DBLP]
    
    
32. 
    Security of NMACand HMACBased on Non-malleability. [Citation Graph (, )][DBLP]
    
    
33. 
    On the Impossibility of Three-Move Blind Signature Schemes. [Citation Graph (, )][DBLP]
    
    
34. 
    Robust Multi-property Combiners for Hash Functions Revisited. [Citation Graph (, )][DBLP]
    
    
35. 
    Security of Invertible Media Authentication Schemes Revisited. [Citation Graph (, )][DBLP]
    
    
36. 
    Security Analysis of the PACE Key-Agreement Protocol. [Citation Graph (, )][DBLP]
    
    
37. 
    Security of Sanitizable Signatures Revisited. [Citation Graph (, )][DBLP]
    
    
38. 
    Security of Blind Signatures under Aborts. [Citation Graph (, )][DBLP]
    
    
39. 
    Unlinkability of Sanitizable Signatures. [Citation Graph (, )][DBLP]
    
    
40. 
    Confidential Signatures and Deterministic Signcryption. [Citation Graph (, )][DBLP]
    
    
41. 
    History-Free Aggregate Message Authentication Codes. [Citation Graph (, )][DBLP]
    
    
42. 
    Multi-property Preserving Combiners for Hash Functions. [Citation Graph (, )][DBLP]
    
    
43. 
    Delayed-Key Message Authentication for Streams. [Citation Graph (, )][DBLP]
    
    
44. 
    Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions. [Citation Graph (, )][DBLP]
    
    
45. 
    Random Oracles in a Quantum World [Citation Graph (, )][DBLP]