Joe Kilian - RankMe

95 papers A* 52A 4B 2Journal 28Unranked 7

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