Almost All Primes Can Be Quickly Certified - Shafi Goldwasser; Joe Kilian (STOC, 1986)

The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract) - Joe Kilian; Shlomo Kipnis; Charles E. Leiserson (FOCS, 1987)

On Hiding Information from an Oracle (Extended Abstract) - Martín Abadi; Joan Feigenbaum; Joe Kilian (STOC, 1987)

Everything Provable is Provable in Zero-Knowledge. - Michael Ben-Or; Oded Goldreich 001; Shafi Goldwasser; Johan Håstad; Joe Kilian; Silvio Micali; Phillip Rogaway (CRYPTO, 1988)

Weakening Security Assumptions and Oblivious Transfer (Abstract). - Claude Crépeau; Joe Kilian (CRYPTO, 1988)

Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract) - Claude Crépeau; Joe Kilian (FOCS, 1988)

Zero-knowledge with Log-Space Verifiers - Joe Kilian (FOCS, 1988)

Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions - Michael Ben-Or; Shafi Goldwasser; Joe Kilian; Avi Wigderson (STOC, 1988)

Founding Cryptography on Oblivious Transfer - Joe Kilian (STOC, 1988)

Efficient Identification Schemes Using Two Prover Interactive Proofs. - Michael Ben-Or; Shafi Goldwasser; Joe Kilian; Avi Wigderson (CRYPTO, 1989)

Minimum Resource Zero-Knowledge Proofs (Extended Abstract). - Joe Kilian; Silvio Micali; Rafail Ostrovsky (CRYPTO, 1989)

On Hiding Information from an Oracle. - Martín Abadi; Joan Feigenbaum; Joe Kilian (J. Comput. Syst. Sci., 1989)

Uses of randomness in algorithms and protocols. - Joe Kilian (MIT Press, 1990)

Security with Low Communication Overhead. - Donald Beaver; Joan Feigenbaum; Joe Kilian; Phillip Rogaway (CRYPTO, 1990)

Achieving Zero-Knowledge Robustly. - Joe Kilian (CRYPTO, 1990)

Interactive Proofs with Provable Security Against Honest Verifiers. - Joe Kilian (CRYPTO, 1990)

The Organization of Permutation Architectures with Bused Interconnections. - Joe Kilian; Shlomo Kipnis; Charles E. Leiserson (IEEE Trans. Computers, 1990)

Interactive Proofs with Space Bounded Provers. - Joe Kilian; Ronitt Rubinfeld (CRYPTO, 1991)

A General Completeness Theorem for Two-Party Games - Joe Kilian (STOC, 1991)

Low Communication 2-Prover Zero-Knowledge Proofs for NP. - Cynthia Dwork; Uriel Feige; Joe Kilian; Moni Naor; Shmuel Safra (CRYPTO, 1992)

A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract) - Joe Kilian (STOC, 1992)

On the Power of Sigmoid Neural Networks. - Joe Kilian; Hava T. Siegelmann (COLT, 1993)

Discreet Solitary Games. - Claude Crépeau; Joe Kilian (CRYPTO, 1993)

Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret. - Joe Kilian; Kevin J. Lang; Barak A. Pearlmutter (COLT, 1994)

The Security of Cipher Block Chaining. - Mihir Bellare; Joe Kilian; Phillip Rogaway (CRYPTO, 1994)

Secure Voting Using Partially Compatible Homomorphisms. - Kazue Sako; Joe Kilian (CRYPTO, 1994)

On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs - Joe Kilian (FOCS, 1994)

A minimal model for secure computation (extended abstract). - Uriel Feige; Joe Kilian; Moni Naor (STOC, 1994)

Improved Efficient Arguments (Preliminary Version). - Joe Kilian (CRYPTO, 1995)

Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract). - Joe Kilian; Frank Thomson Leighton (CRYPTO, 1995)

Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. - Kazue Sako; Joe Kilian (EUROCRYPT, 1995)

