TCC 2008:

• Paul Valiant :
  Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency , ( .ps ). 1-18
  BibTeX
• Shai Halevi , Steven Myers , Charles Rackoff :
  On Seed-Incompressible Functions , ( .ps ). 19-36
  BibTeX
• Vadim Lyubashevsky , Daniele Micciancio :
  Asymptotically Efficient Lattice-Based Digital Signatures , ( .ps ). 37-54
  BibTeX
• Eli Biham , Yaron J. Goren , Yuval Ishai :
  Basing Weak Public-Key Cryptography on Strong One-Way Functions , ( .ps ). 55-72
  BibTeX
• Jonathan Katz :
  Which Languages Have 4-Round Zero-Knowledge Proofs , ( .ps ).? 73-88
  BibTeX
• Lior Malka :
  How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge , ( .ps ). 89-106
  BibTeX
• Hirotada Kobayashi :
  General Properties of Quantum Zero-Knowledge Proofs , ( .ps ). 107-124
  BibTeX
• Amir Herzberg , Igal Yoffe :
  The Layered Games Framework for Specifications and Analysis of Security Protocols , ( .ps ). 125-141
  BibTeX
• Vipul Goyal , Jonathan Katz :
  Universally Composable Multi-party Computation with an Unreliable Common Reference String , ( .ps ). 142-154
  BibTeX
• Carmit Hazay , Yehuda Lindell :
  Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries , ( .ps ). 155-175
  BibTeX
• Joe Kilian , André Madeira , Martin J. Strauss , Xuan Zheng :
  Fast Private Norm Estimation and Heavy Hitters , ( .ps ). 176-193
  BibTeX
• Amos Beimel , Noam Livne , Carles Padró :
  Matroids Can Be Far from Ideal Secret Sharing , ( .ps ). 194-212
  BibTeX
• Zuzana Beerliová-Trubíniová , Martin Hirt :
  Perfectly-Secure MPC with Linear Communication Complexity , ( .ps ). 213-230
  BibTeX
• Zuzana Beerliová-Trubíniová , Matthias Fitzi , Martin Hirt , Ueli M. Maurer , Vassilis Zikas :
  MPC vs. SFE: Perfect Security in a Unified Corruption Model , ( .ps ). 231-250
  BibTeX
• Jonathan Katz :
  Bridging Game Theory and Cryptography: Recent Results and Future Directions , ( .ps ). 251-272
  BibTeX
• Sergei Izmalkov , Matt Lepinski , Silvio Micali :
  Verifiably Secure Devices , ( .ps ). 273-301
  BibTeX
• Ittai Abraham , Danny Dolev , Joseph Y. Halpern :
  Lower Bounds on Implementing Robust and Resilient Mediators , ( .ps ). 302-319
  BibTeX
• Gillat Kol , Moni Naor :
  Cryptography and Game Theory: Designing Protocols for Exchanging Information , ( .ps ). 320-339
  BibTeX
• Aggelos Kiayias , Hong-Sheng Zhou :
  Equivocal Blind Signatures and Adaptive UC-Security , ( .ps ). 340-355
  BibTeX
• Mira Belenkiy , Melissa Chase , Markulf Kohlweiss , Anna Lysyanskaya :
  P-signatures and Noninteractive Anonymous Credentials , ( .ps ). 356-374
  BibTeX
• Marc Fischlin , Anja Lehmann :
  Multi-property Preserving Combiners for Hash Functions , ( .ps ). 375-392
  BibTeX
• Danny Harnik , Yuval Ishai , Eyal Kushilevitz , Jesper Buus Nielsen :
  OT-Combiners via Secure Computation , ( .ps ). 393-411
  BibTeX
• Iftach Haitner :
  Semi-honest to Malicious Oblivious Transfer - The Black-Box Way , ( .ps ). 412-426
  BibTeX
• Seung Geol Choi , Dana Dachman-Soled , Tal Malkin , Hoeteck Wee :
  Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One , ( .ps ). 427-444
  BibTeX
• Iftach Haitner , Jonathan J. Hoch , Gil Segev :
  A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval , ( .ps ). 445-464
  BibTeX
• Serge Fehr , Christian Schaffner :
  Randomness Extraction Via delta -Biased Masking in the Presence of a Quantum Attacker , ( .ps ). 465-481
  BibTeX
• Shien Jin Ong , Salil P. Vadhan :
  An Equivalence Between Zero Knowledge and Commitments , ( .ps ). 482-500
  BibTeX
• André Chailloux , Dragos Florin Ciocan , Iordanis Kerenidis , Salil P. Vadhan :
  Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model , ( .ps ). 501-534
  BibTeX
• Daniele Micciancio , Scott Yilek :
  The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization , ( .ps ). 535-552
  BibTeX
• Rafael Pass , Muthuramakrishnan Venkitasubramaniam :
  On Constant-Round Concurrent Zero-Knowledge , ( .ps ). 553-570
  BibTeX
• Huijia Lin , Rafael Pass , Muthuramakrishnan Venkitasubramaniam :
  Concurrent Non-malleable Commitments from Any One-Way Function , ( .ps ). 571-588
  BibTeX
• Rosario Gennaro :
  Faster and Shorter Password-Authenticated Key Exchange , ( .ps ). 589-606
  BibTeX
• Nenad Dedic , Danny Harnik , Leonid Reyzin :
  Saving Private Randomness in One-Way Functions and Pseudorandom Generators , ( .ps ). 607-625
  BibTeX
• Shai Halevi , Tal Rabin :
  Degradation and Amplification of Computational Hardness , ( .ps ). 626-643
  BibTeX