Joe Kilian
-
- Chaos-based Image/Signal Encryption 14
- Advanced Steganography and Watermarking Techniques 6
- Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs 32
- Artificial Intelligence top 0.5%
- Cryptography and Data Security 38
- Cryptographic Implementations and Security 10
- Machine Learning and Algorithms 9
- Internet Traffic Analysis and Secure E-voting 6
- Logic, Reasoning, and Knowledge 5
- Signal Processing top 1%
Joe Kilian
75 papers receiving 6.1k citations
Hit Papers
Peers
Comparison fields: 5 of 99
- Computer Vision and Pattern Recognition 4.1k
- Computational Theory and Mathematics 1.3k
- Artificial Intelligence 2.4k
- Computer Graphics and Computer-Aided Design 246
- Signal Processing 518
Countries citing papers authored by Joe Kilian
This map shows the geographic impact of Joe Kilian's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Joe Kilian with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joe Kilian more than expected).
Fields of papers citing papers by Joe Kilian
This network shows the impact of papers produced by Joe Kilian. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Joe Kilian. The network helps show where Joe Kilian may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Joe Kilian, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12. 2005, Proceedings (Lecture Notes in Computer Science) | 2005 | 2 |
| 2 | 2005 | 11 | |
| 3 | 2004 | 228 | |
| 4 | Advances in cryptology - CRYPTO 2001 : 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001 : proceedings | 2001 | 20 |
| 5 | 2001 | 31 | |
| 6 | 2001 | 76 | |
| 7 | 2000 | 232 | |
| 8 | 1998 | 163 | |
| 9 | On Limited versus Polynomial Nondeterminism | 1997 | 21 |
| 10 | Improved Efficient Arguments (Preliminary Version) | 1995 | 36 |
| 11 | Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract) | 1995 | 6 |
| 12 | Receipt-free mix-type voting scheme - A practical solution to the implementation of a voting booth- | 1995 | 130 |
| 13 | The organization of permutation architectures with bused interconnections | 1994 | 5 |
| 14 | Minimum resource zero-knowledge proofs (extended abstracts) | 1989 | 6 |
| 15 | Minimum Resource Zero-Knowledge Proofs (Extended Abstract) | 1989 | 3 |
| 16 | 1989 | 100 | |
| 17 | Weakening Security Assumptions and Oblivious Transfer (Abstract) | 1988 | 1 |
| 18 | Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract) | 1988 | 16 |
| 19 | 1987 | 2 | |
| 20 | 1987 | 9 |
About Joe Kilian
Joe Kilian is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Vision and Pattern Recognition, having authored 75 papers that have together received 6.9k indexed citations. Recurring topics across this work include Cryptography and Data Security (38 papers), Complexity and Algorithms in Graphs (32 papers), Chaos-based Image/Signal Encryption (14 papers), Cryptographic Implementations and Security (10 papers), Machine Learning and Algorithms (9 papers), Internet Traffic Analysis and Secure E-voting (6 papers), Advanced Steganography and Watermarking Techniques (6 papers) and Logic, Reasoning, and Knowledge (5 papers). The work is most often cited by research in Computer Vision and Pattern Recognition (4.1k citations), Computational Theory and Mathematics (1.3k citations) and Artificial Intelligence (2.4k citations). Joe Kilian has collaborated with scholars based in United States, Israel and Canada. Frequent co-authors include T. Shamoon, Ingemar J. Cox, Frank Thomson Leighton, Uriel Feige, Phillip Rogaway, Mihir Bellare, T.G. Leighton, Shafi Goldwasser, Kazue Sako and Claude Crépeau.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.