Joe Kilian
Computer Networks and Communications · 1988–2004
A researcher in the Science corpus: 8 papers; trusts 8 researchers and is trusted by 33 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 11 citations into it
- Artificial Intelligence — 10 citations into it; #4,946 of 35,345 by trust here, #7,172 by citations
- Privacy & Security — 10 citations into it; #166 of 709 by trust here, #232 by citations
- Algorithms & Complexity — 8 citations into it
Whom Joe Kilian trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Shafi Goldwasser
- Oded Goldreich
- Silvio Micali
- Amos Fiat
- Mihir Bellare
- Michael M. Mitzenmacher
- Jesper Buus Nielsen
- Michael Luby
- Yossi Matias
- Adi Shamir
Who trusts Joe Kilian overall
- Eli Ben-Sasson
- Jens Groth
- Srinath T. V. Setty
- Rosario Gennaro
- Michael Walfish
- Boaz Barak
- Tatsuaki Okamoto
- Yuval Ishai
- Benny Pinkas
- Andrew Justin Blumberg
Papers from Joe Kilian's perspective
Ordered by how strongly the researchers Joe Kilian trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Protocols for secure computations
- How to construct random functions
- How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)
- Security and Composition of Multiparty Cryptographic Protocols (Journal of Cryptology)
- Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case (Annual International Cryptology Conference)
- On the (In)security of the Fiat-Shamir paradigm (44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.)
- Summary cache: a scalable wide-area web cache sharing protocol
- Privacy preserving auctions and mechanism design
Their papers
- Extending Oblivious Transfers Efficiently (2003) — 853 citations
- The Bloomier filter: an efficient data structure for static support lookup tables (2004) — 462 citations
- The Security of the Cipher Block Chaining Message Authentication Code (2000) — 684 citations
- An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions (1998)
- An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions (1995)
- A note on efficient zero-knowledge proofs and arguments (extended abstract) (1992)
- Uses of randomness in algorithms and protocols (1990)
- Multi-prover interactive proofs: how to remove intractability assumptions (1988)