Joe Kilian

Random Struct. Algorithms, 2016

2008

Fast Private Norm Estimation and Heavy Hitters.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Interactive Hashing: An Information Theoretic Tool (Invited Talk).

[BibT_eX]

[DOI]

George Savvides

Proceedings of the Information Theoretic Security, Third International Conference, 2008

A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting.

[BibT_eX]

[DOI]

Jason Keller

Proceedings of the Advances in Cryptology, 2008

2007

Communication vs. Computation.

[BibT_eX]

[DOI]

Comput. Complex., 2007

On covert collaboration.

[BibT_eX]

[DOI]

Arati Baliga

Proceedings of the 9th workshop on Multimedia & Security, 2007

A Web Based Covert File System.

[BibT_eX]

[DOI]

Arati Baliga

Liviu Iftode

Proceedings of HotOS'07: 11th Workshop on Hot Topics in Operating Systems, 2007

2005

Betting Boolean-style: a framework for trading in securities based on logical formulas.

[BibT_eX]

[DOI]

Decis. Support Syst., 2005

Lower Bounds For Concurrent Zero Knowledge*.

[BibT_eX]

[DOI]

Charles Rackoff

Comb., 2005

On Robust Combiners for Oblivious Transfer and Other Primitives.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

The Bloomier filter: an efficient data structure for static support lookup tables.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Communication Versus Computation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

A sublinear algorithm for weakly approximating edit distance.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Zero-Knowledge Sets.

[BibT_eX]

[DOI]

Silvio Micali

Michael O. Rabin

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Extending Oblivious Transfers Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

2002

Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Guest Editor's Foreword.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

2001

How to Protect DES Against Exhaustive Key Search (an Analysis of DESX).

[BibT_eX]

[DOI]

J. Cryptol., 2001

Heuristics for Semirandom Graph Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

On Concurrent and Resettable Zero-Knowledge Proofs for NP

[BibT_eX]

[DOI]

Ransom Richardson

CoRR, 2001

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Responsive Round Complexity and Concurrent Zero-Knowledge.

[BibT_eX]

[DOI]

Tzafrir Cohen

Proceedings of the Advances in Cryptology, 2001

2000

Reducibility and Completeness in Private Computations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Two-Prover Protocols - Low Error at Affordable Rates.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

The Security of the Cipher Block Chaining Message Authentication Code.

[BibT_eX]

[DOI]

Mihir Bellare

J. Comput. Syst. Sci., 2000

Finding OR in a noisy broadcast network.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Concurrent Zero-Knowledge in Poly-logarithmic Rounds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2000

More general completeness theorems for secure two-party computation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

One-Round Secure Computation and Secure Autonomous Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Primality Testing Using Elliptic Curves.

[BibT_eX]

[DOI]

Shafi Goldwasser

J. ACM, 1999

On the Concurrent Composition of Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Ransom Richardson

Proceedings of the Advances in Cryptology, 1999

A Note on the Limits of Collusion-Resistant Watermarks.

[BibT_eX]

[DOI]

Funda Ergün

Ravi Kumar

Proceedings of the Advances in Cryptology, 1999

On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions.

[BibT_eX]

[DOI]

Ivan Damgård

Louis Salvail

Proceedings of the Advances in Cryptology, 1999

1998

An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions.

[BibT_eX]

[DOI]

J. Cryptol., 1998

Zero Knowledge and the Chromatic Number.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

Lower Bounds for Zero Knowledge on the Internet.

[BibT_eX]

[DOI]

Charles Rackoff

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.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Secure spread spectrum watermarking for multimedia.

[BibT_eX]

[DOI]

Ingemar J. Cox

Frank Thomson Leighton

Talal Shamoon

IEEE Trans. Image Process., 1997

Locally Random Reductions: Improvements and Applications.

[BibT_eX]

[DOI]

J. Cryptol., 1997

Identity Escrow.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1997

On Limited versus Polynomial Nondeterminism.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 1997

Probabilistically Checkable Proofs with Zero Knowledge.

