Marc Fischlin

According to our database1, Marc Fischlin authored at least 119 papers between 1997 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Modeling Memory Faults in Signature and Authenticated Encryption Schemes.
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

2019
Authentication in Key-Exchange: Definitions, Relations and Composition.
IACR Cryptology ePrint Archive, 2019

Modeling Memory Faults in Signature and Encryption Schemes.
IACR Cryptology ePrint Archive, 2019

Challenges in Proving Post-Quantum Key Exchanges Based on Key Encapsulation Mechanisms.
IACR Cryptology ePrint Archive, 2019

Security Reductions for White-Box Key-Storage in Mobile Payments.
IACR Cryptology ePrint Archive, 2019

Intercept-Resend Emulation Attacks against a Continuous-Variable Quantum Authentication Protocol with Physical Unclonable Keys.
Cryptography, 2019

How to Sign with White-Boxed AES.
Proceedings of the Progress in Cryptology - LATINCRYPT 2019, 2019

Breakdown Resilience of Key Exchange Protocols: NewHope, TLS 1.3, and Hybrids.
Proceedings of the Computer Security - ESORICS 2019, 2019

2018
Backdoored Hash Functions: Immunizing HMAC and HKDF.
IACR Cryptology ePrint Archive, 2018

Invisible Sanitizable Signatures and Public-Key Encryption are Equivalent.
IACR Cryptology ePrint Archive, 2018

Simulatable Channels: Extended Security that is Universally Composable and Easier to Prove.
IACR Cryptology ePrint Archive, 2018

Hybrid Key Encapsulation Mechanisms and Authenticated Key Exchange.
IACR Cryptology ePrint Archive, 2018

2017
Self-Guarding Cryptographic Protocols against Algorithm Substitution Attacks.
IACR Cryptology ePrint Archive, 2017

Data Is a Stream: Security of Stream-Based Channels.
IACR Cryptology ePrint Archive, 2017

Replay Attacks on Zero Round-Trip Time: The Case of the TLS 1.3 Handshake Candidates.
IACR Cryptology ePrint Archive, 2017

Breakdown Resilience of Key Exchange Protocols and the Cases of NewHope and TLS 1.3.
IACR Cryptology ePrint Archive, 2017

Zero Round-Trip Time for the Extended Access Control Protocol.
IACR Cryptology ePrint Archive, 2017

PRF-ODH: Relations, Instantiations, and Impossibility Results.
IACR Cryptology ePrint Archive, 2017

Redactable Graph Hashing, Revisited - (Extended Abstract).
Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

2016
Unpicking PLAID: a cryptographic analysis of an ISO-standards-track authentication protocol.
Int. J. Inf. Sec., 2016

Adaptive proofs of knowledge in the random oracle model.
IET Information Security, 2016

Obfuscation Combiners.
IACR Cryptology ePrint Archive, 2016

A Cryptographic Analysis of the TLS 1.3 draft-10 Full and Pre-shared Key Handshake Protocol.
IACR Cryptology ePrint Archive, 2016

Public-Key Cryptography (Dagstuhl Seminar 16371).
Dagstuhl Reports, 2016

Securing Transactions with the eIDAS Protocols.
Proceedings of the Information Security Theory and Practice, 2016

Key Confirmation in Key Exchange: A Formal Treatment and Implications for TLS 1.3.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

Attribute-Based Access Control Architectures with the eIDAS Protocols.
Proceedings of the Security Standardisation Research - Third International Conference, 2016

2015
Sanitizable Signcryption: Sanitization over Encrypted Data (Full Version).
IACR Cryptology ePrint Archive, 2015

A Cryptographic Analysis of the TLS 1.3 Handshake Protocol Candidates.
IACR Cryptology ePrint Archive, 2015

On the Hardness of Proving CCA-security of Signed ElGamal.
IACR Cryptology ePrint Archive, 2015

Notions of Deniable Message Authentication.
Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society, 2015

Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters.
Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2014
Robust Multi-Property Combiners for Hash Functions.
J. Cryptology, 2014

Operational Signature Schemes.
IACR Cryptology ePrint Archive, 2014

Abstreitbarkeit bei eID-Lösungen.
Datenschutz und Datensicherheit, 2014

