Advances in Cryptology – EUROCRYPT 2001

International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001, Proceedings

Häftad, Engelska, 2001

Av Birgit Pfitzmann, B. Pfitzmann, Birgit Pfitzmann

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

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

These are 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 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.

Produktinformation

Utgivningsdatum2001-04-25
Mått155 x 235 x 30 mm
Vikt838 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor544
Upplaga2001
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540420705

Tillhör följande kategorier

Affärsförhandlingar inom Ekonomi och ledarskap
Beräkning och matematisk analys inom Naturvetenskap och teknik
Hårdvara inom Data och it
Programmeringsböcker inom Data och it
Systemvetenskap och AI inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik
IT-säkerhet inom Data och it

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.