EUROCRYPT 1999

PRAGUE, CZECH REPUBLIC

J. Stern (Ed.): Advances in Cryptology- EUROCRYPT'99: International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 1999. Proceedings. Lecture Notes in Computer Science, Volume 1592, Springer 1999, ISBN 3-540-65889-0

Cryptanalysis I

  • Dan Boneh and Glenn Durfee: Cryptanalysis of RSA with Private Key d Less than N0.292 p. 1
  • Eli Biham, Alex Biryukov, Adi Shamir: Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials p. 12

Hash Functions

  • Wim Nevelsteen and Bart Preneel: Software Performance of Universal Hash Functions p. 24

Foundations I

  • Yevgeniy Dodis and Silvio Micali: Lower Bounds for Oblivious Transfer Reductions p. 42
  • Ivan Damgård, Joe Kilian, Louis Salvail: On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions p. 56
  • Giovanni Di Crescenzo, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan: Conditional Oblivious Transfer and Timed-Release Encryption p. 74

Public Key

  • Ran Canetti and Shafi Goldwasser: An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack: (Extended Abstract) p. 90
  • Jan Camenisch and Markus Michels: Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes p. 107
  • Rosario Gennaro, Shai Halevi, Tal Rabin: Secure Hash-and-Sign Signatures Without the Random Oracle p. 123

Watermarking and Fingerprinting

  • Funda Ergun, Joe Kilian, Ravi Kumar: A Note on the Limits of Collusion-Resistant Watermarks p. 140
  • Birgit Pfitzmann and Ahmad-Reza Sadeghi: Coin-Based Anonymous Fingerprinting p. 150

Elliptic Curves

  • Nigel P. Smart: On the Performance of Hyperelliptic Cryptosystems p. 165
  • Tetsutaro Kobayashi, Hikaru Morita, Kunio Kobayashi, et al.: Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic p. 176
  • Ryuichi Harasawa, Junji Shikata, Joe Suzuki, et al.: Comparing the MOV and FR Reductions in Elliptic Curve Cryptography p. 190

New Schemes

  • Aviad Kipnis, Jacques Patarin, Louis Goubin: Unbalanced Oil and Vinegar Signature Schemes p. 206
  • Pascal Paillier: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes p. 223
  • David Pointcheval: New Public Key Cryptosystems Based on the Dependent-RSA Problems p. 239

Block Ciphers

  • Serge Vaudenay: Resistance Against General Iterated Attacks p. 255
  • Philip Hawkes and Luke O'Connor: XOR and Non-XOR Differential Probabilities p. 272
  • Jung Hee Cheon, Seongtaek Chee, Choonsik Park: S-boxes with Controllable Nonlinearity p. 286

Distributed Cryptography

  • Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems p. 295
  • Ronald Cramer, Ivan Damgård, Stefan Dziembowski, et al.: Efficient Multiparty Computations Secure Against an Adaptive Adversary p. 311
  • Moni Naor, Benny Pinkas, Omer Reingold: Distributed Pseudo-random Functions and KDCs p. 327

Cryptanalysis II

  • Thomas Johansson and Fredrik Jönsson: Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes p. 347
  • Lars R. Knudsen and Willi Meier: Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem p. 363

Tools from Related Areas

  • Luke O'Connor: An Analysis of Exponentiation Based on Formal Languages p. 375
  • Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key: (Extended Abstract) p. 389

Foundations II

  • Christian Cachin, Silvio Micali, Markus Stadler: Computationally Private Information Retrieval with Polylogarithmic Communication p. 402
  • Ransom Richardson and Joe Kilian: On the Concurrent Composition of Zero-Knowledge Proofs p. 415
  • Marc Fischlin: Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications p. 432

Broadcast and Multicast

  • Yongge Wang and Yvo Desmedt: Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question p. 446
  • Ran Canetti, Tal Malkin, Kobbi Nissim: Efficient Communication-Storage Tradeoffs for Multicast Encryption p. 459