Advances in Cryptology - CRYPTO 2001

21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings

Häftad, Engelska, 2001

1 429 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This 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.

Produktinformation

Utgivningsdatum2001-08-01
Mått155 x 233 x 33 mm
Vikt912 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor604
Upplaga2001
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540424567

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik
IT-säkerhet inom Data och it
Operativsystem inom Data och it

Foundations.- 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.