Advances in cryptology - CRYPTO 2001 : 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19 23, 2001 : proceedings
Crypto 2001, the 21st Annual Crypto conference, was sponsored by the Int- national Association for Cryptologic Research (IACR) in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of California at Santa Barbar...
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
2139 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Advances in cryptology--CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, proceedings, Joe Kilian (ed.), 2001, Berlin, Springer, 1 vol. (XI-598 p.), Lecture notes in computer science, 3-540-42456-3 • Advances in Cryptology - CRYPTO 2001, Texte imprimé, 9783662167922 |
İçindekiler:
- 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.