[BibT_eX]

[DOI]

Gábor Tardos

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Making Games Short (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

The Dynamic Universality of Sigmoidal Neural Networks.

[BibT_eX]

[DOI]

Hava T. Siegelmann

Inf. Comput., 1996

A Secure, Robust Watermark for Multimedia.

[BibT_eX]

[DOI]

Ingemar J. Cox

Frank Thomson Leighton

Talal Shamoon

Proceedings of the Information Hiding, First International Workshop, Cambridge, UK, May 30, 1996

Secure spread spectrum watermarking for images, audio and video.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996

How to Protect DES Against Exhaustive Key Search.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1996

1995

An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

Impossibility results for recycling random bits in two-prover proof systems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On the Complexity of Statistical Reasoning (extended abtract).

[BibT_eX]

[DOI]

Moni Naor

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

On the Role of Shared Randomness in Two Prover Proof Systems.

[BibT_eX]

[DOI]

Mihir Bellare

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.

[BibT_eX]

[DOI]

Kazue Sako

Proceedings of the Advances in Cryptology, 1995

Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract).

[BibT_eX]

[DOI]

Frank Thomson Leighton

Proceedings of the Advances in Cryptology, 1995

Improved Efficient Arguments (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1995

1994

A minimal model for secure computation (extended abstract).

[BibT_eX]

[DOI]

Moni Naor

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Secure Voting Using Partially Compatible Homomorphisms.

[BibT_eX]

[DOI]

Kazue Sako

Proceedings of the Advances in Cryptology, 1994

The Security of Cipher Block Chaining.

[BibT_eX]

[DOI]

Mihir Bellare

Proceedings of the Advances in Cryptology, 1994

Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret.

[BibT_eX]

[DOI]

Kevin J. Lang

Barak A. Pearlmutter

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993

Discreet Solitary Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1993

On the Power of Sigmoid Neural Networks.

[BibT_eX]

[DOI]

Hava T. Siegelmann

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992

A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Low Communication 2-Prover Zero-Knowledge Proofs for NP.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

1991

A General Completeness Theorem for Two-Party Games

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Interactive Proofs with Space Bounded Provers.

[BibT_eX]

[DOI]

Ronitt Rubinfeld

Proceedings of the Advances in Cryptology, 1991

1990

The Organization of Permutation Architectures with Bused Interconnections.

[BibT_eX]

[DOI]

Shlomo Kipnis

Charles E. Leiserson

IEEE Trans. Computers, 1990

Interactive Proofs with Provable Security Against Honest Verifiers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1990

Achieving Zero-Knowledge Robustly.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1990

Security with Low Communication Overhead.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1990

Uses of randomness in algorithms and protocols.

[BibT_eX]

MIT Press, ISBN: 978-0-262-11153-9, 1990

1989

On Hiding Information from an Oracle.

[BibT_eX]

[DOI]

Martín Abadi

Joan Feigenbaum

J. Comput. Syst. Sci., 1989

Minimum Resource Zero-Knowledge Proofs (Extended Abstract).

[BibT_eX]

[DOI]

Silvio Micali

Rafail Ostrovsky

Proceedings of the Advances in Cryptology, 1989

Efficient Identification Schemes Using Two Prover Interactive Proofs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

1988

Founding Cryptography on Oblivious Transfer

[BibT_eX]

[DOI]

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions

[BibT_eX]

[DOI]

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Zero-knowledge with Log-Space Verifiers

[BibT_eX]

[DOI]

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Weakening Security Assumptions and Oblivious Transfer (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1988

Everything Provable is Provable in Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1988

1987

On Hiding Information from an Oracle (Extended Abstract)

[BibT_eX]

[DOI]

Martín Abadi

Joan Feigenbaum

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract)

[BibT_eX]

[DOI]

Shlomo Kipnis

Charles E. Leiserson

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Almost All Primes Can Be Quickly Certified

[BibT_eX]

[DOI]

Shafi Goldwasser