default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmilia Käsper
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c11]Nimrod Aviram, Sebastian Schinzel, Juraj Somorovsky, Nadia Heninger, Maik Dankel, Jens Steube, Luke Valenta, David Adrian, J. Alex Halderman, Viktor Dukhovni, Emilia Käsper, Shaanan Cohney, Susanne Engels, Christof Paar, Yuval Shavitt:
DROWN: Breaking TLS Using SSLv2. USENIX Security Symposium 2016: 689-706- 2013
- [i5]Ben Laurie, Adam Langley, Emilia Käsper:
Certificate Transparency. RFC 6962: 1-27 (2013) - 2012
- [c10]George Danezis, Emilia Käsper:
The Dangers of Composing Anonymous Channels. Information Hiding 2012: 191-206 - 2011
- [c9]Emilia Käsper:
Fast Elliptic Curve Cryptography in OpenSSL. Financial Cryptography Workshops 2011: 27-39 - 2010
- [j1]Jan De Beule
, Yves Edel, Emilia Käsper, Andreas Klein, Svetla Nikova, Bart Preneel, Jeroen Schillewaert, Leo Storme:
Galois geometries and applications. Des. Codes Cryptogr. 56(2-3): 85-86 (2010) - [c8]Jean-Philippe Aumasson, Emilia Käsper, Lars R. Knudsen, Krystian Matusiewicz, Rune Steinsmo Ødegård, Thomas Peyrin, Martin Schläffer:
Distinguishers for the Compression Function and Output Transformation of Hamsi-256. ACISP 2010: 87-103 - [i4]Jean-Philippe Aumasson, Emilia Käsper, Lars R. Knudsen, Krystian Matusiewicz, Rune Steinsmo Ødegård, Thomas Peyrin, Martin Schläffer:
Distinguishers for the Compression Function and Output Transformation of Hamsi-256. IACR Cryptol. ePrint Arch. 2010: 91 (2010)
2000 – 2009
- 2009
- [c7]Emilia Käsper, Peter Schwabe:
Faster and Timing-Attack Resistant AES-GCM. CHES 2009: 1-17 - [c6]George Danezis, Claudia Díaz, Emilia Käsper, Carmela Troncoso:
The Wisdom of Crowds: Attacks and Optimal Constructions. ESORICS 2009: 406-423 - [i3]Sebastiaan Indesteege, Elena Andreeva, Christophe De Cannière, Orr Dunkelman, Emilia Käsper, Svetla Nikova, Bart Preneel, Elmar Tischhauser:
The Lane hash function. Symmetric Cryptography 2009 - [i2]Emilia Käsper, Peter Schwabe:
Faster and Timing-Attack Resistant AES-GCM. IACR Cryptol. ePrint Arch. 2009: 129 (2009) - 2008
- [c5]Emilia Käsper, Vincent Rijmen, Tor E. Bjørstad, Christian Rechberger, Matthew J. B. Robshaw, Gautham Sekar:
Correlated Keystreams in Moustique. AFRICACRYPT 2008: 246-257 - [c4]Sebastian Faust, Emilia Käsper, Stefan Lucks:
Efficient Simultaneous Broadcast. Public Key Cryptography 2008: 180-196 - 2007
- [c3]Emilia Käsper, Ventzislav Nikov, Svetla Nikova:
Strongly Multiplicative Hierarchical Threshold Secret Sharing. ICITS 2007: 148-168 - [c2]George Danezis, Claudia Díaz, Sebastian Faust, Emilia Käsper, Carmela Troncoso, Bart Preneel:
Efficient Negative Databases from Cryptographic Hash Functions. ISC 2007: 423-436 - 2006
- [i1]Emilia Käsper, Sven Laur, Helger Lipmaa:
Black-Box Knowledge Extraction Revisited: Universal Approach with Precise Bounds. IACR Cryptol. ePrint Arch. 2006: 356 (2006) - 2004
- [c1]Bruno Pouliquen, Ralf Steinberger, Camelia Ignat, Emilia Käsper, Irina P. Temnikova:
Multilingual and cross-lingual news topic tracking. COLING 2004
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:46 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:
