Advances in cryptology – CRYPTO 2001 : 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 2001, proceedings

Advances in Cryptology — CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19–23, 2001 Proceedings
Author: Joe Kilian
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42456-7
DOI: 10.1007/3-540-44647-8

Table of Contents:

• On the (Im)possibility of Obfuscating Programs
• Universally Composable Commitments
• Revocation and Tracing Schemes for Stateless Receivers
• Self Protecting Pirates and Black-Box Traitor Tracing
• Minimal Complete Primitives for Secure Multi-party Computation
• Robustness for Free in Unconditional Multi-party Computation
• Secure Distributed Linear Algebra in a Constant Number of Rounds
• Two-Party Generation of DSA Signatures
• Oblivious Transfer in the Bounded Storage Model
• Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
• Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
• On the Unpredictability of Bits of the Elliptic Curve Diffie-Hellman Scheme
• Identity-Based Encryption from the Weil Pairing
• A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0
• OAEP Reconsidered
• RSA-OAEP Is Secure under the RSA Assumption
• Simplified OAEP for the RSA and Rabin Functions
• Online Ciphers and the Hash-CBC Construction
• The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
• Forward-Secure Signatures with Optimal Signing and Verifying

Includes bibliographical references and index