Joe Kilian

According to our database1, Joe Kilian authored at least 86 papers between 1986 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process.
Random Struct. Algorithms, 2016

2008
Fast Private Norm Estimation and Heavy Hitters.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Interactive Hashing: An Information Theoretic Tool (Invited Talk).
Proceedings of the Information Theoretic Security, Third International Conference, 2008

A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting.
Proceedings of the Advances in Cryptology, 2008

2007
Communication vs. Computation.
Computational Complexity, 2007

On covert collaboration.
Proceedings of the 9th workshop on Multimedia & Security, 2007

A Web Based Covert File System.
Proceedings of HotOS'07: 11th Workshop on Hot Topics in Operating Systems, 2007

2005
Lower Bounds For Concurrent Zero Knowledge*.
Combinatorica, 2005

On Robust Combiners for Oblivious Transfer and Other Primitives.
Proceedings of the Advances in Cryptology, 2005

2004
The Bloomier filter: an efficient data structure for static support lookup tables.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Communication Versus Computation.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
A sublinear algorithm for weakly approximating edit distance.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Betting boolean-style: a framework for trading in securities based on logical formulas.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Zero-Knowledge Sets.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Extending Oblivious Transfers Efficiently.
Proceedings of the Advances in Cryptology, 2003

2002
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.
SIAM J. Comput., 2002

Guest Editor's Foreword.
J. Comput. Syst. Sci., 2002

2001
How to Protect DES Against Exhaustive Key Search (an Analysis of DESX).
J. Cryptology, 2001

Heuristics for Semirandom Graph Problems.
J. Comput. Syst. Sci., 2001

Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds.
IACR Cryptology ePrint Archive, 2001

Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds
Electronic Colloquium on Computational Complexity (ECCC), 2001

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Black-box concurrent zero-knowledge requires Omega~(log n) rounds.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Responsive Round Complexity and Concurrent Zero-Knowledge.
Proceedings of the Advances in Cryptology, 2001

2000
Reducibility and Completeness in Private Computations.
SIAM J. Comput., 2000

Two-Prover Protocols - Low Error at Affordable Rates.
SIAM J. Comput., 2000

The Security of the Cipher Block Chaining Message Authentication Code.
J. Comput. Syst. Sci., 2000

Finding OR in a noisy broadcast network.
Inf. Process. Lett., 2000

Concurrent Zero-Knowledge in Poly-logarithmic Rounds.
IACR Cryptology ePrint Archive, 2000

More general completeness theorems for secure two-party computation.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

One-Round Secure Computation and Secure Autonomous Mobile Agents.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Primality Testing Using Elliptic Curves.
J. ACM, 1999

On the Concurrent Composition of Zero-Knowledge Proofs.
Proceedings of the Advances in Cryptology, 1999

A Note on the Limits of Collusion-Resistant Watermarks.
Proceedings of the Advances in Cryptology, 1999

On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions.
Proceedings of the Advances in Cryptology, 1999

1998
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions.
J. Cryptology, 1998

Lower Bounds for Zero Knowledge on the Internet.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Identity Escrow.
Proceedings of the Advances in Cryptology, 1998

1997
Secure spread spectrum watermarking for multimedia.
IEEE Trans. Image Processing, 1997

Locally Random Reductions: Improvements and Applications.
J. Cryptology, 1997

On Limited versus Polynomial Nondeterminism.
Chicago J. Theor. Comput. Sci., 1997

Probabilistically Checkable Proofs with Zero Knowledge.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Making Games Short (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
The Dynamic Universality of Sigmoidal Neural Networks.
Inf. Comput., 1996

A Secure, Robust Watermark for Multimedia.
Proceedings of the Information Hiding, First International Workshop, Cambridge, UK, May 30, 1996

Secure spread spectrum watermarking for images, audio and video.
Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996

How to Protect DES Against Exhaustive Key Search.
Proceedings of the Advances in Cryptology, 1996

Zero Knowledge and the Chromatic Number.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions
Electronic Colloquium on Computational Complexity (ECCC), 1995

Impossibility results for recycling random bits in two-prover proof systems.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On the Complexity of Statistical Reasoning (extended abtract).
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

On the Role of Shared Randomness in Two Prover Proof Systems.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth.
Proceedings of the Advances in Cryptology, 1995

Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract).
Proceedings of the Advances in Cryptology, 1995

Improved Efficient Arguments (Preliminary Version).
Proceedings of the Advances in Cryptology, 1995

1994
A minimal model for secure computation (extended abstract).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Two prover protocols: low error at affordable rates.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Secure Voting Using Partially Compatible Homomorphisms.
Proceedings of the Advances in Cryptology, 1994

The Security of Cipher Block Chaining.
Proceedings of the Advances in Cryptology, 1994

Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret.
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993
Discreet Solitary Games.
Proceedings of the Advances in Cryptology, 1993

On the Power of Sigmoid Neural Networks.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992
A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Low Communication 2-Prover Zero-Knowledge Proofs for NP.
Proceedings of the Advances in Cryptology, 1992

1991
A General Completeness Theorem for Two-Party Games
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Interactive Proofs with Space Bounded Provers.
Proceedings of the Advances in Cryptology, 1991

1990
The Organization of Permutation Architectures with Bused Interconnections.
IEEE Trans. Computers, 1990

Interactive Proofs with Provable Security Against Honest Verifiers.
Proceedings of the Advances in Cryptology, 1990

Achieving Zero-Knowledge Robustly.
Proceedings of the Advances in Cryptology, 1990

Security with Low Communication Overhead.
Proceedings of the Advances in Cryptology, 1990

Uses of randomness in algorithms and protocols.
MIT Press, ISBN: 978-0-262-11153-9, 1990

1989
Minimum Resource Zero-Knowledge Proofs (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Minimum Resource Zero-Knowledge Proofs (Extended Abstract).
Proceedings of the Advances in Cryptology, 1989

Efficient Identification Schemes Using Two Prover Interactive Proofs.
Proceedings of the Advances in Cryptology, 1989

1988
Founding Cryptography on Oblivious Transfer
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Zero-knowledge with Log-Space Verifiers
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Weakening Security Assumptions and Oblivious Transfer (Abstract).
Proceedings of the Advances in Cryptology, 1988

Everything Provable is Provable in Zero-Knowledge.
Proceedings of the Advances in Cryptology, 1988

1987
On Hiding Information from an Oracle (Extended Abstract)
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

On hiding information from an oracle.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986
Almost All Primes Can Be Quickly Certified
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986


  Loading...