Abstract is missing.
- On the (Im)possibility of Obfuscating ProgramsBoaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang. 1-18 [doi]
- Universally Composable CommitmentsRan Canetti, Marc Fischlin. 19-40 [doi]
- Revocation and Tracing Schemes for Stateless ReceiversDalit Naor, Moni Naor, Jeffery Lotspiech. 41-62 [doi]
- Self Protecting Pirates and Black-Box Traitor TracingAggelos Kiayias, Moti Yung. 63-79 [doi]
- Minimal Complete Primitives for Secure Multi-party ComputationMatthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky. 80-100 [doi]
- Robustness for Free in Unconditional Multi-party ComputationMartin Hirt, Ueli M. Maurer. 101-118 [doi]
- Secure Distributed Linear Algebra in a Constant Number of RoundsRonald Cramer, Ivan Damgård. 119-136 [doi]
- Two-Party Generation of DSA SignaturesPhilip D. MacKenzie, Michael K. Reiter. 137-154 [doi]
- Oblivious Transfer in the Bounded Storage ModelYan Zong Ding. 155-170 [doi]
- Parallel Coin-Tossing and Constant-Round Secure Two-Party ComputationYehuda Lindell. 171-189 [doi]
- Faster Point Multiplication on Elliptic Curves with Efficient EndomorphismsRobert P. Gallant, Robert J. Lambert, Scott A. Vanstone. 190-200 [doi]
- On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman SchemeDan Boneh, Igor Shparlinski. 201-212 [doi]
- Identity-Based Encryption from the Weil PairingDan Boneh, Matthew K. Franklin. 213-229 [doi]
- A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0James Manger. 230-238 [doi]
- OAEP ReconsideredVictor Shoup. 239-259 [doi]
- RSA-OAEP Is Secure under the RSA AssumptionEiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern. 260-274 [doi]
- Simplified OAEP for the RSA and Rabin FunctionsDan Boneh. 275-291 [doi]
- Online Ciphers and the Hash-CBC ConstructionMihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre. 292-309 [doi]
- The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)Hugo Krawczyk. 310-331 [doi]
- Forward-Secure Signatures with Optimal Signing and VerifyingGene Itkis, Leonid Reyzin. 332-354 [doi]
- Improved Online/Offline Signature SchemesAdi Shamir, Yael Tauman. 355-367 [doi]
- An Efficient Scheme for Proving a ShuffleJun Furukawa, Kazue Sako. 368-387 [doi]
- An Identity Escrow Scheme with Appointed VerifiersJan Camenisch, Anna Lysyanskaya. 388-407 [doi]
- Session-Key Generation Using Human Passwords OnlyOded Goldreich, Yehuda Lindell. 408-432 [doi]
- Cryptanalysis of RSA Signatures with Fixed-Pattern PaddingEric Brier, Christophe Clavier, Jean-Sébastien Coron, David Naccache. 433-439 [doi]
- Correlation Analysis of the Shrinking GeneratorJovan Dj. Golic. 440-457 [doi]
- Nonlinear Vector Resilient FunctionsJung Hee Cheon. 458-469 [doi]
- New Public Key Cryptosystem Using Finite Non Abelian GroupsSeong-Hun Paeng, Kil-Chan Ha, Jae Heon Kim, Seongtaek Chee, Choonsik Park. 470-485 [doi]
- Pseudorandomness from Braid GroupsEonkyung Lee, Sangjin Lee, Sang Geun Hahn. 486-502 [doi]
- On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction PhaseRonald Cramer, Ivan Damgård, Serge Fehr. 503-523 [doi]
- Secure and Efficient Asynchronous Broadcast ProtocolsChristian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup. 524-541 [doi]
- Soundness in the Public-Key ModelSilvio Micali, Leonid Reyzin. 542-565 [doi]
- Robust Non-interactive Zero KnowledgeAlfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai. 566-598 [doi]