Advances in Cryptology - ASIACRYPT 2000
Springer Berlin (Verlag)
978-3-540-41404-9 (ISBN)
Cryptanalysis I.- Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers.- Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99.- Why Textbook ElGamal and RSA Encryption Are Insecure.- Cryptanalysis of the TTM Cryptosystem.- Attacking and Repairing Batch Verification Schemes.- IACR Distinguished Lecture.- Cryptography Everywhere.- Digital Signatures.- Security of Signed ElGamal Encryption.- From Fixed-Length to Arbitrary-Length RSA Padding Schemes.- Towards Signature-Only Signature Schemes.- A New Forward-Secure Digital Signature Scheme.- Unconditionally Secure Digital Signature Schemes Admitting Transferability.- Protocols I.- Efficient Secure Multi-party Computation.- Mix and Match: Secure Function Evaluation via Ciphertexts.- A Length-Invariant Hybrid Mix.- Attack for Flash MIX.- Distributed Oblivious Transfer.- Number Theoretic Algorithms.- Key Improvements to XTR.- Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders.- Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three.- Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems.- Symmetric-Key Schemes I.- Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis.- On the Pseudorandomness of Top-Level Schemes of Block Ciphers.- Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers.- Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography.- Protocols II.- Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes.- Addition of El Gamal Plaintexts.- Improved Methods to Perform Threshold RSA.- Commital Deniable Proofsand Electronic Campaign Finance.- Provably Secure Metering Scheme.- Invited Lecture.- CRYPTREC Project Cryptographic Evaluation Project for the Japanese Electronic Government.- Fingerprinting.- Anonymous Fingerprinting with Direct Non-repudiation.- Efficient Anonymous Fingerprinting with Group Signatures.- Zero-Knowledge and Provable Security.- Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems.- Zero-Knowledge and Code Obfuscation.- A Note on Security Proofs in the Generic Model.- Boolean Functions.- On Relationships among Avalanche, Nonlinearity, and Correlation Immunity.- Cryptanalysis II.- Cryptanalysis of the Yi-Lam Hash.- Power Analysis, What Is Now Possible....- Pseudorandomness.- Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications.- Symmetric-Key Schemes II.- The Security of Chaffing and Winnowing.- Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm.- Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques.- Proofs of Security for the Unix Password Hashing Algorithm.- Public-Key Encryption and Key Distribution.- Trapdooring Discrete Logarithms on Elliptic Curves over Rings.- Strengthening McEliece Cryptosystem.- Password-Authenticated Key Exchange Based on RSA.- Round-Efficient Conference Key Agreement Protocols with Provable Security.
Erscheint lt. Verlag | 22.11.2000 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 636 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 233 mm |
Gewicht | 964 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algorithm analysis and problem complexity • algorithms • Calculus • Cryptanalysis • cryptographic protocools • cryptography • Cryptology • data encryption • Data Security • Digital Payment • Information Security • privacy • Public-Key Cryptosystems • rsa • secure communication • security • Systems Security • verification |
ISBN-10 | 3-540-41404-5 / 3540414045 |
ISBN-13 | 978-3-540-41404-9 / 9783540414049 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich