Advances in cryptology-eurocrypt 2001
International conference on the theory and application of cryptographic techniques. Innsbruck, austria, May 2001, Proceedings
Résumé
The 32 revised full papers presented were carefully reviewed and selected from a total of 155 submissions. The papers are organized in topical sections on elliptic curves, commitments, anonymity, signatures and hash functions, XTR and NTRU, assumptions, multiparty protocols, block ciphers, primitives, symmetric ciphers, key exchange and multicast, and authentication and identification.
Contents
- A Memory Efficient Version of Satoh's Algorithm
- Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
- How Secure Are Elliptic Curves over Composite Extension Fields?
- Efficient and Non-interactive Non-malleable Commitment
- How to Convert the Flavor of a Quantum Bit Commitment
- Cryptographic Counters and Applications to Electronic Voting
- An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
- Priced Oblivious Transfer: How to Sell Digital Goods
- A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
- Practical Threshold RSA Signatures without a Trusted Dealer
- Hash Functions: From Merkle-Damgard to Shoup
- Key Recovery and Message Attacks on NTRU-Composite
- Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
- NSS: An NTRU Lattice-Based Signature Scheme
- The Bit Security of Paillier's Encryption Scheme and Its Applications
- Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
- On Adaptive vs. Non-adaptive Security of Multiparty Protocols
- Multiparty Computation from Threshold Homomorphic Encryption
- On Perfect and Adaptive Security in Exposure-Resilient Cryptography
- Cryptanalysis of Reduced-Round MISTY
- The Rectangle Attack - Rectangling the Serpent
- Efficient Amplification of the Security of Weak Pseudo-Random Function Generators
- Min-round Resettable Zero-Knowledge in the Public-Key Model
- Structural Cryptanalysis of SASAS
- Hyper-bent Functions
- New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
- Lower Bounds for Multicast Message Authentication
- Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
- Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
- Identification Protocols Secure against Reset, Attacks
- Does Encryption with Redundancy Provide Authenticity?
- Encryption Modes with Almost Free Message Integrity
- Author Index
Caractéristiques techniques
PAPIER | |
Éditeur(s) | Springer |
Auteur(s) | Birgit Pfitzmann |
Parution | 15/07/2001 |
Nb. de pages | 544 |
Format | 15,5 x 23,5 |
Couverture | Broché |
Poids | 800g |
Intérieur | Noir et Blanc |
EAN13 | 9783540420705 |
Avantages Eyrolles.com
Consultez aussi
- Les meilleures ventes en Graphisme & Photo
- Les meilleures ventes en Informatique
- Les meilleures ventes en Construction
- Les meilleures ventes en Entreprise & Droit
- Les meilleures ventes en Sciences
- Les meilleures ventes en Littérature
- Les meilleures ventes en Arts & Loisirs
- Les meilleures ventes en Vie pratique
- Les meilleures ventes en Voyage et Tourisme
- Les meilleures ventes en BD et Jeunesse