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.
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.
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.
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.
Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions
Michel Abdalla;Mihir Bellare;Dario Catalano;Eike Kiltz.
international cryptology conference (2005)
Bonsai trees, or how to delegate a lattice basis
David Cash;Dennis Hofheinz;Eike Kiltz;Chris Peikert.
theory and application of cryptographic techniques (2010)
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)
A New Randomness Extraction Paradigm for Hybrid Encryption
Eike Kiltz;Krzysztof Pietrzak;Martijn Stam;Moti Yung.
international cryptology conference (2009)
Chosen-ciphertext security from tag-based encryption
Lecture Notes in Computer Science (2006)
Secure hybrid encryption from weakened key encapsulation
Dennis Hofheinz;Eike Kiltz.
international cryptology conference (2007)
An Algebraic Framework for Diffie---Hellman Assumptions
Alex Escala;Gottfried Herold;Eike Kiltz;Carla Ràfols.
Journal of Cryptology (2017)
A Modular Analysis of the Fujisaki-Okamoto Transformation
Dennis Hofheinz;Kathrin Hövelmanns;Eike Kiltz.
theory of cryptography conference (2017)
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)
The twin Diffie-Hellman problem and applications
David Cash;Eike Kiltz;Victor Shoup.
international cryptology conference (2008)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: