Advances in Cryptology - CRYPTO '97
Springer Berlin (Verlag)
978-3-540-63384-6 (ISBN)
The volume presents 35 revised full papers selected from 160 submissions received. Also included are two invited presentations. The papers are organized in sections on complexity theory, cryptographic primitives, lattice-based cryptography, digital signatures, cryptanalysis of public-key cryptosystems, information theory, elliptic curve implementation, number-theoretic systems, distributed cryptography, hash functions, cryptanalysis of secret-key cryptosystems.
The complexity of computing hard core predicates.- Statistical zero knowledge protocols to prove modular polynomial relations.- Keeping the SZK-verifier honest unconditionally.- On the foundations of modern cryptography.- Plug and play encryption.- Deniable Encryption.- Eliminating decryption errors in the Ajtai-Dwork Cryptosystem.- Public-key cryptosystems from lattice reduction problems.- RSA-based undeniable signatures.- Security of blind digital signatures.- Digital signcryption or how to achieve cost(signature & encryption) ? cost(signature) + cost(encryption).- How to sign digital streams.- Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations.- Failure of the McEliece public-key cryptosystem under message-resend and related-message attack.- A multiplicative attack using LLL algorithm on RSA signatures with redundancy.- On the security of the KMOV public key cryptosystem.- A key recovery attack on discrete log-based schemes using a prime order subgroup.- The prevalence of kleptographic attacks on discrete-log based cryptosystems.- "Pseudo-random" number generation within cryptographic algorithms: The DDS case.- Unconditional security against memory-bounded adversaries.- Privacy amplification secure against active adversaries.- Visual authentication and identification.- Quantum information processing: The good, the bad and the ugly.- Efficient algorithms for elliptic curve cryptosystems.- An improved algorithm for arithmetic on a family of elliptic curves.- Fast RSA-type cryptosystems using n-adic expansion.- A one way function based on ideal arithmetic in number fields.- Efficient anonymous multicast and reception.- Efficient group signature schemes for large groups.- Efficient generation of shared RSA keys.-Proactive RSA.- Towards realizing random oracles: Hash functions that hide all partial information.- Collision-Resistant hashing: Towards making UOWHFs practical.- Fast and secure hashing based on codes.- Edit distance correlation attack on the alternating step generator.- Differential fault analysis of secret key cryptosystems.- Cryptanalysis of the cellular message encryption algorithm.- Security of 2t-root identification and signatures, proceedings CRYPTO'98.
| Erscheint lt. Verlag | 6.8.1997 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | 546 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 728 g |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • Complexity • Complexity theory • Cryptanalysis • Cryptology • Digital Signatures • Distributed Cryptography • Hash Functions • Information Theory • Kryptographie / Kryptologie • Public Key • Public-Key Cryptography • Sage • security • SIGNATUR • Statistica |
| ISBN-10 | 3-540-63384-7 / 3540633847 |
| ISBN-13 | 978-3-540-63384-6 / 9783540633846 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
