Archives
- 2011.01.27: Two-output Secure Computation With Malicious Adversaries
- 2011.01.27: A Sub-0.5V Lattice-Based Public-Key Encryption Scheme for RFID Platforms in 130nm CMOS
- 2011.01.27: Renegotiation-safe Protocols
- 2011.01.27: Optimistic Concurrent Zero Knowledge
- 2011.01.27: Additive Combinatorics and Discrete Logarithm Based Range Protocols
- 2009.08.04: Bit Encryption is Complete
- 2009.05.15: Collusion-Free Multiparty Computation in the Mediated Model
- 2009.05.15: Purely Rational Secret Sharing
- 2008.08.29: Efficient Protocols for Set Membership and Range Proofs
- 2008.08.29: Collusion-Free Protocols in the Mediated Model
- 2007.08.29: Relations Among Notions of Non-Malleability for Encryption
- 2007.08.29: Bounded CCA2-Secure Encryption
- 2007.07.25: Cryptography from Sunspots: How to use an Imperfect Reference String
- 2007.07.25: Efficient Fork-Linearizable Access to Untrusted Shared Memory
- 2007.07.25: Simulatable Adaptive Oblivious Transfer
- 2007.07.25: Securely Obfuscating Re-encryption
- 2007.07.25: Construction of a Non-malleable Encryption Scheme from Any Semantically-Secure One
- 2005.08.25: Unconditional Characterizations of Non-Interactive Zero-Knowledge
- 2005.07.25: Collusion-free Protocols
- 2005.07.25: The Smallest Grammar Problem
- 2005.02.25: Fair Zero Knowledge
- 2004.07.25: Completely Fair SFE and Coalition-Safe Cheap Talk
- 2004.07.25: Searching for Stable Mechanisms : Automated Design for Imperfect Players
- 2003.07.25: Lower Bounds for Collusion-Secure Fingerprinting
- 2003.07.25: Remembrance of Data Passed: A Study of Disk Sanitization Practices
- 2002.07.25: Approximation Algorithms for Grammar-Based Compression
- 2001.07.25: March Madness is (NP-)Hard
