Advances in Cryptology — ASIACRYPT 2001
Springer Berlin (Verlag)
978-3-540-42987-6 (ISBN)
Lattice Based Cryptography.- Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001.- On the Insecurity of a Server-Aided RSA Protocol.- The Modular Inversion Hidden Number Problem.- Human Identification.- Secure Human Identification Protocols.- Invited Talk.- Unbelievable Security Matching AES Security Using Public Key Systems.- Practical Public Key Cryptography.- A Probable Prime Test with Very High Confidence for n ? 1 mod 4.- Computation of Discrete Logarithms in .- Speeding Up XTR.- An Efficient Implementation of Braid Groups.- Cryptography Based on Coding Theory.- How to Achieve a McEliece-Based Digital Signature Scheme.- Efficient Traitor Tracing Algorithms Using List Decoding.- Block Ciphers.- Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis.- Known-IV Attacks on Triple Modes of Operation of Block Ciphers.- Generic Attacks on Feistel Schemes.- A Compact Rijndael Hardware Architecture with S-Box Optimization.- Provable Security.- Provable Security of KASUMI and 3GPP Encryption Mode f8.- Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices.- Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case.- Threshold Cryptography.- Fully Distributed Threshold RSA under Standard Assumptions.- Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes.- Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks.- Two-Party Protocols.- Oblivious Polynomial Evaluation and Oblivious Neural Learning.- Mutually Independent Commitments.- Zero Knowledge.- Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank.- Responsive Round Complexity and Concurrent Zero-Knowledge.- CryptographicBuilding Blocks.- Practical Construction and Analysis of Pseudo-Randomness Primitives.- Autocorrelation Coefficients and Correlation Immunity of Boolean Functions.- Elliptic Curve Cryptography.- An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves.- Supersingular Curves in Cryptography.- Short Signatures from the Weil Pairing.- Self-Blindable Credential Certificates from the Weil Pairing.- Anonymity.- How to Leak a Secret.- Key-Privacy in Public-Key Encryption.- Provably Secure air Blind Signatures with Tight Revocation.
Erscheint lt. Verlag | 28.11.2001 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XI, 601 p. 22 illus. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 960 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algorithm analysis and problem complexity • authentication • coding theory • Complexity • Computational Algebra • Cryptoanalysis • cryptographic protocols • cryptography • Cryptology • Cryptosystems • Data Security • digital • Encryption • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • HC/Informatik, EDV/Programmiersprachen • Information • Information Security • Kryptologie • privacy • Public Key Cryptography • security • SIGNATUR • Systems Security |
ISBN-10 | 3-540-42987-5 / 3540429875 |
ISBN-13 | 978-3-540-42987-6 / 9783540429876 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich