Advances in Cryptology-Eurocrypt 2001: International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001
Subtitle: Proceedings (Lecture Notes)
Edition: 1 edition
Publisher: Springer-Verlag Telos
Published: June 2001
Language: eng
Format: Paperback
Number of pages: 544
ISBN-13: 9783540420705
Subjects: Coding theory & cryptology; Data security & data encryption; Cryptography/Access Control; Computers; Computers - General Information; Law; Computer Science; General; Security - General
Description: Advances in Cryptology — EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings<br />Author: Birgit Pfitzmann<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42070-5<br /> DOI: 10.1007/3-540-44987-6<br /><br />Table of Contents:<p></p><ul><li>A Memory Efficient Version of Satoh’s Algorithm
</li><li>Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
</li><li>How Secure Are Elliptic Curves over Composite Extension Fields?
</li><li>Efficient and Non-interactive Non-malleable Commitment
</li><li>How to Convert the Flavor of a Quantum Bit Commitment
</li><li>Cryptographic Counters and Applications to Electronic Voting
</li><li>An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
</li><li>Priced Oblivious Transfer: How to Sell Digital Goods
</li><li>A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
</li><li>Practical Threshold RSA Signatures without a Trusted Dealer
</li><li>Hash Functions: From Merkle-Damgård to Shoup
</li><li>Key Recovery and Message Attacks on NTRU-Composite
</li><li>Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
</li><li>NSS: An NTRU Lattice-Based Signature Scheme
</li><li>The Bit Security of Paillier’s Encryption Scheme and Its Applications
</li><li>Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
</li><li>On Adaptive vs. Non-adaptive Security of Multiparty Protocols
</li><li>Multiparty Computation from Threshold Homomorphic Encryption
</li><li>On Perfect and Adaptive Security in Exposure-Resilient Cryptography
</li><li>Cryptanalysis of Reduced-Round MISTY</li></ul>