» Home
» Contact
» Publications » Conferences» Journals» Others
» Resume » Research» Service» Interaction» Teaching
» Links » Crypto» News+Infos» Misc» Private
|
Visits Significant research visits:
| > |
Centre de Recerca Matematica |
|
Barcelona, Spain |
|
July 2005 |
| > |
Information Security and Crypto Group ETHZ |
|
ETH Zurich, Switzerland |
|
September 2004 - August 2005 |
| > |
Crypto Group UCSD |
|
University of California, San Diego, California, USA |
|
September 2003 - August 2004 |
| > |
Crypto Group IBM TJ Watson |
|
IBM TJ Watson, Hawthorne, New York, USA |
|
July 2000 - September 2000 |
Talks
Talks at conferences (excerpt):
| > |
Communication-Efficient Non-Interactive Proofs of Knowledge with Online Extractors |
|
Advances in Cryptology - Crypto 2005, Santa Barbara, California, USA |
|
August 14-18, 2005 |
| > |
Fast Verification of Hash Chains |
|
RSA Cryptographer's Track 2004, San Francisco, California, USA |
|
February 23-27, 2004 |
| > |
The Cramer-Shoup Strong-RSA Signature Scheme Revisited |
|
Public-Key Cryptography (PKC) 2003, Miami, Florida, USA |
|
January 6-8, 2003 |
| > |
On the Impossibility of Constructing Non-Interactive Statistically-Secret Protocols from any Trapdoor One-Way Function |
|
RSA Cryptographer's Track 2002, San Jose, California, USA |
|
February 18-22, 2002 |
| > |
Universally Composable Commitments |
|
Advances in Cryptology - Crypto 2001, Santa Barbara, California, USA |
|
August 19-23, 2001 |
| > |
Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires |
|
RSA Cryptographer's Track 2001, San Francisco, California, USA |
|
April 9-12, 2001 |
| > |
Efficient Non-Malleable Commitment Schemes |
|
Advances in Cryptology - Crypto 2000, Santa Barbara, California, USA |
|
August 20-24, 2000 |
| > |
A Note on Security Proofs in the Generic Model |
|
Advances in Cryptology - Asiacrypt 2000, Kyoto, Japan |
|
December 3-7, 2000 |
| > |
Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications |
|
Advances in Cryptology - Eurocrypt '99, Prague, Czech Republic |
|
May 2-6, 1999 |
| > |
Lower Bounds for the Signature Size of Incremental Schemes |
|
38th Annual Symposium on Foundations of Computer Science (FOCS), Miami, Florida, USA |
|
October 20-22, 1997 |
Talks at workshops (excerpt):
| > |
Re-Revisiting the Random Oracle Methodology in Cryptography |
|
Workshop on Provable Security, Versailles, France |
|
November 3-5, 2004 |
| > |
The Representation Problem and its Applications |
|
Workshop on Complexity-theoretical and Algebraic Methods in Cryptography, Bochum, Germany |
|
November 7-8, 2002 |
| > |
Efficient Non-Malleable Commitment Schemes |
|
Workshop on Cryptography, Luminy, France |
|
September 27 - October 1, 1999 |
Other talks (excerpt):
| > |
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Protocols |
|
IBM Zurich, Swithzerland |
|
April 26, 2005 |
| > |
The Dark Side of Electronic Signatures (in German) |
|
Goethe-University, Institute for Stochastics and Mathematical Computer Science, Frankfurt, Germany |
|
July 15, 2003 |
| > |
Data Security in the E-Health Area (in German) |
|
Federal Conference on Security in Hospitals, Association of Hospital Technology, Kiel, Germany |
|
May 12-13, 2003 |
| > |
Security Proofs in the Generic Model (in German) |
|
Technical University of Darmstadt, Institute for Cryptography and Computer Algebra, Darmstadt, Germany |
|
January 23, 2001 |
| > |
Efficient Non-Malleable Commitment Schemes |
|
IBM TJ Watson, Hawthorne, New York, USA |
|
August 2, 2000 |
About this Page
author: Marc Fischlin
creation date: March 1, 2005 comment:
This site only requires that your browser supports cascading style sheets (CSS).
|