Advances in cryptology, EUROCRYPT '97 : International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11-15, 1997 : proceedings

Block Ciphers.- Two Attacks on Reduced IDEA.- Combinatorial Properties of Basic Encryption Operations.- Public Key Systems.- A New Public-Key Cryptosystem.- On the Importance of Checking Cryptographic Protocols for Faults.- Lattice Attacks on NTRU.- Protocols.- Kleptography: Using Cryptography Against Cryptography.- Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation.- Anonymous Fingerprinting.- A Secure and Optimally Efficient Multi-Authority Election Scheme.- Key Escrow.- Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals.- The GCHQ Protocol and Its Problems.- Hash-Functions.- Bucket Hashing with a Small Key Size.- A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost.- Information Theory.- Smooth Entropy and Renyi Entropy.- Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion.- Stream Ciphers.- Linear Statistical Weakness of Alleged RC4 Keystream Generator.- Cryptanalysis of Alleged A5 Stream Cipher.- Complexity Theory.- Lower Bounds for Discrete Logarithms and Related Problems.- Stronger Security Proofs for RSA and Rabin Bits.- Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function.- Efficient Cryptographic Protocols Based on Noisy Channels.- Rapid Demonstration of Linear Relations Connected by Boolean Operators.- Oblivious Transfers and Privacy Amplification.- Implementation.- SHA: A Design for Parallel Architectures?.- Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m).- Finding Good Random Elliptic Curves for Cryptosystems Defined over .- Authentication.- Incremental Cryptography and Memory Checkers.- Almost k-wise Independent Sample Spaces and Their Cryptologic Applications.- Boolean Functions.- More Correlation-Immune and Resilient Functions over Galois Fields and Galois Rings.- Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria.- Signatures.- Distributed "Magic Ink" Signatures.- Efficient and Generalized Group Signatures.- Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees.- Selective Forgery of RSA Signatures Using Redundancy.