| 2008 | ASIACRYPT | A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting. | Jason Keller, Joe Kilian |
| 2008 | TCC | Fast Private Norm Estimation and Heavy Hitters. | Joe Kilian, Andr Madeira, Martin J. Strauss, Xuan Zheng |
| 2007 | HotOS | A Web Based Covert File System. | Arati Baliga, Joe Kilian, Liviu Iftode |
| 2005 | EuroCrypt | On Robust Combiners for Oblivious Transfer and Other Primitives. | Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen |
| 2004 | ICALP | Communication Versus Computation. | Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh |
| 2004 | SODA | The Bloomier filter: an efficient data structure for static support lookup tables. | Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal |
| 2003 | CRYPTO | Extending Oblivious Transfers Efficiently. | Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank |
| 2003 | FOCS | Zero-Knowledge Sets. | Silvio Micali, Michael O. Rabin, Joe Kilian |
| 2003 | STOC | A sublinear algorithm for weakly approximating edit distance. | Tugkan Batu, Funda Ergn, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami |
| 2001 | ASIACRYPT | Responsive Round Complexity and Concurrent Zero-Knowledge. | Tzafrir Cohen, Joe Kilian, Erez Petrank |
| 2001 | STOC | Black-box concurrent zero-knowledge requires Omega~(log n) rounds. | Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen |
| 2001 | STOC | Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. | Joe Kilian, Erez Petrank |
| 2000 | ICALP | One-Round Secure Computation and Secure Autonomous Mobile Agents. | Christian Cachin, Jan Camenisch, Joe Kilian, Joy Mller |
| 2000 | STOC | More general completeness theorems for secure two-party computation. | Joe Kilian |
| 1999 | EuroCrypt | On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. | Ivan Damgrd, Joe Kilian, Louis Salvail |
| 1999 | EuroCrypt | A Note on the Limits of Collusion-Resistant Watermarks. | Funda Ergn, Joe Kilian, Ravi Kumar |
| 1999 | EuroCrypt | On the Concurrent Composition of Zero-Knowledge Proofs. | Ransom Richardson, Joe Kilian |
| 1998 | CRYPTO | Identity Escrow. | Joe Kilian, Erez Petrank |
| 1998 | FOCS | Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. | Uriel Feige, Joe Kilian |
| 1998 | FOCS | Lower Bounds for Zero Knowledge on the Internet. | Joe Kilian, Erez Petrank, Charles Rackoff |
| 1997 | STOC | Making Games Short (Extended Abstract). | Uriel Feige, Joe Kilian |
| 1997 | STOC | Probabilistically Checkable Proofs with Zero Knowledge. | Joe Kilian, Erez Petrank, Gbor Tardos |
| 1996 | CRYPTO | How to Protect DES Against Exhaustive Key Search. | Joe Kilian, Phillip Rogaway |
| 1996 | ICIP | Secure spread spectrum watermarking for images, audio and video. | Ingemar J. Cox, Joe Kilian, Tom Leighton, Talal Shamoon |
| 1995 | CRYPTO | Improved Efficient Arguments (Preliminary Version). | Joe Kilian |
| 1995 | CRYPTO | Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract). | Joe Kilian, Frank Thomson Leighton |
| 1995 | EuroCrypt | Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. | Kazue Sako, Joe Kilian |
| 1995 | STOC | Impossibility results for recycling random bits in two-prover proof systems. | Uriel Feige, Joe Kilian |
| 1994 | COLT | Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret. | Joe Kilian, Kevin J. Lang, Barak A. Pearlmutter |
| 1994 | CRYPTO | The Security of Cipher Block Chaining. | Mihir Bellare, Joe Kilian, Phillip Rogaway |
| 1994 | CRYPTO | Secure Voting Using Partially Compatible Homomorphisms. | Kazue Sako, Joe Kilian |
| 1994 | FOCS | On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs | Joe Kilian |
| 1994 | STOC | Two prover protocols: low error at affordable rates. | Uriel Feige, Joe Kilian |
| 1994 | STOC | A minimal model for secure computation (extended abstract). | Uriel Feige, Joe Kilian, Moni Naor |
| 1993 | COLT | On the Power of Sigmoid Neural Networks. | Joe Kilian, Hava T. Siegelmann |
| 1993 | CRYPTO | Discreet Solitary Games. | Claude Crpeau, Joe Kilian |
| 1992 | CRYPTO | Low Communication 2-Prover Zero-Knowledge Proofs for NP. | Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra |
| 1992 | STOC | A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract) | Joe Kilian |
| 1991 | CRYPTO | Interactive Proofs with Space Bounded Provers. | Joe Kilian, Ronitt Rubinfeld |
| 1991 | STOC | A General Completeness Theorem for Two-Party Games | Joe Kilian |
| 1990 | CRYPTO | Security with Low Communication Overhead. | Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway |
| 1990 | CRYPTO | Achieving Zero-Knowledge Robustly. | Joe Kilian |
| 1990 | CRYPTO | Interactive Proofs with Provable Security Against Honest Verifiers. | Joe Kilian |
| 1989 | CRYPTO | Efficient Identification Schemes Using Two Prover Interactive Proofs. | Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson |
| 1989 | CRYPTO | Minimum Resource Zero-Knowledge Proofs (Extended Abstract). | Joe Kilian, Silvio Micali, Rafail Ostrovsky |
| 1989 | FOCS | Minimum Resource Zero-Knowledge Proofs (Extended Abstract) | Joe Kilian, Silvio Micali, Rafail Ostrovsky |
| 1988 | CRYPTO | Everything Provable is Provable in Zero-Knowledge. | Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Hstad, Joe Kilian, Silvio Micali, Phillip Rogaway |
| 1988 | CRYPTO | Weakening Security Assumptions and Oblivious Transfer (Abstract). | Claude Crpeau, Joe Kilian |
| 1988 | FOCS | Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract) | Claude Crpeau, Joe Kilian |
| 1988 | FOCS | Zero-knowledge with Log-Space Verifiers | Joe Kilian |
| 1988 | STOC | Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions | Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson |
| 1988 | STOC | Founding Cryptography on Oblivious Transfer | Joe Kilian |
| 1987 | FOCS | The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract) | Joe Kilian, Shlomo Kipnis, Charles E. Leiserson |
| 1987 | STOC | On Hiding Information from an Oracle (Extended Abstract) | Martn Abadi, Joan Feigenbaum, Joe Kilian |
| 1986 | STOC | Almost All Primes Can Be Quickly Certified | Shafi Goldwasser, Joe Kilian |