Travelled to:1 × Finland
1 × Greece
1 × Switzerland
2 × Canada
8 × USA
Collaborated with:∅ U.Feige E.Petrank S.Goldwasser G.Tardos M.Naor M.Abadi J.Feigenbaum R.Canetti A.Rosen C.Cachin J.Camenisch J.Müller M.Ben-Or A.Wigderson P.Harsha Y.Ishai K.Nissim S.Venkatesh T.Batu F.Ergün A.Magen S.Raskhodnikova R.Rubinfeld R.Sami
Talks about:knowledg (4) comput (4) secur (4) proof (4) zero (4) two (4) prover (3) round (3) theorem (2) general (2)
Person: Joe Kilian
DBLP: Kilian:Joe
Contributed to:
2004
200320012000200019971995199419921991198819871986Wrote 17 papers:
- ICALP-2004-HarshaIKNV #communication
- Communication Versus Computation (PH, YI, JK, KN, SV), pp. 745–756.
- STOC-2003-BatuEKMRRS #algorithm #approximate #distance #edit distance #sublinear
- A sublinear algorithm for weakly approximating edit distance (TB, FE, JK, AM, SR, RR, RS), pp. 316–324.
- STOC-2001-CanettiKPR #black box #concurrent
- Black-box concurrent zero-knowledge requires Ω(log n) rounds (RC, JK, EP, AR), pp. 570–579.
- STOC-2001-KilianP #concurrent
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds (JK, EP), pp. 560–569.
- ICALP-2000-CachinCKM #mobile
- One-Round Secure Computation and Secure Autonomous Mobile Agents (CC, JC, JK, JM), pp. 512–523.
- STOC-2000-Kilian #theorem
- More general completeness theorems for secure two-party computation (JK), pp. 316–324.
- STOC-1997-FeigeK #game studies
- Making Games Short (UF, JK), pp. 506–516.
- STOC-1997-KilianPT #proving
- Probabilistically Checkable Proofs with Zero Knowledge (JK, EP, GT), pp. 496–505.
- STOC-1995-FeigeK #proving #random
- Impossibility results for recycling random bits in two-prover proof systems (UF, JK), pp. 457–468.
- STOC-1994-FeigeK #fault #protocol #proving
- Two prover protocols: low error at affordable rates (UF, JK), pp. 172–183.
- STOC-1994-FeigeKN
- A minimal model for secure computation (UF, JK, MN), pp. 554–563.
- STOC-1992-Kilian #performance #proving
- A Note on Efficient Zero-Knowledge Proofs and Arguments (JK), pp. 723–732.
- STOC-1991-Kilian #game studies #theorem
- A General Completeness Theorem for Two-Party Games (JK), pp. 553–560.
- STOC-1988-Ben-OrGKW #how #interactive #multi #proving
- Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions (MBO, SG, JK, AW), pp. 113–131.
- STOC-1988-Kilian #encryption
- Founding Cryptography on Oblivious Transfer (JK), pp. 20–31.
- STOC-1987-AbadiFK #on the
- On Hiding Information from an Oracle (MA, JF, JK), pp. 195–203.
- STOC-1986-GoldwasserK
- Almost All Primes Can Be Quickly Certified (SG, JK), pp. 316–329.