Eike Kiltz
Artificial Intelligence · 2005–2018
A researcher in the Science corpus: 10 papers; trusts 62 researchers and is trusted by 68 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 140 citations into it; #3,789 of 36,961 by trust here, #7,731 by citations
- Computational Theory and Mathematics — 70 citations into it; #581 of 12,489 by trust here, #1,497 by citations
- Information Systems — 42 citations into it; #446 of 9,233 by trust here, #3,391 by citations
- Computer Networks and Communications — 27 citations into it
- Computer Vision and Pattern Recognition — 24 citations into it; #7,546 of 21,973 by trust here, #10,964 by citations
- Privacy & Security — 9 citations into it
- Discrete Mathematics and Combinatorics — 8 citations into it
- Geometry and Topology — 7 citations into it; #5,314 of 7,435 by trust here, #6,505 by citations
Whom Eike Kiltz trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dan Boneh
- Ran Canetti
- Ronald Cramer
- Victor Shoup
- Mihir Bellare
- Xavier Boyen
- Craig Gentry
- Chris Peikert
- Ivan Bjerre Damgård
- Vadim Lyubashevsky
Who trusts Eike Kiltz overall
- Octavian Catrina
- Ivan Bjerre Damgård
- Dan Bogdanov
- Amos Beimel
- Marcel Keller
- George Danezis
- Raphael Bost
- Martin Burkhart
- Brian Knott
- Toshinori Araki
Papers from Eike Kiltz's perspective
Ordered by how strongly the researchers Eike Kiltz trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- Efficient Identity-Based Encryption Without Random Oracles (International Conference on the Theory and Application of Cryptographic Techniques)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- New Directions in Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption (International Conference on the Theory and Application of Cryptographic Techniques)
- A method for obtaining digital signatures and public-key cryptosystems
- Short Signatures from the Weil Pairing
- Trapdoors for hard lattices and new cryptographic constructions
Their papers
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions (2005) — 999 citations
- Secure Hybrid Encryption from Weakened Key Encapsulation (2007) — 300 citations
- Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation (2006) — 530 citations
- CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017) — 1,190 citations
- CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018) — 826 citations
- The Algebraic Group Model and its Applications (2018) — 395 citations
- A Modular Analysis of the Fujisaki-Okamoto Transformation (2017) — 542 citations
- An Algebraic Framework for Diffie–Hellman Assumptions (2013) — 107 citations
- Bonsai Trees, or How to Delegate a Lattice Basis (2010) — 949 citations
- A New Randomness Extraction Paradigm for Hybrid Encryption (2009) — 380 citations