| 2008 | A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. Iftach Haitner, Jonathan J. Hoch, Gil Segev |
| 2008 | An Equivalence Between Zero Knowledge and Commitments. Shien Jin Ong, Salil P. Vadhan |
| 2008 | Asymptotically Efficient Lattice-Based Digital Signatures. Vadim Lyubashevsky, Daniele Micciancio |
| 2008 | Basing Weak Public-Key Cryptography on Strong One-Way Functions. Eli Biham, Yaron J. Goren, Yuval Ishai |
| 2008 | Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee |
| 2008 | Bridging Game Theory and Cryptography: Recent Results and Future Directions. Jonathan Katz |
| 2008 | Concurrent Non-malleable Commitments from Any One-Way Function. Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
| 2008 | Cryptography and Game Theory: Designing Protocols for Exchanging Information. Gillat Kol, Moni Naor |
| 2008 | Degradation and Amplification of Computational Hardness. Shai Halevi, Tal Rabin |
| 2008 | Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Carmit Hazay, Yehuda Lindell |
| 2008 | Equivocal Blind Signatures and Adaptive UC-Security. Aggelos Kiayias, Hong-Sheng Zhou |
| 2008 | Fast Private Norm Estimation and Heavy Hitters. Joe Kilian, André Madeira, Martin J. Strauss, Xuan Zheng |
| 2008 | Faster and Shorter Password-Authenticated Key Exchange. Rosario Gennaro |
| 2008 | General Properties of Quantum Zero-Knowledge Proofs. Hirotada Kobayashi |
| 2008 | How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge. Lior Malka |
| 2008 | Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency. Paul Valiant |
| 2008 | Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan |
| 2008 | Lower Bounds on Implementing Robust and Resilient Mediators. Ittai Abraham, Danny Dolev, Joseph Y. Halpern |
| 2008 | MPC vs. SFE: Perfect Security in a Unified Corruption Model. Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli M. Maurer, Vassilis Zikas |
| 2008 | Matroids Can Be Far from Ideal Secret Sharing. Amos Beimel, Noam Livne, Carles Padró |
| 2008 | Multi-property Preserving Combiners for Hash Functions. Marc Fischlin, Anja Lehmann |
| 2008 | OT-Combiners via Secure Computation. Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen |
| 2008 | On Constant-Round Concurrent Zero-Knowledge. Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
| 2008 | On Seed-Incompressible Functions. Shai Halevi, Steven A. Myers, Charles Rackoff |
| 2008 | P-signatures and Noninteractive Anonymous Credentials. Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya |
| 2008 | Perfectly-Secure MPC with Linear Communication Complexity. Zuzana Beerliová-Trubíniová, Martin Hirt |
| 2008 | Randomness Extraction Via Serge Fehr, Christian Schaffner |
| 2008 | Saving Private Randomness in One-Way Functions and Pseudorandom Generators. Nenad Dedic, Danny Harnik, Leonid Reyzin |
| 2008 | Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. Iftach Haitner |
| 2008 | The Layered Games Framework for Specifications and Analysis of Security Protocols. Amir Herzberg, Igal Yoffe |
| 2008 | The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. Daniele Micciancio, Scott Yilek |
| 2008 | Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Ran Canetti |
| 2008 | Universally Composable Multi-party Computation with an Unreliable Common Reference String. Vipul Goyal, Jonathan Katz |
| 2008 | Verifiably Secure Devices. Sergei Izmalkov, Matt Lepinski, Silvio Micali |
| 2008 | Which Languages Have 4-Round Zero-Knowledge Proofs? Jonathan Katz |