Advances in Cryptology – EUROCRYPT 2001
Springer Berlin (Verlag)
978-3-540-42070-5 (ISBN)
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.
Erscheint lt. Verlag | 25.4.2001 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XIII, 544 p. 23 illus. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 837 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algorithm analysis and problem complexity • anonymity • authentication • Cryptoanalysis • cryptographic protocol • cryptographic protocols • cryptography • Cryptology • Cryptosystems • Data Security • digital signature • Digital Signatures • Encryption • hash function • Information Hiding • Information Security • privacy • secure networks • Systems Security |
ISBN-10 | 3-540-42070-3 / 3540420703 |
ISBN-13 | 978-3-540-42070-5 / 9783540420705 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich