Abhi Shelat

J. Comput. Secur., 2013

Fast Two-Party Secure Computation with Minimal Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

PCF: A Portable Circuit Format for Scalable Two-Party Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the 22th USENIX Security Symposium, Washington, DC, USA, August 14-16, 2013, 2013

Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Algorithms for Compressed Inputs.

[BibT_eX]

[DOI]

Nathan Brunelle

Gabriel Robins

Proceedings of the 2013 Data Compression Conference, 2013

Lessons learned with PCF: scaling secure computation.

[BibT_eX]

[DOI]

Benjamin Kreuter

Proceedings of the PETShop'13, 2013

GPU and CPU parallelization of honest-but-curious secure two-party computation.

[BibT_eX]

[DOI]

Proceedings of the Annual Computer Security Applications Conference, 2013

2012

Towards Billion-Gate Secure Computation with Malicious Adversaries.

[BibT_eX]

[DOI]

Benjamin Kreuter

IACR Cryptol. ePrint Arch., 2012

Billion-Gate Secure Computation with Malicious Adversaries.

[BibT_eX]

[DOI]

Benjamin Kreuter

Proceedings of the 21th USENIX Security Symposium, Bellevue, WA, USA, August 8-10, 2012, 2012

Blackbox Construction of a More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

2011

Securely Obfuscating Re-Encryption.

[BibT_eX]

[DOI]

J. Cryptol., 2011

Two-Output Secure Computation with Malicious Adversaries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Threshold Fully Homomorphic Encryption and Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Renegotiation-Safe Protocols.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

Efficient Secure Computation with Garbled Circuits.

[BibT_eX]

[DOI]

Proceedings of the Information Systems Security - 7th International Conference, 2011

2010

Collusion-free protocols.

[BibT_eX]

[DOI]

Proceedings of the Behavioral and Quantitative Game Theory, 2010

Optimistic Concurrent Zero Knowledge.

[BibT_eX]

[DOI]

Alon Rosen

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Additive Combinatorics and Discrete Logarithm Based Range Protocols.

[BibT_eX]

[DOI]

Rafik Chaabouni

Helger Lipmaa

IACR Cryptol. ePrint Arch., 2009

Purely Rational Secret Sharing (Extended Abstract).

[BibT_eX]

[DOI]

Silvio Micali

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Bit Encryption Is Complete.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Collusion-Free Multiparty Computation in the Mediated Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Simulatable Adaptive Oblivious Transfer.

[BibT_eX]

[DOI]

Jan Camenisch

Gregory Neven

IACR Cryptol. ePrint Arch., 2008

Collusion-Free Protocols in the Mediated Model.

[BibT_eX]

[DOI]

Joël Alwen

Ivan Visconti

Proceedings of the Advances in Cryptology, 2008

Efficient Protocols for Set Membership and Range Proofs.

[BibT_eX]

[DOI]

Jan Camenisch

Rafik Chaabouni

Proceedings of the Advances in Cryptology, 2008

2007

Efficient fork-linearizable access to untrusted shared memory.

[BibT_eX]

[DOI]

Christian Cachin

Alexander Shraer

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Cryptography from Sunspots: How to Use an Imperfect Reference String.

[BibT_eX]

[DOI]

Ran Canetti

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Relations Among Notions of Non-malleability for Encryption.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology, 2007

Bounded CCA2-Secure Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Securing user inputs for the web.

[BibT_eX]

[DOI]

Proceedings of the 2006 Workshop on Digital Identity Management, 2006

Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology, 2006

2005

Études in non-interactive zero-knowledge.

[BibT_eX]

[DOI]

PhD thesis, 2005

The smallest grammar problem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Fair-Zero Knowledge.

[BibT_eX]

[DOI]

Matt Lepinski

Silvio Micali

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Collusion-free protocols.

[BibT_eX]

[DOI]

Matt Lepinski

Silvio Micali

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Privacy and identity management for everyone.

[BibT_eX]

[DOI]

Jan Camenisch

Dieter Sommer

Simone Fischer-Hübner

Proceedings of the 2005 Workshop on Digital Identity Management, 2005

Unconditional Characterizations of Non-interactive Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Completely fair SFE and coalition-safe cheap talk.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Searching for Stable Mechanisms: Automated Design for Imperfect Players.

[BibT_eX]

[DOI]

Andrew J. Blumberg

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

Remembrance of Data Passed: A Study of Disk Sanitization Practices.

[BibT_eX]

[DOI]

Simson L. Garfinkel

IEEE Secur. Priv., 2003

IEEE Security & Privacy: Data Forensics - Rememberance of Data Passed: A Study of Disk Sanitization Practices.

[BibT_eX]

Simson L. Garfinkel

IEEE Distributed Syst. Online, 2003

Lower bounds for collusion-secure fingerprinting.

[BibT_eX]

[DOI]

Chris Peikert

Adam D. Smith

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Approximating the smallest grammar: Kolmogorov complexity in natural models.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Approximation algorithms for grammar-based compression.

[BibT_eX]

[DOI]

Eric Lehman