On the Role of Shared Randomness in Two Prover Proof Systems. - Mihir Bellare; Uriel Feige; Joe Kilian (ISTCS, 1995)

On the Complexity of Statistical Reasoning (extended abtract). - Joe Kilian; Moni Naor (ISTCS, 1995)

Impossibility results for recycling random bits in two-prover proof systems. - Uriel Feige; Joe Kilian (STOC, 1995)

An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions - Joe Kilian; Erez Petrank (Electron. Colloquium Comput. Complex., 1995)

How to Protect DES Against Exhaustive Key Search. - Joe Kilian; Phillip Rogaway (CRYPTO, 1996)

Secure spread spectrum watermarking for images, audio and video. - Ingemar J. Cox; Joe Kilian; Tom Leighton; Talal Shamoon (ICIP (3), 1996)

A Secure, Robust Watermark for Multimedia. - Ingemar J. Cox; Joe Kilian; Frank Thomson Leighton; Talal Shamoon (Information Hiding, 1996)

The Dynamic Universality of Sigmoidal Neural Networks. - Joe Kilian; Hava T. Siegelmann (Inf. Comput., 1996)

Making Games Short (Extended Abstract). - Uriel Feige; Joe Kilian (STOC, 1997)

Probabilistically Checkable Proofs with Zero Knowledge. - Joe Kilian; Erez Petrank; Gábor Tardos (STOC, 1997)

On Limited versus Polynomial Nondeterminism. - Uriel Feige; Joe Kilian (Chic. J. Theor. Comput. Sci., 1997)

Identity Escrow. - Joe Kilian; Erez Petrank (IACR Cryptol. ePrint Arch., 1997)

Locally Random Reductions: Improvements and Applications. - Donald Beaver; Joan Feigenbaum; Joe Kilian; Phillip Rogaway (J. Cryptol., 1997)

Secure spread spectrum watermarking for multimedia. - Ingemar J. Cox; Joe Kilian; Frank Thomson Leighton; Talal Shamoon (IEEE Trans. Image Process., 1997)

Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. - Uriel Feige; Joe Kilian (FOCS, 1998)

Lower Bounds for Zero Knowledge on the Internet. - Joe Kilian; Erez Petrank; Charles Rackoff (FOCS, 1998)

Zero Knowledge and the Chromatic Number. - Uriel Feige; Joe Kilian (J. Comput. Syst. Sci., 1998)

An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. - Joe Kilian; Erez Petrank (J. Cryptol., 1998)

On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. - Ivan Damgård; Joe Kilian; Louis Salvail (EUROCRYPT, 1999)

A Note on the Limits of Collusion-Resistant Watermarks. - Funda Ergün; Joe Kilian; Ravi Kumar 001 (EUROCRYPT, 1999)

On the Concurrent Composition of Zero-Knowledge Proofs. - Ransom Richardson; Joe Kilian (EUROCRYPT, 1999)

Primality Testing Using Elliptic Curves. - Shafi Goldwasser; Joe Kilian (J. ACM, 1999)

One-Round Secure Computation and Secure Autonomous Mobile Agents. - Christian Cachin; Jan Camenisch; Joe Kilian; Joy Müller (ICALP, 2000)

More general completeness theorems for secure two-party computation. - Joe Kilian (STOC, 2000)

Concurrent Zero-Knowledge in Poly-logarithmic Rounds. - Joe Kilian; Erez Petrank (IACR Cryptol. ePrint Arch., 2000)

Finding OR in a noisy broadcast network. - Uriel Feige; Joe Kilian (Inf. Process. Lett., 2000)

The Security of the Cipher Block Chaining Message Authentication Code. - Mihir Bellare; Joe Kilian; Phillip Rogaway (J. Comput. Syst. Sci., 2000)

Two-Prover Protocols - Low Error at Affordable Rates. - Uriel Feige; Joe Kilian (SIAM J. Comput., 2000)

