Joe Kilian

Publication Activity (10 Years)

Years Active: 1986-2016
Publications (10 Years): 1

Top Topics

Maximum Likelihood

Evolutionary Algorithm

Top Venues

Random Struct. Algorithms

Publications

Richard Arratia, Skip Garibaldi, Joe Kilian
Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process. Random Struct. Algorithms 48 (3) (2016)
Jason Keller, Joe Kilian
A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting. ASIACRYPT (2008)
Claude Crépeau, Joe Kilian, George Savvides
Interactive Hashing: An Information Theoretic Tool (Invited Talk). ICITS (2008)
Joe Kilian, André Madeira, Martin J. Strauss, Xuan Zheng
Fast Private Norm Estimation and Heavy Hitters. TCC (2008)
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
Communication vs. Computation. Comput. Complex. 16 (1) (2007)
Arati Baliga, Joe Kilian, Liviu Iftode
A Web Based Covert File System. HotOS (2007)
Arati Baliga, Joe Kilian
On covert collaboration. MM&Sec (2007)
Joe Kilian, Charles Rackoff, Erez Petrank
Lower Bounds For Concurrent Zero Knowledge*. Comb. 25 (2) (2005)
Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman
Betting Boolean-style: a framework for trading in securities based on logical formulas. Decis. Support Syst. 39 (1) (2005)
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen
On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT (2005)
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal
The Bloomier filter: an efficient data structure for static support lookup tables. SODA (2004)
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
Communication Versus Computation. ICALP (2004)
Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman
Betting boolean-style: a framework for trading in securities based on logical formulas. EC (2003)
Silvio Micali, Michael O. Rabin, Joe Kilian
Zero-Knowledge Sets. FOCS (2003)
Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami
A sublinear algorithm for weakly approximating edit distance. STOC (2003)
Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank
Extending Oblivious Transfers Efficiently. CRYPTO (2003)
Lenore Cowen, Ronald Fagin, Joe Kilian, Jon M. Kleinberg
Guest Editor's Foreword. J. Comput. Syst. Sci. 65 (1) (2002)
Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. SIAM J. Comput. 32 (1) (2002)
Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC (2001)
Joe Kilian, Phillip Rogaway
How to Protect DES Against Exhaustive Key Search (an Analysis of DESX). J. Cryptol. 14 (1) (2001)
Joe Kilian, Erez Petrank, Ransom Richardson
On Concurrent and Resettable Zero-Knowledge Proofs for NP CoRR (2001)
Uriel Feige, Joe Kilian
Heuristics for Semirandom Graph Problems. J. Comput. Syst. Sci. 63 (4) (2001)
Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds Electron. Colloquium Comput. Complex. 8 (50) (2001)
Joe Kilian, Erez Petrank, Charles Rackoff
Lower Bounds for Zero-knowledge on the Internet CoRR (2001)
Tzafrir Cohen, Joe Kilian, Erez Petrank
Responsive Round Complexity and Concurrent Zero-Knowledge. ASIACRYPT (2001)
Joe Kilian, Erez Petrank
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. STOC (2001)
Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. IACR Cryptol. ePrint Arch. 2001 (2001)
Mihir Bellare, Joe Kilian, Phillip Rogaway
The Security of the Cipher Block Chaining Message Authentication Code. J. Comput. Syst. Sci. 61 (3) (2000)
Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky
Reducibility and Completeness in Private Computations. SIAM J. Comput. 29 (4) (2000)
Joe Kilian, Erez Petrank
Concurrent Zero-Knowledge in Poly-logarithmic Rounds. IACR Cryptol. ePrint Arch. 2000 (2000)
Uriel Feige, Joe Kilian
Two-Prover Protocols - Low Error at Affordable Rates. SIAM J. Comput. 30 (1) (2000)
Uriel Feige, Joe Kilian
Finding OR in a noisy broadcast network. Inf. Process. Lett. 73 (1-2) (2000)
Joe Kilian
More general completeness theorems for secure two-party computation. STOC (2000)
Christian Cachin, Jan Camenisch, Joe Kilian, Joy Müller
One-Round Secure Computation and Secure Autonomous Mobile Agents. ICALP (2000)
Ransom Richardson, Joe Kilian
On the Concurrent Composition of Zero-Knowledge Proofs. EUROCRYPT (1999)
Shafi Goldwasser, Joe Kilian
Primality Testing Using Elliptic Curves. J. ACM 46 (4) (1999)
Funda Ergün, Joe Kilian, Ravi Kumar
A Note on the Limits of Collusion-Resistant Watermarks. EUROCRYPT (1999)
Ivan Damgård, Joe Kilian, Louis Salvail
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. EUROCRYPT (1999)
Joe Kilian, Erez Petrank
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. J. Cryptol. 11 (1) (1998)
Joe Kilian, Erez Petrank, Charles Rackoff
Lower Bounds for Zero Knowledge on the Internet. FOCS (1998)
Uriel Feige, Joe Kilian
Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. FOCS (1998)
Joe Kilian, Erez Petrank
Identity Escrow. CRYPTO (1998)
Uriel Feige, Joe Kilian
Zero Knowledge and the Chromatic Number. J. Comput. Syst. Sci. 57 (2) (1998)
Uriel Feige, Joe Kilian
Making Games Short (Extended Abstract). STOC (1997)
Ingemar J. Cox, Joe Kilian, Frank Thomson Leighton, Talal Shamoon
Secure spread spectrum watermarking for multimedia. IEEE Trans. Image Process. 6 (12) (1997)
Joe Kilian, Erez Petrank, Gábor Tardos
Probabilistically Checkable Proofs with Zero Knowledge. STOC (1997)
Joe Kilian, Erez Petrank
Identity Escrow. IACR Cryptol. ePrint Arch. 1997 (1997)
Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway
Locally Random Reductions: Improvements and Applications. J. Cryptol. 10 (1) (1997)
Uriel Feige, Joe Kilian
On Limited versus Polynomial Nondeterminism. Chic. J. Theor. Comput. Sci. 1997 (1997)
Joe Kilian, Hava T. Siegelmann
The Dynamic Universality of Sigmoidal Neural Networks. Inf. Comput. 128 (1) (1996)
Uriel Feige, Joe Kilian
Zero Knowledge and the Chromatic Number. Computational Complexity Conference (1996)
Joe Kilian, Phillip Rogaway
How to Protect DES Against Exhaustive Key Search. CRYPTO (1996)
Ingemar J. Cox, Joe Kilian, Tom Leighton, Talal Shamoon
Secure spread spectrum watermarking for images, audio and video. ICIP (3) (1996)
Ingemar J. Cox, Joe Kilian, Frank Thomson Leighton, Talal Shamoon
A Secure, Robust Watermark for Multimedia. Information Hiding (1996)
Uriel Feige, Joe Kilian
Impossibility results for recycling random bits in two-prover proof systems. STOC (1995)
Mihir Bellare, Uriel Feige, Joe Kilian
On the Role of Shared Randomness in Two Prover Proof Systems. ISTCS (1995)
Joe Kilian
Improved Efficient Arguments (Preliminary Version). CRYPTO (1995)
Kazue Sako, Joe Kilian
Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. EUROCRYPT (1995)
Joe Kilian, Moni Naor
On the Complexity of Statistical Reasoning (extended abtract). ISTCS (1995)
Joe Kilian, Erez Petrank
An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions Electron. Colloquium Comput. Complex. 2 (38) (1995)
Joe Kilian, Frank Thomson Leighton
Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract). CRYPTO (1995)
Kazue Sako, Joe Kilian
Secure Voting Using Partially Compatible Homomorphisms. CRYPTO (1994)
Uriel Feige, Joe Kilian
Two prover protocols: low error at affordable rates. STOC (1994)
Joe Kilian
On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs FOCS (1994)
Uriel Feige, Joe Kilian, Moni Naor
A minimal model for secure computation (extended abstract). STOC (1994)
Joe Kilian, Kevin J. Lang, Barak A. Pearlmutter
Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret. COLT (1994)
Mihir Bellare, Joe Kilian, Phillip Rogaway
The Security of Cipher Block Chaining. CRYPTO (1994)
Claude Crépeau, Joe Kilian
Discreet Solitary Games. CRYPTO (1993)
Joe Kilian, Hava T. Siegelmann
On the Power of Sigmoid Neural Networks. COLT (1993)
Joe Kilian
A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract) STOC (1992)
Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra
Low Communication 2-Prover Zero-Knowledge Proofs for NP. CRYPTO (1992)
Joe Kilian, Ronitt Rubinfeld
Interactive Proofs with Space Bounded Provers. CRYPTO (1991)
Joe Kilian
A General Completeness Theorem for Two-Party Games STOC (1991)
Donald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway
Security with Low Communication Overhead. CRYPTO (1990)
Joe Kilian
Achieving Zero-Knowledge Robustly. CRYPTO (1990)
Joe Kilian
Interactive Proofs with Provable Security Against Honest Verifiers. CRYPTO (1990)
Joe Kilian, Shlomo Kipnis, Charles E. Leiserson
The Organization of Permutation Architectures with Bused Interconnections. IEEE Trans. Computers 39 (11) (1990)
Joe Kilian, Silvio Micali, Rafail Ostrovsky
Minimum Resource Zero-Knowledge Proofs (Extended Abstract) FOCS (1989)
Martín Abadi, Joan Feigenbaum, Joe Kilian
On Hiding Information from an Oracle. J. Comput. Syst. Sci. 39 (1) (1989)
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson
Efficient Identification Schemes Using Two Prover Interactive Proofs. CRYPTO (1989)
Joe Kilian, Silvio Micali, Rafail Ostrovsky
Minimum Resource Zero-Knowledge Proofs (Extended Abstract). CRYPTO (1989)
Claude Crépeau, Joe Kilian
Weakening Security Assumptions and Oblivious Transfer (Abstract). CRYPTO (1988)
Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali, Phillip Rogaway
Everything Provable is Provable in Zero-Knowledge. CRYPTO (1988)
Joe Kilian
Zero-knowledge with Log-Space Verifiers FOCS (1988)
Joe Kilian
Founding Cryptography on Oblivious Transfer STOC (1988)
Claude Crépeau, Joe Kilian
Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract) FOCS (1988)
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson
Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions STOC (1988)
Joe Kilian, Shlomo Kipnis, Charles E. Leiserson
The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract) FOCS (1987)
Martín Abadi, Joan Feigenbaum, Joe Kilian
On Hiding Information from an Oracle (Extended Abstract) STOC (1987)
Martín Abadi, Joan Feigenbaum, Joe Kilian
On hiding information from an oracle. Computational Complexity Conference (1987)
Shafi Goldwasser, Joe Kilian
Almost All Primes Can Be Quickly Certified STOC (1986)