Advances in Cryptology — CRYPTO ’96 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18–22, 1996, Proceedings

Crypto '96, the Sixteenth Annual Crypto Conference, is sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer Society Technical Committee on Security and P- vacy and the Computer Science Department of the University of California at San...

Full description

Bibliographic Details
Other Authors: Koblitz, Neal (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1996, 1996
Edition:1st ed. 1996
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers
  • Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
  • Symmetric Systems
  • Improved Differential Attacks on RC5
  • Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
  • More on Symmetric Systems
  • Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
  • How to Protect DES Against Exhaustive Key Search
  • Diffie-Hellman Oracle
  • Diffie-Hellman Oracles
  • Algorithms for Black-Box Fields and their Application to Cryptography
  • Hashing and Authentication II
  • Fast Hashing on the Pentium
  • On Fast and Provably Secure Message Authentication Based on Universal Hashing
  • Quantum Crypto
  • Quantum Cryptography over Underground Optical Fibers
  • Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
  • Stream Ciphers
  • LinearComplexity of Periodic Sequences: A General Theory
  • Hashing and Authentication I
  • Keying Hash Functions for Message Authentication
  • Universal Hashing and Multiple Authentication
  • Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
  • New Systems
  • Asymmetric Cryptography with a Hidden Monomial
  • Anonymous Communication and Anonymous Cash
  • Asymmetric Systems
  • Weaknesses in Some Threshold Cryptosystems
  • Hidden Collisions on DSS
  • The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
  • Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
  • Hard Bits
  • All Bits in ax + b mod p are Hard
  • Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
  • Signatures
  • Security of 2t-Root Identification and Signatures
  • Robust and Efficient Sharing of RSA Functions
  • New Generation of Secure and Practical RSA-Based Signatures
  • Zero Knowledge
  • Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations
  • Secret Sharing
  • Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution
  • New Results on Visual Cryptography