Advances in Cryptology -- CRYPTO 2003
Springer Berlin (Verlag)
978-3-540-40674-7 (ISBN)
Public Key Cryptanalysis I.- Factoring Large Numbers with the TWIRL Device.- New Partial Key Exposure Attacks on RSA.- Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases.- Alternate Adversary Models.- On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model.- Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret.- Invited Talk I.- On Cryptographic Assumptions and Challenges.- Protocols.- Scalable Protocols for Authenticated Group Key Exchange.- Practical Verifiable Encryption and Decryption of Discrete Logarithms.- Extending Oblivious Transfers Efficiently.- Symmetric Key Cryptanalysis I.- Algebraic Attacks on Combiners with Memory.- Fast Algebraic Attacks on Stream Ciphers with Linear Feedback.- Cryptanalysis of Safer++.- Public Key Cryptanalysis II.- A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem.- The Impact of Decryption Failures on the Security of NTRU Encryption.- Universal Composability.- Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption.- Universal Composition with Joint State.- Zero-Knowledge.- Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More.- Derandomization in Cryptography.- On Deniability in the Common Reference String and Random Oracle Model.- Algebraic Geometry.- Primality Proving via One Round in ECPP and One Iteration in AKS.- Torus-Based Cryptography.- Public Key Constructions.- Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation.- Multipurpose Identity-Based Signcryption.- Invited Talk II.- SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols.- New Problems.- OnMemory-Bound Functions for Fighting Spam.- Lower and Upper Bounds on Obtaining History Independence.- Private Circuits: Securing Hardware against Probing Attacks.- Symmetric Key Constructions.- A Tweakable Enciphering Mode.- A Message Authentication Code Based on Unimodular Matrix Groups.- Luby-Rackoff: 7 Rounds Are Enough for 2 n(1????) Security.- New Models.- Weak Key Authenticity and the Computational Completeness of Formal Encryption.- Plaintext Awareness via Key Registration.- Relaxing Chosen-Ciphertext Security.- Symmetric Key Cryptanalysis II.- Password Interception in a SSL/TLS Channel.- Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication.- Making a Faster Cryptanalytic Time-Memory Trade-Off.
Erscheint lt. Verlag | 4.8.2003 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 636 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 920 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algebraic Geometry • Algorithm analysis and problem complexity • authentication • authenticity • Computational Number Theory • Cryptanalysis • cryptographic protocols • cryptography • Cryptology • data encryption • Information Security • Kryptographie / Kryptologie • message authentication code • multiparty computation • Padding • privacy • Public Key Cryptography • signcryption • symmetric cryptography • Zero Knowledge |
ISBN-10 | 3-540-40674-3 / 3540406743 |
ISBN-13 | 978-3-540-40674-7 / 9783540406747 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich