Abstract is missing.
- Concurrent Zero Knowledge Without Complexity AssumptionsDaniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan. 1-20 [doi]
- Interactive Zero-Knowledge with Restricted Random OraclesMoti Yung, Yunlei Zhao. 21-40 [doi]
- Non-interactive Zero-Knowledge from Homomorphic EncryptionIvan Damgård, Nelly Fazio, Antonio Nicolosi. 41-59 [doi]
- Ring Signatures: Stronger Definitions, and Constructions Without Random OraclesAdam Bender, Jonathan Katz, Ruggero Morselli. 60-79 [doi]
- Efficient Blind and Partially Blind Signatures Without Random OraclesTatsuaki Okamoto. 80-99 [doi]
- Key Exchange Using Passwords and Long KeysVladimir Kolesnikov, Charles Rackoff. 100-119 [doi]
- Mercurial Commitments: Minimal Assumptions and Efficient ConstructionsDario Catalano, Yevgeniy Dodis, Ivan Visconti. 120-144 [doi]
- Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic LatticesChris Peikert, Alon Rosen. 145-166 [doi]
- On Error Correction in the ExponentChris Peikert. 167-183 [doi]
- On the Relation Between the Ideal Cipher and the Random Oracle ModelsYevgeniy Dodis, Prashant Puniya. 184-206 [doi]
- Intrusion-Resilience Via the Bounded-Storage ModelStefan Dziembowski. 207-224 [doi]
- Perfectly Secure Password Protocols in the Bounded Retrieval ModelGiovanni Di Crescenzo, Richard J. Lipton, Shabsi Walfish. 225-244 [doi]
- Polylogarithmic Private Approximations and Efficient MatchingPiotr Indyk, David P. Woodruff. 245-264 [doi]
- Calibrating Noise to Sensitivity in Private Data AnalysisCynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith. 265-284 [doi]
- Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and ExponentiationIvan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft. 285-304 [doi]
- Efficient Multi-party Computation with Dispute ControlZuzana Beerliová-Trubíniová, Martin Hirt. 305-328 [doi]
- Round-Optimal and Efficient Verifiable Secret SharingMatthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan. 329-342 [doi]
- Generalized Environmental Security from Number Theoretic AssumptionsTal Malkin, Ryan Moriarty, Nikolai Yakovenko. 343-359 [doi]
- Games and the Impossibility of Realizable Ideal FunctionalityAnupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov. 360-379 [doi]
- Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange ProtocolsRan Canetti, Jonathan Herzog. 380-403 [doi]
- Resource Fairness and Composability of Cryptographic ProtocolsJuan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang. 404-428 [doi]
- Finding PessilandHoeteck Wee. 429-442 [doi]
- Pseudorandom Generators from One-Way Functions: A Simple Construction for Any HardnessThomas Holenstein. 443-461 [doi]
- On the Complexity of Parallel Hardness Amplification for One-Way FunctionsChi-Jen Lu. 462-481 [doi]
- On Matroids and Non-ideal Secret SharingAmos Beimel, Noam Livne. 482-501 [doi]
- Secure Computation with Partial Message LossChiu-Yuen Koo. 502-521 [doi]
- Communication Efficient Secure Linear AlgebraKobbi Nissim, Enav Weinreb. 522-541 [doi]
- Threshold and Proactive Pseudo-Random PermutationsYevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung. 542-560 [doi]
- PRF Domain Extension Using DAGsCharanjit S. Jutla. 561-580 [doi]
- Chosen-Ciphertext Security from Tag-Based EncryptionEike Kiltz. 581-600 [doi]
- Separating Sources for Encryption and Secret SharingYevgeniy Dodis, Krzysztof Pietrzak, Bartosz Przydatek. 601-616 [doi]