Advances in Cryptology - Eurocrypt 2001 : International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceedings.Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; vol. 2045.Publication details: New York : Springer, May 2001. Description: 1 online resource (544 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540420705; 3540420703; 9783540449874; 3540449876Subject(s): Computer science | Computer Communication Networks | Data encryption (Computer science) | Computer software | Information Systems | Computer science -- Mathematics | Computer science | Computer science -- Mathematics | Computer software | Data encryption (Computer science)Genre/Form: Electronic books. Additional physical formats: Printed edition:: No titleDDC classification: 005.82 LOC classification: QA76.9.A25Online resources: Click here to access online
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
Scholarly & Professional Springer.
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 Probability for 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.
This book constitutes the refereed proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2001, held in Innsbruck, Austria in May 2001. 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.