|
|
|||
|
||||
OverviewThis book constitutes the refereed proceedings of the 21st Annual International Cryptology Conference, CRYPTO 2001, held in Santa Barbara, CA, USA in August 2001. The 33 revised full papers presented were carefully reviewed and selected from a total of 156 submissions. The papers are organized in topical sections on foundations, traitor tracing, multi-party computation, two-party computation, elliptic curves, OAEP, encryption and authentication, signature schemes, protocols, cryptanalysis, applications of group theory and coding theory, broadcast and secret sharing, and soundness and zero-knowledge. Full Product DetailsAuthor: Joe KilianPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2001 ed. Volume: 2139 Dimensions: Width: 15.50cm , Height: 3.10cm , Length: 23.30cm Weight: 1.890kg ISBN: 9783540424567ISBN 10: 3540424563 Pages: 604 Publication Date: 01 August 2001 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsFoundations.- On the (Im)possibility of Obfuscating Programs.- Universally Composable Commitments.- Traitor Tracing.- Revocation and Tracing Schemes for Stateless Receivers.- Self Protecting Pirates and Black-Box Traitor Tracing.- Multi-party Computation.- 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 Computation.- Two-Party Generation of DSA Signatures.- Oblivious Transfer in the Bounded Storage Model.- Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.- Elliptic Curves.- 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.- OAEP.- 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.- Encryption and Authentication.- Online Ciphers and the Hash-CBC Construction.- The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?).- Signature Schemes.- Forward-Secure Signatures with Optimal Signing and Verifying.- Improved Online/Offline Signature Schemes.- Protocols.- An Efficient Scheme for Proving a Shuffle.- An Identity Escrow Scheme with Appointed Verifiers.- Session-Key Generation Using Human Passwords Only.- Cryptanalysis.- Cryptanalysis of RSA Signatures with Fixed-Pattern Padding.- Correlation Analysis of the Shrinking Generator.- Applications of Groups and Codes.- Nonlinear Vector Resilient Functions.- New Public Key Cryptosystem UsingFinite Non Abelian Groups.- Pseudorandomness from Braid Groups.- Broadcast and Secret Sharing.- On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase.- Secure and Efficient Asynchronous Broadcast Protocols.- Soundness and Zero-Knowledge.- Soundness in the Public-Key Model.- Robust Non-interactive Zero Knowledge.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||