## Advances in Cryptology — CRYPTO ’93: 13th Annual International Cryptology Conference Santa Barbara, California, USA August 22–26, 1993 ProceedingsThe CRYPTO ’93 conference was sponsored by the International Association for Cryptologic Research (IACR) and Bell-Northern Research (a subsidiary of Northern Telecom), in co-operation with the IEEE Computer Society Technical Committee. It took place at the University of California, Santa Barbara, from August 22-26, 1993. This was the thirteenth annual CRYPTO conference, all of which have been held at UCSB. The conference was very enjoyable and ran very of the General Chair, Paul Van Oorschot. smoothly, largely due to the efforts It was a pleasure working with Paul throughout the months leading up to the conference. There were 136 submitted papers which were considered by the Program Committee. Of these, 38 were selected for presentation at the conference. There was also one invited talk at the conference, presented by Miles Smid, the title of which was “A Status Report On the Federal Government Key Escrow System.” The conference also included the customary Rump Session, which was presided over by Whit Diffie in his usual inimitable fashion. Thanks again to Whit for organizing and running the Rump session. This year, the Rump Session included an interesting and lively panel discussion on issues pertaining to key escrowing. Those taking part were W. Diffie, J. Gilmore, S. Goldwasser, M. Hellman, A. Herzberg, S. Micali, R. Rueppel, G. Simmons and D. Weitzner. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

13 | |

The Shrinking Generator | 22 |

An Integrity Check Value Algorithmfor Stream Cipher | 40 |

Nonlinearly Balanced Boolean Functions andTheir Propagation CharacteristicsU Extended Abstract | 49 |

A Low CommunicationCompetitive Interactive Proof System forPromised Quadratic Residuosity | 61 |

Secret Sharing and Perfect Zero Knowledge | 73 |

One Message Proof Systems with Known SpaceVerifiers | 85 |

On the Existence of Statistically Hiding BitCommitment Schemes and FailStop Signatures | 250 |

Joint Encrypt ion and MessageEfficient SecureComputation | 266 |

Cryptographic Primitives Based on HardLearning Problems | 278 |

Extensions of Singleterm Coins | 292 |

Untraceable Offline Cashin Wallet with Observers | 302 |

Discreet Solitary Games | 319 |

On Families of Hash Functionsvia Geometric Codes and Concatenation | 331 |

On the Construction ofPerfect Authentication Codesthat Permit Arbitration | 343 |

Interactive Hashing can SimplifyZeroKnowledge Protocol Design WithoutComputational Assumptions | 100 |

Fully Dynamic Secret SharingSchemes | 110 |

Multisecret Threshold Schemes | 126 |

Secret Sharing Made Short | 136 |

A Subexponential Algorithm for DiscreteLogarithms over All Finite Fields | 147 |

An implementation of the general number fieldsieve | 159 |

On the factorization of RSA120 | 166 |

Comparison of three modular reductionfunctions | 175 |

Differential Cryptanalysis of Lucifer | 187 |

Differential Attack onMessage Authentication Codes | 200 |

Cryptanalysis of the CFB mode ofthe DES with a reduced number of rounds | 212 |

Weak Keys for IDEA | 224 |

Entity Authentication and Key Distribution | 232 |

Codes for Interactive Authentication | 355 |

a synthetic approach | 368 |

Security of Iterated Hash FunctionsBased on Block Ciphers | 379 |

Improved Algorithms forthe Permuted Kernel Problem | 391 |

On the Distribution of Characteristicsin Composite Permutations | 403 |

Remark on the Threshold RSASignature Scheme | 413 |

Another Method for Attaining SecurityAgainst Adaptively Chosen Ciphertext Attacks | 420 |

Attacks on the Birational PermutationSignature Schemes | 435 |

Interaction in Key Distribution SchemesExtended Abstract | 444 |

SecretKey Agreement without PublicKeyCryptographyExtended Abstract | 456 |

Broadcast Encryption | 480 |

492 | |

### Other editions - View all

### Common terms and phrases

access structures Advances in Cryptology adversary algorithm assume assumption authentication Berlin Heidelberg 1994 bit commitment block cipher broadcast message characteristic chosen ciphertext attacks codes coin collision attack commitment scheme common secret key complexity Computer Science construction CRYPTO cryptographic D.R. Stinson decryption defined Definition denote differential attack Differential Cryptanalysis digital signature discrete logarithms distribution distribution ensemble efficient equations exists exor factor free-start given input integer interactive proof system iterated hash function joint encryption key bits Lecture Notes Lemma length LFSR linear LNCS lower bound m-bit Micali modulo non-interactive nonlinearity Notes in Computer one-way functions oracle output participants permutation polynomial probabilistic probability problem protocol prove pseudorandom quadratic random result round function S-boxes scheme with broadcast secret sharing scheme sends sequence Shamir signature scheme stream cipher string subkey subset Theorem transformation variables vector verifier zero zero-knowledge proof