D-Index & Metrics Best Publications

Eike Kiltz

Ruhr University Bochum
Germany

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 54 Citations 11,999 157 World Ranking 3005 National Ranking 133

Overview

What is he best known for?

The fields of study he is best known for:

Algebra
Cryptography
Public-key cryptography

His primary areas of study are Encryption, Theoretical computer science, Cryptography, Random oracle and Probabilistic encryption. His biological study spans a wide range of topics, including Transformation and Reduction. His Theoretical computer science research includes themes of Algorithm and Hash function.

Eike Kiltz interconnects Discrete mathematics, Modulo, Exponentiation and Constant in the investigation of issues within Cryptography. His research investigates the link between Random oracle and topics such as Digital signature that cross with problems in Signature. His Probabilistic encryption study integrates concerns from other disciplines, such as Multiple encryption, Attribute-based encryption and ElGamal encryption.

His most cited work include:

Bonsai trees, or how to delegate a lattice basis (457 citations)
Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions (451 citations)
A New Randomness Extraction Paradigm for Hybrid Encryption (412 citations)

What are the main themes of his work throughout his whole career to date?

Eike Kiltz focuses on Theoretical computer science, Encryption, Random oracle, Discrete mathematics and Computer security. His Theoretical computer science research incorporates themes from Signature, Hybrid cryptosystem, Hash function, Identity and Standard model. His work on Encryption is being expanded to include thematically relevant topics such as Cryptography.

His work carried out in the field of Random oracle brings together such families of science as Algorithm, Key exchange, Identification and Digital signature. His research integrates issues of Group, Combinatorics, Matrix, Trapdoor function and Function in his study of Discrete mathematics. Eike Kiltz has included themes like Multiple encryption, Attribute-based encryption and 40-bit encryption in his Probabilistic encryption study.

He most often published in these fields:

Theoretical computer science (54.55%)
Encryption (49.09%)
Random oracle (23.64%)

What were the highlights of his more recent work (between 2015-2020)?

Theoretical computer science (54.55%)
Encryption (49.09%)
Random oracle (23.64%)

In recent papers he was focusing on the following fields of study:

Eike Kiltz spends much of his time researching Theoretical computer science, Encryption, Random oracle, Public-key cryptography and Cryptography. His work deals with themes such as Signature, Generic group model, Identification, Reduction and Hash function, which intersect with Theoretical computer science. The Encryption study combines topics in areas such as Discrete mathematics and Group.

His study in Random oracle is interdisciplinary in nature, drawing from both Transformation, Key exchange and Digital signature. His Public-key cryptography study combines topics from a wide range of disciplines, such as Graph, Polynomial and Distributed computing. His work on Cryptographic primitive as part of general Cryptography study is frequently linked to Impossibility, therefore connecting diverse disciplines of science.

Between 2015 and 2020, his most popular works were:

A Modular Analysis of the Fujisaki-Okamoto Transformation (126 citations)
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (114 citations)
CRYSTALS-Dilithium: A lattice-based digital signature scheme (66 citations)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions

Michel Abdalla;Mihir Bellare;Dario Catalano;Eike Kiltz.
international cryptology conference (2005)

1100 Citations

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Michel Abdalla;Mihir Bellare;Dario Catalano;Eike Kiltz.
Journal of Cryptology (2008)

1088 Citations

Bonsai trees, or how to delegate a lattice basis

David Cash;Dennis Hofheinz;Eike Kiltz;Chris Peikert.
theory and application of cryptographic techniques (2010)

923 Citations

Chosen-ciphertext security from tag-based encryption

Eike Kiltz.
Lecture Notes in Computer Science (2006)

716 Citations

Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation

Ivan Damgård;Matthias Fitzi;Eike Kiltz;Jesper Buus Nielsen.
theory of cryptography conference (2006)

506 Citations

A New Randomness Extraction Paradigm for Hybrid Encryption

Eike Kiltz;Krzysztof Pietrzak;Martijn Stam;Moti Yung.
international cryptology conference (2009)

394 Citations

CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM

Joppe Bos;Leo Ducas;Eike Kiltz;T Lepoint.
ieee european symposium on security and privacy (2018)

375 Citations

A Modular Analysis of the Fujisaki-Okamoto Transformation

Dennis Hofheinz;Kathrin Hövelmanns;Eike Kiltz.
theory of cryptography conference (2017)

352 Citations

Secure Hybrid Encryption from Weakened Key Encapsulation.

Dennis Hofheinz;Eike Kiltz.
IACR Cryptology ePrint Archive (2007)

335 Citations

An Algebraic Framework for Diffie---Hellman Assumptions

Alex Escala;Gottfried Herold;Eike Kiltz;Carla Ràfols.
Journal of Cryptology (2017)

296 Citations

If you think any of the details on this page are incorrect, let us know.