Advances in Cryptology - CRYPTO '98

InhaltsangabeChosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1.- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack.- Relations among notions of security for public-key encryption schemes.- Cryptography and the internet.- Differential collisions in SHA-0.- From differential cryptanalysis to ciphertext-only attacks.- A simplified approach to threshold and proactive RSA.- New efficient and secure protocols for verifiable signature sharing and other applications.- Trading correctness for privacy in unconditional multi-party computation.- Fast digital identity revocation.- Self-delegation with controlled propagation - or - What if you lose your laptop.- Identity escrow.- Generalized birthday attacks on unbalanced Feistel networks.- Quadratic relation of S-box and its application to the linear attack of full round DES.- Cryptanalysis of block ciphers with probabilistic non-linear relations of low degree.- Cryptanalysis of the Ajtai-Dwork cryptosystem.- Cryptanalysis of the Chor-Rivest cryptosystem.- Cryptanalysis of the oil and vinegar signature scheme.- From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs.- Many-to-one trapdoor functions and their relation to public-key cryptosystems.- Authentication, enhanced security and error correcting codes.- An efficient discrete log pseudo random generator.- Fast RSA-type cryptosystem modulo p k q.- An elliptic curve implementation of the finite field digital signature algorithm.- Quantum bit commitment from a physical assumption.- On concrete security treatment of signatures derived from identification.- Building PRFs from PRPs.- Security amplification by composition: The case of doubly-iterated, ideal ciphers.- On the existence of 3-round zero-knowledge protocols.- Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?.- Concurrent zero-knowledge: Reducing the need for timing constraints.- The solution of McCurley's discrete log challenge.- Optimal extension fields for fast arithmetic in public-key algorithms.- Time-stamping with binary linking schemes.- Threshold traitor tracing.