Intercepting tokens in cryptographic protocols: The empire strikes back in the clone wars.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Multi-Stage Key Exchange and the Case of Google's QUIC Protocol.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
Less is more: relaxed yet composable security notions for key exchange.
Int. J. Inf. Sec., 2013

Limitations of the Meta-Reduction Technique: The Case of Schnorr Signatures.
IACR Cryptology ePrint Archive, 2013

Computing on Authenticated Data for Adjustable Predicates.
IACR Cryptology ePrint Archive, 2013

A Cryptographic Analysis of OPACITY.
IACR Cryptology ePrint Archive, 2013

The Fiat-Shamir Transformation in a Quantum World.
IACR Cryptology ePrint Archive, 2013

The PACE|AA Protocol for Machine Readable Travel Documents, and its Security.
IACR Cryptology ePrint Archive, 2013

Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions.
IACR Cryptology ePrint Archive, 2013

Notions of Black-Box Reductions, Revisited.
IACR Cryptology ePrint Archive, 2013

Subtle kinks in distance-bounding: an analysis of prominent protocols.
Proceedings of the Sixth ACM Conference on Security and Privacy in Wireless and Mobile Networks, 2013

The PACE|CA Protocol for Machine Readable Travel Documents.
Proceedings of the Trusted Systems - 5th International Conference, 2013

A Cryptographic Analysis of OPACITY - (Extended Abstract).
Proceedings of the Computer Security - ESORICS 2013, 2013

Terrorism in Distance Bounding: Modeling Terrorist-Fraud Resistance.
Proceedings of the Applied Cryptography and Network Security, 2013

2012
Security of blind signatures under aborts and applications to adaptive oblivious transfer.
J. Mathematical Cryptology, 2012

Provably Secure Distance-Bounding: an Analysis of Prominent Protocols.
IACR Cryptology ePrint Archive, 2012

Unconditionally-Secure Universally Composable Password-Based Key-Exchange based on One-Time Memory Tokens.
IACR Cryptology ePrint Archive, 2012

Domain-Specifi c Pseudonymous Signatures for the German Identity Card.
IACR Cryptology ePrint Archive, 2012

Merging the Cryptographic Security Analysis and the Algebraic-Logic Security Proof of PACE.
Proceedings of the Sicherheit 2012: Sicherheit, 2012

TLS, PACE, and EAC: ACryptographic View at Modern Key Exchange Protocols.
Proceedings of the Sicherheit 2012: Sicherheit, 2012

Domain-Specific Pseudonymous Signatures for the German Identity Card.
Proceedings of the Information Security - 15th International Conference, 2012

Black-Box Reductions and Separations in Cryptography.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2012, 2012

2011
History-Free Sequential Aggregate Signatures.
IACR Cryptology ePrint Archive, 2011

A Formal Approach to Distance-Bounding RFID Protocols.
IACR Cryptology ePrint Archive, 2011

Physically Uncloneable Functions in the Universal Composition Framework.
IACR Cryptology ePrint Archive, 2011

Public-Key Cryptography (Dagstuhl Seminar 11391).
Dagstuhl Reports, 2011

Learning Whom to Trust in a Privacy-Friendly Way.
Proceedings of the IEEE 10th International Conference on Trust, 2011

Breaking reCAPTCHA: A Holistic Approach via Shape Recognition.
Proceedings of the Future Challenges in Security and Privacy for Academia and Industry, 2011

Secure Set Intersection with Untrusted Hardware Tokens.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

Expedient Non-malleability Notions for Hash Functions.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

Random Oracle Reducibility.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Composability of bellare-rogaway key exchange protocols.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Relaxed Security Notions for Signatures of Knowledge.
Proceedings of the Applied Cryptography and Network Security, 2011

2010
Random Oracles in a Quantum World.
IACR Cryptology ePrint Archive, 2010

Random Oracles in a Quantum World
CoRR, 2010

Delayed-Key Message Authentication for Streams.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

CAPTCHAs: The Good, the Bad, and the Ugly.
Proceedings of the Sicherheit 2010: Sicherheit, 2010

History-Free Aggregate Message Authentication Codes.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Unlinkability of Sanitizable Signatures.
Proceedings of the Public Key Cryptography, 2010

