default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Forler
Person information
- affiliation: Hochschule Schmalkalden, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j3]Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
POEx: A beyond-birthday-bound-secure on-line cipher. Cryptogr. Commun. 10(1): 177-193 (2018)- 2017
- [c17]Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
Reforgeability of Authenticated Encryption Schemes. ACISP (2) 2017: 19-37 - [i13]Martin Potthast
, Christian Forler, Eik List, Stefan Lucks:
Passphone: Outsourcing Phone-based Web Authentication while Protecting User Privacy. IACR Cryptol. ePrint Arch. 2017: 158 (2017) - [i12]Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
Reforgeability of Authenticated Encryption Schemes. IACR Cryptol. ePrint Arch. 2017: 332 (2017) - 2016
- [j2]Farzaneh Abed, Christian Forler, Stefan Lucks:
General classification of the authenticated encryption schemes for the CAESAR competition. Comput. Sci. Rev. 22: 13-26 (2016) - [c16]Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch. ACISP (2) 2016: 317-332 - [c15]Farzaneh Abed, Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
RIV for Robust Authenticated Encryption. FSE 2016: 23-42 - [c14]Martin Potthast, Christian Forler, Eik List, Stefan Lucks:
Passphone: Outsourcing Phone-Based Web Authentication While Protecting User Privacy. NordSec 2016: 235-255 - [i11]Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch. IACR Cryptol. ePrint Arch. 2016: 395 (2016) - 2015
- [b1]Christian Forler:
Analysis Design & Applications of Cryptographic Building Blocks. Bauhaus University, Weimar, Germany, 2015 - [p1]Christian Forler:
Analyse, Design und Einsatz kryptographischer Primitive. Ausgezeichnete Informatikdissertationen 2015: 111-120 - 2014
- [c13]Farzaneh Abed, Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
Counter-bDM: A Provably Secure Family of Multi-Block-Length Compression Functions. AFRICACRYPT 2014: 440-458 - [c12]Christian Forler, Stefan Lucks, Jakob Wenzel:
Memory-Demanding Password Scrambling. ASIACRYPT (2) 2014: 289-305 - [c11]Farzaneh Abed, Scott R. Fluhrer, Christian Forler, Eik List, Stefan Lucks, David A. McGrew, Jakob Wenzel:
Pipelineable On-line Encryption. FSE 2014: 205-223 - [c10]Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
Overview of the Candidates for the Password Hashing Competition - And Their Resistance Against Garbage-Collector Attacks. PASSWORDS 2014: 3-18 - [i10]Farzaneh Abed, Scott R. Fluhrer, Christian Forler, Eik List, Stefan Lucks, David A. McGrew, Jakob Wenzel:
Pipelineable On-Line Encryption. IACR Cryptol. ePrint Arch. 2014: 297 (2014) - [i9]Farzaneh Abed, Christian Forler, Stefan Lucks:
Classification of the CAESAR Candidates. IACR Cryptol. ePrint Arch. 2014: 792 (2014) - [i8]Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
Overview of the Candidates for the Password Hashing Competition - And their Resistance against Garbage-Collector Attacks. IACR Cryptol. ePrint Arch. 2014: 881 (2014) - [i7]Christian Forler, David A. McGrew, Stefan Lucks, Jakob Wenzel:
COFFE: Ciphertext Output Feedback Faithful Encryption. IACR Cryptol. ePrint Arch. 2014: 1003 (2014) - 2013
- [c9]Farzaneh Abed, Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
A Framework for Automated Independent-Biclique Cryptanalysis. FSE 2013: 561-581 - [i6]Christian Forler, Stefan Lucks, Jakob Wenzel:
Catena: A Memory-Consuming Password Scrambler. IACR Cryptol. ePrint Arch. 2013: 525 (2013) - 2012
- [c8]Ewan Fleischmann, Christian Forler, Stefan Lucks, Jakob Wenzel:
Weimar-DM: A Highly Secure Double-Length Compression Function. ACISP 2012: 152-165 - [c7]Christian Forler, Stefan Lucks, Jakob Wenzel:
Designing the API for a Cryptographic Library - A Misuse-Resistant Application Programming Interface. Ada-Europe 2012: 75-88 - [c6]Ewan Fleischmann, Christian Forler, Stefan Lucks:
The Collision Security of MDC-4. AFRICACRYPT 2012: 252-269 - [c5]Ewan Fleischmann, Christian Forler, Stefan Lucks:
McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes. FSE 2012: 196-215 - [i5]Ewan Fleischmann, Christian Forler, Stefan Lucks, Jakob Wenzel:
The Collision Security of MDC-4 The Collision Security of MDC-4. IACR Cryptol. ePrint Arch. 2012: 96 (2012) - [i4]Farzaneh Abed, Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
Biclique Cryptanalysis of the PRESENT and LED Lightweight Ciphers. IACR Cryptol. ePrint Arch. 2012: 591 (2012) - 2011
- [c4]Ewan Fleischmann, Christian Forler, Stefan Lucks:
Γ-MAC[H, P] - A New Universal MAC Scheme. WEWoRC 2011: 83-98 - [i3]Ewan Fleischmann, Christian Forler, Stefan Lucks, Jakob Wenzel:
McOE: A Foolproof On-Line Authenticated Encryption Scheme. IACR Cryptol. ePrint Arch. 2011: 644 (2011) - 2010
- [j1]Ewan Fleischmann, Christian Forler, Michael Gorski, Stefan Lucks:
TWISTERpi - a framework for secure and fast hash functions. Int. J. Appl. Cryptogr. 2(1): 68-81 (2010) - [c3]Ewan Fleischmann, Christian Forler, Michael Gorski, Stefan Lucks:
New Boomerang Attacks on ARIA. INDOCRYPT 2010: 163-175 - [c2]Ewan Fleischmann, Christian Forler, Michael Gorski, Stefan Lucks:
Collision Resistant Double-Length Hashing. ProvSec 2010: 102-118
2000 – 2009
- 2009
- [c1]Ewan Fleischmann, Christian Forler, Michael Gorski, Stefan Lucks:
Twister- A Framework for Secure and Fast Hash Functions. ISPEC 2009: 257-273 - [i2]Ewan Fleischmann, Christian Forler, Michael Gorski:
Classification of the SHA-3 Candidates. Symmetric Cryptography 2009 - 2008
- [i1]Ewan Fleischmann, Christian Forler, Michael Gorski:
Classification of the SHA-3 Candidates. IACR Cryptol. ePrint Arch. 2008: 511 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
