Advances in cryptology - EUROCRYPT 2001 : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6 10, 2001 : proceedings
EUROCRYPT 2001, the 20th annual Eurocrypt conference, was sponsored by the IACR, the International Association for Cryptologic Research, see http://www. iacr. org/, this year in cooperation with the Austrian Computer - ciety (OCG). The General Chair, Reinhard Posch, was responsible for local or- niz...
সংরক্ষণ করুন:
| সংস্থা লেখক: | |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science
2045 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
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, EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, proceedings, Birgit Pfitzmann (ed.), 2001, Berlin, Springer, 1 vol. (XII-544 p.), Lecture notes in computer science, 3-540-42070-3 • Advances in Cryptology EUROCRYPT 2001, Texte imprimé, 9783662189061 |
সূচিপত্রের সারণি:
- Elliptic Curves
- 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?
- Commitments
- Efficient and Non-interactive Non-malleable Commitment
- How to Convert the Flavor of a Quantum Bit Commitment
- Anonymity
- 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
- Signatures and Hash Functions
- A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
- Practical Threshold RSA Signatures without a Trusted Dealer
- Hash Functions: From Merkle-Damgård to Shoup
- XTR and NTRU
- 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
- Assumptions
- The Bit Security of Paillier s Encryption Scheme and Its Applications
- Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
- Multiparty Protocols
- On Adaptive vs. Non-adaptive Security of Multiparty Protocols
- Multiparty Computation from Threshold Homomorphic Encryption
- On Perfect and Adaptive Security in Exposure-Resilient Cryptography
- Block Ciphers
- Cryptanalysis of Reduced-Round MISTY
- The Rectangle Attack Rectangling the Serpent
- Primitives
- Efficient Amplification of the Security of Weak Pseudo-random Function Generators
- Min-round Resettable Zero-Knowledge in the Public-Key Model
- Symmetric Ciphers
- Structural Cryptanalysis of SASAS
- Hyper-bent Functions
- New Method for Upper Bounding the Maximum Average Linear Hull Probabilityfor SPNs
- Key Exchange and Multicast
- 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
- Authentication and Identification
- Identification Protocols Secure against Reset Attacks
- Does Encryption with Redundancy Provide Authenticity?
- Encryption Modes with Almost Free Message Integrity.