Security Analysis of the Extended Access Control Protocol for Machine Readable Travel Documents.
Proceedings of the Information Security - 13th International Conference, 2010

On the Impossibility of Three-Move Blind Signature Schemes.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Hash Function Combiners in TLS and SSL.
Proceedings of the Topics in Cryptology, 2010

Random Oracles with(out) Programmability.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions.
Proceedings of the Progress in Cryptology, 2010

Redactable Signatures for Tree-Structured Data: Definitions and Constructions.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
Efficient Non-malleable Commitment Schemes.
J. Cryptology, 2009

Confidential Signatures and Deterministic Signcryption.
IACR Cryptology ePrint Archive, 2009

Foundations of Non-Malleable Hash and One-Way Functions.
IACR Cryptology ePrint Archive, 2009

Security Analysis of the PACE Key-Agreement Protocol.
IACR Cryptology ePrint Archive, 2009

Security of Blind Signatures under Aborts.
Proceedings of the Public Key Cryptography, 2009

Security of Sanitizable Signatures Revisited.
Proceedings of the Public Key Cryptography, 2009

Santizable Signatures: How to Partially Delegate Control for Authenticated Data.
Proceedings of the BIOSIG 2009, 2009

2008
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles.
IACR Cryptology ePrint Archive, 2008

Multi-property Preserving Combiners for Hash Functions.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Robust Multi-property Combiners for Hash Functions Revisited.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Security of NMACand HMACBased on Non-malleability.
Proceedings of the Topics in Cryptology, 2008

2007
Anonymous Signatures Made Easy.
Proceedings of the Public Key Cryptography, 2007

A Closer Look at PKI: Security and Efficiency.
Proceedings of the Public Key Cryptography, 2007

Security of Invertible Media Authentication Schemes Revisited.
Proceedings of the Information Hiding, 9th International Workshop, 2007

Security-Amplifying Combiners for Collision-Resistant Hash Functions.
Proceedings of the Advances in Cryptology, 2007

2006
Universally Composable Oblivious Transfer in the Multi-party Setting.
Proceedings of the Topics in Cryptology, 2006

Round-Optimal Composable Blind Signatures in the Common Reference String Model.
Proceedings of the Advances in Cryptology, 2006

On the Security of OAEP.
Proceedings of the Advances in Cryptology, 2006

2005
Completely Non-malleable Schemes.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors.
Proceedings of the Advances in Cryptology, 2005

Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes.
Proceedings of the Advances in Cryptology, 2005

2004
A Privacy-Friendly Loyalty System Based on Discrete Logarithms over Elliptic Curves.
Proceedings of the Financial Cryptography, 2004

Fast Verification of Hash Chains.
Proceedings of the Topics in Cryptology, 2004

2003
The Cramer-Shoup Strong-RSASignature Scheme Revisited.
Proceedings of the Public Key Cryptography, 2003

Progressive Verification: The Case of Message Authentication: (Extended Abstract).
Proceedings of the Progress in Cryptology, 2003

2002
The Cramer-Shoup Strong-RSA Signature Scheme Revisited.
IACR Cryptology ePrint Archive, 2002

The Representation Problem Based on Factoring.
Proceedings of the Topics in Cryptology, 2002

On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function.
Proceedings of the Topics in Cryptology, 2002

2001
Trapdoor commitment schemes and their applications.
PhD thesis, 2001

Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions.
Theor. Comput. Sci., 2001

Universally Composable Commitments.
IACR Cryptology ePrint Archive, 2001

A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires.
Proceedings of the Topics in Cryptology, 2001

2000
Identification Protocols Secure Against Reset Attacks.
IACR Cryptology ePrint Archive, 2000

A Note on Security Proofs in the Generic Model.
Proceedings of the Advances in Cryptology, 2000

1999
Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications.
Proceedings of the Advances in Cryptology, 1999

1997
Lower Bounds for the Signature Size of Incremental Schemes.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Incremental Cryptography and Memory Checkers.
Proceedings of the Advances in Cryptology, 1997

Practical Memory Checkers for Stacks, Queues and Deques.
Proceedings of the Information Security and Privacy, Second Australasian Conference, 1997


  Loading...