Reducibility and Completeness in Private Computations. - Joe Kilian; Eyal Kushilevitz; Silvio Micali; Rafail Ostrovsky (SIAM J. Comput., 2000)

Responsive Round Complexity and Concurrent Zero-Knowledge. - Tzafrir Cohen; Joe Kilian; Erez Petrank (ASIACRYPT, 2001)

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. - Joe Kilian; Erez Petrank (STOC, 2001)

On Concurrent and Resettable Zero-Knowledge Proofs for NP - Joe Kilian; Erez Petrank; Ransom Richardson (CoRR, 2001)

Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds - Ran Canetti; Joe Kilian; Erez Petrank; Alon Rosen (Electron. Colloquium Comput. Complex., 2001)

Heuristics for Semirandom Graph Problems. - Uriel Feige; Joe Kilian (J. Comput. Syst. Sci., 2001)

How to Protect DES Against Exhaustive Key Search (an Analysis of DESX). - Joe Kilian; Phillip Rogaway (J. Cryptol., 2001)

Guest Editor's Foreword. - Lenore Cowen; Ronald Fagin; Joe Kilian; Jon M. Kleinberg (J. Comput. Syst. Sci., 2002)

Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. - Ran Canetti; Joe Kilian; Erez Petrank; Alon Rosen (SIAM J. Comput., 2002)

Extending Oblivious Transfers Efficiently. - Yuval Ishai; Joe Kilian; Kobbi Nissim; Erez Petrank (CRYPTO, 2003)

Zero-Knowledge Sets. - Silvio Micali; Michael O. Rabin; Joe Kilian (FOCS, 2003)

A sublinear algorithm for weakly approximating edit distance. - Tugkan Batu; Funda Ergün; Joe Kilian; Avner Magen; Sofya Raskhodnikova; Ronitt Rubinfeld; Rahul Sami (STOC, 2003)

Communication Versus Computation. - Prahladh Harsha; Yuval Ishai; Joe Kilian; Kobbi Nissim; Srinivasan Venkatesh 001 (ICALP, 2004)

The Bloomier filter: an efficient data structure for static support lookup tables. - Bernard Chazelle; Joe Kilian; Ronitt Rubinfeld; Ayellet Tal (SODA, 2004)

On Robust Combiners for Oblivious Transfer and Other Primitives. - Danny Harnik; Joe Kilian; Moni Naor; Omer Reingold; Alon Rosen (EUROCRYPT, 2005)

Lower Bounds For Concurrent Zero Knowledge*. - Joe Kilian; Charles Rackoff; Erez Petrank (Comb., 2005)

Betting Boolean-style: a framework for trading in securities based on logical formulas. - Lance Fortnow; Joe Kilian; David M. Pennock; Michael P. Wellman (Decis. Support Syst., 2005)

A Web Based Covert File System. - Arati Baliga; Joe Kilian; Liviu Iftode (HotOS, 2007)

On covert collaboration. - Arati Baliga; Joe Kilian (MM&Sec, 2007)

Communication vs. Computation. - Prahladh Harsha; Yuval Ishai; Joe Kilian; Kobbi Nissim; Srinivasan Venkatesh 001 (Comput. Complex., 2007)

A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting. - Jason Keller; Joe Kilian (ASIACRYPT, 2008)

Interactive Hashing: An Information Theoretic Tool (Invited Talk). - Claude Crépeau; Joe Kilian; George Savvides (ICITS, 2008)

Fast Private Norm Estimation and Heavy Hitters. - Joe Kilian; André Madeira; Martin J. Strauss; Xuan Zheng (TCC, 2008)

Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process. - Richard Arratia; Skip Garibaldi; Joe Kilian (Random Struct. Algorithms, 2016)

Multi-prover interactive proofs: how to remove intractability assumptions. - Michael Ben-Or; Shafi Goldwasser; Joe Kilian; Avi Wigderson (Providing Sound Foundations for Cryptography, 2019)