EUROCRYPT 1990: Aarhus, Denmark

Protocols

• Mike Burmester:
  Yvo Desmedt: All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions. 1-10
  
• George I. Davida, Yvo Desmedt, René Peralta:
  On the Importance of Memory Resources in the Security of Key Exchange Protocols. 11-15
  
• S. Shinozaki, Toshiya Itoh, Atsushi Fujioka, Shigeo Tsujii:
  Provably Secure Key-Updating Schemes in Identity-Based Systems. 16-30
  
• Bert den Boer:
  Oblivous Transfer Protecting Secrecy. 31-45
  
• Alfredo De Santis, Giuseppe Persiano:
  Public-Randomness in Public Key Cryptography. 46-62
  
• Ernest F. Brickell, Kevin S. McCurley:
  An Interactive Identification Scheme Based on Discrete Logarithms and Factoring. 63-71
  

Number-Theoretic Algorithms

• Arjen K. Lenstra, Mark S. Manasse:
  Factoring With Two Large Primes. 72-82
  
• Jan-Hendrik Evertse, Eugène van Heyst:
  Which New RSA Signatures Can Be Computed From Some Given RSA Signatures? 83-97
  
• Renate Scheidler, Johannes Buchmann, Hugh C. Williams:
  Implementation of a Key Exchange Protocol Using Some Real Quadratic Fields. 98-109
  
• François Morain:
  Distributed Primality Proving and the Primality of (2³⁵³⁹+1)/3. 110-123
  

Boolean Functions

• Sheelagh Lloyd:
  Properties of Binary Functions. 124-139
  
• Josef Pieprzyk:
  How to Construct Pseudorandom Permutations from Single Pseudorandom Functions. 140-150
  
• Kaisa Nyberg:
  Constructions of Bent Functions and Difference Sets. 151-160
  
• Bart Preneel, Werner Van Leekwijck, Luc Van Linden, René Govaerts, Joos Vandewalle:
  Propagation Characteristics of Boolean Functions. 161-173
  

Binary Sequences

• Harald Niederreiter:
  The Linear Complexity Profile and the Jump Complexity of Keystream Sequences. 174-188
  
• Zong-Duo Dai, Thomas Beth, Dieter Gollmann:
  Lower Bounds for the Linear Complexity of Sequences over Residue Rings. 189-195
  
• Cees J. A. Jansen:
  On the Construction of Run Permuted Sequences. 196-203
  
• Willi Meier, Othmar Staffelbach:
  Correlation Properties of Combiners with Memory in Stream Ciphers. 204-213
  
• Agnes Hui Chan, Mark Goresky, Andrew Klapper:
  Correlation Functions of Geometric Sequences. 214-221
  

Implementations

• Yacov Yacobi:
  Exponentiating Faster with Addition Chains. 222-229
  
• Stephen R. Dussé, Burton S. Kaliski Jr.:
  A Cryptographic Library for the Motorola DSP56000. 230-244
  
• Holger Orup, Erik Svendsen, Erik Andreasen:
  VICTOR an Efficient RSA Hardware Implementation. 245-252
  
• Charles H. Bennett, François Bessette, Gilles Brassard, Louis Salvail, John A. Smolin:
  Experimental Quantum Cryptography. 253-265
  

Combinatorial Schemes

• Ingemar Ingemarsson, Gustavus J. Simmons:
  A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party. 266-282
  
• Andrea Sgarro:
  Lower Bounds for Authentication Codes With Splitting. 283-293
  
• Albrecht Beutelspacher, Ute Rosenbaum:
  Essentially l-Fold Secure Authentication Systems. 294-305
  
• Ben J. M. Smeets, Peter Vanroose, Zhe-xian Wan:
  On the Construction of Authentication Codes With Secrecy and Codes Withstanding Spoofing Attacks of Order L >= 2. 306-312
  

Cryptoanalysis

• Jacques Stern, Philippe Toffin:
  Cryptanalysis of a Public-Key Cryptosystem Based on Approximations by Rational Numbers. 313-317
  
• Paul C. van Oorschot, Michael J. Wiener:
  A Known Plaintext Attack on Two-Key Triple Encryption. 318-325
  
• Shoji Miyaguchi, Kazuo Ohta, Masahiko Iwata:
  Confirmation that Some Hash Functions Are Not Collision Free. 326-343
  
• Fritz Bauspieß, Hans-Joachim Knobloch, Peer Wichmann:
  Inverting the Pseudo Exponentiation. 344-351
  

New Cryptosystems

• Tzonelih Hwang:
  Cryptosystem for Group Oriented Cryptography. 352-360
  
• Ueli M. Maurer:
  A Provably-Secure Strongly-Randomized Cipher. 361-373
  
• Kaoru Kurosawa, Yutaka Katayama, Wakaha Ogata, Shigeo Tsujii:
  General Public Key Residue Cryptosystems and Mental Poker Protocols. 374-388
  
• Xuejia Lai, James L. Massey:
  A Proposal for a New Block Encryption Standard. 389-404
  
• Valtteri Niemi:
  A New Trapdoor in Knapsacks. 405-411
  

Signatures and Authentication

• Alfredo De Santis, Moti Yung:
  On the Design of Provably Secure Cryptographic Hash Functions. 412-431
  
• H. Ong, Claus-Peter Schnorr:
  Fast Signature Generation With a Fiat Shamir-Like Scheme. 432-440
  
• Gerrit Bleumer, Birgit Pfitzmann, Michael Waidner:
  A Remark on a Signature Scheme Where Forgery Can Be Proved. 441-445
  
• Kazuo Ohta, Tatsuaki Okamoto, Kenji Koyama:
  Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme. 446-457
  
• David Chaum:
  Zero-Knowledge Undeniable Signatures. 458-464
  
• Louis C. Guillou, Jean-Jacques Quisquater, Michael Walker, Peter Landrock, Caroline Shafer:
  Precautions Taken Against Various Potential Attacks in ISO/IEC DIS 9796 "Digital Signature Scheme Giving Message Recovery". 465-473
  

Rump Session: Impromptu Talks

• Josep Domingo-Ferrer:
  Software Run-Time Protection: A Cryptographic Issue. 474-480
  
• Marc Girault:
  An Identity-based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number. 481-486
  
• Jovan Dj. Golic, Miodrag J. Mihaljevic:
  A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparion Approach. 487-491
  
• Burton S. Kaliski Jr.:
  The MD4 Message Digest Algorithm (Abstract). 492
  
• Mike Burmester:
  A Remark on the Efficiency of Identification Schemes. 493-495
  
• Gisela Meister:
  On an Implementation of the Mohan-Adiga Algorithm. 496-500
  

Last update Wed Feb 15 05:01:21 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page