Eike Kiltz
Orcid: 0000-0003-1178-048XAffiliations:
- Ruhr University Bochum, Germany
According to our database1,
Eike Kiltz
authored at least 119 papers
between 2001 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
-
on cits.rub.de
-
on isni.org
On csauthors.net:
Bibliography
2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022
2021
IACR Cryptol. ePrint Arch., 2021
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing.
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Proceedings of the Theory of Cryptography - 19th International Conference, 2021
2020
IACR Cryptol. ePrint Arch., 2020
2019
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Datenschutz und Datensicherheit, 2019
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019
2018
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
Public-Key Encryption Resistant to Parameter Subversion and its Realization from Efficiently-Embeddable Groups.
IACR Cryptol. ePrint Arch., 2018
Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018
2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
2016
IET Inf. Secur., 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Standard Security Does Imply Security Against Selective Opening for Markov Distributions.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016
2015
Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed?
J. Cryptol., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
Standard Security Does Imply Security Against Selective Opening for Markov Distributions.
IACR Cryptol. ePrint Arch., 2015
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015
2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
2013
J. Cryptol., 2013
Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013
2012
Proceedings of the Fast Software Encryption - 19th International Workshop, 2012
2011
IACR Cryptol. ePrint Arch., 2011
2010
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model.
IACR Cryptol. ePrint Arch., 2010
Adv. Math. Commun., 2010
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
Proceedings of the Provable Security - 4th International Conference, 2010
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
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
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010
2009
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles.
Theor. Comput. Sci., 2009
Inf. Process. Lett., 2009
IACR Cryptol. ePrint Arch., 2009
Proceedings of the Public Key Cryptography, 2009
On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model.
Proceedings of the Advances in Cryptology, 2009
Proceedings of the Advances in Cryptology, 2009
Proceedings of the Advances in Cryptology, 2009
2008
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions.
J. Cryptol., 2008
IET Inf. Secur., 2008
CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
Proceedings of the Topics in Cryptology, 2008
2007
IACR Cryptol. ePrint Arch., 2007
From Selective-ID to Full Security: The Case of the Inversion-Based Boneh-Boyen IBE Scheme.
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.
Proceedings of the Advances in Cryptology, 2007
2006
Chosen-Ciphertext Secure Identity-Based Encryption in the Standard Model with short Ciphertexts.
IACR Cryptol. ePrint Arch., 2006
IACR Cryptol. ePrint Arch., 2006
IACR Cryptol. ePrint Arch., 2006
IACR Cryptol. ePrint Arch., 2006
Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem.
Discret. Appl. Math., 2006
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006
Chosen-Ciphertext Secure Threshold Identity-Based Key Encapsulation Without Random Oracles.
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006
Proceedings of the Public Key Cryptography, 2006
Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006
2005
J. Comput. Syst. Sci., 2005
Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation.
IACR Cryptol. ePrint Arch., 2005
2004
IACR Cryptol. ePrint Arch., 2004
2003
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Proceedings of the Cryptography and Coding, 2003
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2001
Proceedings of the Progress in Cryptology, 2001
A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001