The SCEAS System
| |||||||

## Search the dblp DataBase
Marc Fischlin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Marc Fischlin
**Practical Memory Checkers for Stacks, Queues and Deques.**[Citation Graph (0, 0)][DBLP] ACISP, 1997, pp:114-125 [Conf] - 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] - Alexandra Boldyreva, Marc Fischlin
**On the Security of OAEP.**[Citation Graph (0, 0)][DBLP] ASIACRYPT, 2006, pp:210-225 [Conf] - Marc Fischlin
**A Note on Security Proofs in the Generic Model.**[Citation Graph (0, 0)][DBLP] ASIACRYPT, 2000, pp:458-469 [Conf] - Ran Canetti, Marc Fischlin
**Universally Composable Commitments.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2001, pp:19-40 [Conf] - 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] - Marc Fischlin
**Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2005, pp:152-168 [Conf] - Marc Fischlin, Roger Fischlin
**Efficient Non-malleable Commitment Schemes.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2000, pp:413-431 [Conf] - Marc Fischlin
**Round-Optimal Composable Blind Signatures in the Common Reference String Model.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2006, pp:60-77 [Conf] - Marc Fischlin
**A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires.**[Citation Graph (0, 0)][DBLP] CT-RSA, 2001, pp:457-472 [Conf] - 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] - Marc Fischlin
**Fast Verification of Hash Chains.**[Citation Graph (0, 0)][DBLP] CT-RSA, 2004, pp:339-352 [Conf] - Marc Fischlin
**Universally Composable Oblivious Transfer in the Multi-party Setting.**[Citation Graph (0, 0)][DBLP] CT-RSA, 2006, pp:332-349 [Conf] - Marc Fischlin, Roger Fischlin
**The Representation Problem Based on Factoring.**[Citation Graph (0, 0)][DBLP] CT-RSA, 2002, pp:96-113 [Conf] - 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] - Marc Fischlin
**Incremental Cryptography and Memory Checkers.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 1997, pp:293-408 [Conf] - 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] - 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] - Marc Fischlin
**Lower Bounds for the Signature Size of Incremental Schemes.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:438-447 [Conf] - Marc Fischlin
**Completely Non-malleable Schemes.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:779-790 [Conf] - Marc Fischlin
**Progressive Verification: The Case of Message Authentication: (Extended Abstract).**[Citation Graph (0, 0)][DBLP] INDOCRYPT, 2003, pp:416-429 [Conf] - Marc Fischlin
**The Cramer-Shoup Strong-RSASignature Scheme Revisited.**[Citation Graph (0, 0)][DBLP] Public Key Cryptography, 2003, pp:116-129 [Conf] - 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] - Marc Fischlin, Anja Lehmann
**Security-Amplifying Combiners for Collision-Resistant Hash Functions.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:224-243 [Conf] - 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] - Marc Fischlin
**Anonymous Signatures Made Easy.**[Citation Graph (0, 0)][DBLP] Public Key Cryptography, 2007, pp:31-42 [Conf] **Redactable Signatures for Tree-Structured Data: Definitions and Constructions.**[Citation Graph (, )][DBLP]**Foundations of Non-malleable Hash and One-Way Functions.**[Citation Graph (, )][DBLP]**Santizable Signatures: How to Partially Delegate Control for Authenticated Data.**[Citation Graph (, )][DBLP]**Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles.**[Citation Graph (, )][DBLP]**Hash Function Combiners in TLS and SSL.**[Citation Graph (, )][DBLP]**Security of NMACand HMACBased on Non-malleability.**[Citation Graph (, )][DBLP]**On the Impossibility of Three-Move Blind Signature Schemes.**[Citation Graph (, )][DBLP]**Robust Multi-property Combiners for Hash Functions Revisited.**[Citation Graph (, )][DBLP]**Security of Invertible Media Authentication Schemes Revisited.**[Citation Graph (, )][DBLP]**Security Analysis of the PACE Key-Agreement Protocol.**[Citation Graph (, )][DBLP]**Security of Sanitizable Signatures Revisited.**[Citation Graph (, )][DBLP]**Security of Blind Signatures under Aborts.**[Citation Graph (, )][DBLP]**Unlinkability of Sanitizable Signatures.**[Citation Graph (, )][DBLP]**Confidential Signatures and Deterministic Signcryption.**[Citation Graph (, )][DBLP]**History-Free Aggregate Message Authentication Codes.**[Citation Graph (, )][DBLP]**Multi-property Preserving Combiners for Hash Functions.**[Citation Graph (, )][DBLP]**Delayed-Key Message Authentication for Streams.**[Citation Graph (, )][DBLP]**Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions.**[Citation Graph (, )][DBLP]**Random Oracles in a Quantum World**[Citation Graph (, )][DBLP]
Search in 0.014secs, Finished in 0.016secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |