Advances in cryptology - CRYPTO 94 : 14th annual international cryptology conference, Santa Barbara, California, USA, August 21-25, 1994 : proceedings

The CRYPTO 94 conference is sponsored by the International Association for Cryptologic Research (IACR), in co-operation with the IEEE Computer Society Technical Committee on Security and Privacy. It has taken place at the Univ- sity of California, Santa Barbara, from August 21-25,1994. This is the f...

Description complète

Enregistré dans:
Détails bibliographiques
Collectivité auteur: Annual international cryptology conference :Santa Barbara, Calif.
Autres auteurs: Desmedt, Yvo G., 1956- (Directeur de la publication)
Format: Livre numérique
Langue:Anglais
Publié: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Collection:Lecture notes in computer science 839
Sujets:
Accès en ligne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Advances in cryptology, CRYPTO '94, 14th annual international cryptology conference, Santa Barbara, California, USA, August 21-25, 1994, proceedings, Yvo G. Desmedt (ed.), 1994, Berlin, Springer, 1 vol. (XII-438 p.), Lecture notes in computer science, 3-540-58333-5
• Advances in Cryptology CRYPTO 94, Texte imprimé, 9783662209035
Table des matières:
  • Block Ciphers: Differential and Linear Cryptanalysis
  • The First Experimental Cryptanalysis of the Data Encryption Standard
  • Linear Cryptanalysis of the Fast Data Encipherment Algorithm
  • Differential-Linear Cryptanalysis
  • Linear Cryptanalysis Using Multiple Approximations
  • Schemes Based on New Problems
  • Hashing with SL 2
  • Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks
  • Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders
  • Signatures I
  • Designated Confirmer Signatures and Public-Key Encryption are Equivalent
  • Directed Acyclic Graphs, One-way Functions and Digital Signatures
  • An Identity-Based Signature Scheme with Bounded Life-Span
  • Implementation and Hardware Aspects
  • More Flexible Exponentiation with Precomputation
  • A Parallel Permutation Multiplier for a PGM Crypto-chip
  • Cryptographic Randomness from Air Turbulence in Disk Drives
  • Authentication and Secret Sharing
  • Cryptanalysis of the Gemmell and Naor Multiround Authentication Protocol
  • LFSR-based Hashing and Authentication
  • New Bound on Authentication Code with Arbitration
  • Multi-Secret Sharing Schemes
  • Zero-Knowledge
  • Designing Identification Schemes with Keys of Short Size
  • Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
  • Language Dependent Secure Bit Commitment
  • On the length of cryptographic hash-values used in identification schemes
  • Signatures II
  • Incremental Cryptography: The Case of Hashing and Signing
  • An Efficient Existentially Unforgeable Signature Scheme and its Applications
  • Combinatorics and its Applications
  • Bounds for Resilient Functions and Orthogonal Arrays
  • Tracing Traitors
  • Number Theory
  • Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
  • Fast Generation of Provable Primes Using Search in Arithmetic Progressions
  • Cryptanalysis and Protocol Failures
  • Attack on the Cryptographic Scheme NIKS-TAS
  • On the Risk of Opening Distributed Keys
  • Cryptanalysis of Cryptosystems based on Remote Chaos Replication
  • Pseudo-Random Generation
  • A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences
  • Block Ciphers: Design and Cryptanalysis
  • The Security of Cipher Block Chaining
  • A Chosen Plaintext Attack of the 16-round Khufu Cryptosystem
  • Ciphertext Only Attack for One-way function of the MAP using One Ciphertext
  • Pitfalls in Designing Substitution Boxes
  • Secure Computations and Protocols
  • A Randomness-Rounds Tradeoff in Private Computation
  • Secure Voting Using Partially Compatible Homomorphisms
  • Maintaining Security in the Presence of Transient Faults.