Joe Kilian

International Association for Cryptologic Research

Joe Kilian Search web for home page

Program Committees

1	2007	Eurocrypt	pc
2	2005	TCC	pc chair
3	2004	Eurocrypt	pc
4	2004	TCC	pc
5	2001	Crypto	pc chair
6	2000	Eurocrypt	pc
7	1992	Crypto	pc

Publications

	year	title	booktitle	pages
1	2008	Fast Private Norm Estimation and Heavy Hitters	tcc	176-193
2	2008	A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting	asiacrypt	198-215
3	2005	On Robust Combiners for Oblivious Transfer and Other Primitives	eurocrypt	online
4	2003	Extending Oblivious Transfers Efficiently	crypto	online
5	2001	How to Protect DES Against Exhaustive Key Search (an Analysis of DESX)	jofc	17-35
6	2001	Responsive Round Complexity and Concurrent Zero-Knowledge	asiacrypt	422-441
7	2001	Black-Box Concurrent Zero-Knowledge Requires $\tilde\Omega(\log n)$ Rounds	eprint	online
8	2000	Concurrent Zero-Knowledge in Poly-logarithmic Rounds	eprint	online
9	1999	A Note on the Limits of Collusion-Resistant Watermarks	eurocrypt	140-149
10	1999	On the Concurrent Composition of Zero-Knowledge Proofs	eurocrypt	415-431
11	1999	On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions	eurocrypt	56-73
12	1998	An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions	jofc	1-27
13	1998	Identity Escrow	crypto	169-185
14	1997	Identity Escrow	eprint	online
15	1997	Locally Random Reductions: Improvements and Applications	jofc	17-36
16	1996	How to Protect DES Against Exhaustive Key Search	crypto	252-267
17	1995	Improved Efficient Arguments (Preliminary Version)	crypto	311-324
18	1995	Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract)	crypto	208-221
19	1995	Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth	eurocrypt	393-403
20	1994	The Security of Cipher Block Chaining	crypto	341-358
21	1994	Secure Voting Using Partially Compatible Homomorphisms	crypto	411-424
22	1993	Discreet Solitary Games	crypto	319-330
23	1992	Low Communication 2-Prover Zero-Knowledge Proofs for NP	crypto	215-227
24	1991	Interactive Proofs with Space Bounded Provers	crypto	225-231
25	1990	Achieving Zero-Knowledge Robustly	crypto	313-325
26	1990	Interactive Proofs with Provable Security Against Honest Verifiers	crypto	378-392
27	1990	Security with Low Communication Overhead	crypto	62-76
28	1989	Minimum Resource Zero-Knowledge Proofs (Extended Abstract)	crypto	545-546
29	1989	Efficient Identification Schemes Using Two Prover Interactive Proofs	crypto	498-506
30	1988	Weakening Security Assumptions and Oblivious Transfer (Abstract)	crypto	2-7
31	1988	Everything Provable is Provable in Zero-Knowledge	crypto	37-56

Joe Kilian Search web for home page

Program Committees

Publications

Coauthors of Joe Kilian