Advances in Cryptology — EUROCRYPT ’90: Workshop on the Theory and Application of Cryptographic Techniques Aarhus, Denmark, May 21–24, 1990 Proceedings

All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions....Pages 1-10
On the Importance of Memory Resources in the Security of Key Exchange Protocols....Pages 11-15
Provably Secure Key-Updating Schemes in Identity-Based Systems....Pages 16-30
Oblivious transfer protecting secrecy....Pages 31-45
Public-Randomness in Public-Key Cryptography....Pages 46-62
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring....Pages 63-71
Factoring with two large primes....Pages 72-82
Which new RSA signatures can be computed from some given RSA signatures?....Pages 83-97
Implementation of a Key Exchange Protocol Using Real Quadratic Fields....Pages 98-109
Distributed Primality Proving and the Primality of (2 3539 + 1)/3....Pages 110-123
Properties of binary functions....Pages 124-139
How to Construct Pseudorandom Permutations from Single Pseudorandom Functions....Pages 140-150
Constructions of bent functions and difference sets....Pages 151-160
Propagation Characteristics of Boolean Functions....Pages 161-173
The Linear Complexity Profile and the Jump Complexity of Keystream Sequences....Pages 174-188
Lower Bounds for the Linear Complexity of Sequences over Residue Rings....Pages 189-195
On the Construction of Run Permuted Sequences....Pages 196-203
Correlation Properties of Combiners with Memory in Stream Ciphers (Extended Abstract)....Pages 204-213
Correlation Functions of Geometric Sequences....Pages 214-221
Exponentiating Faster with Addition Chains....Pages 222-229
A Cryptographic Library for the Motorola DSP56000....Pages 230-244
VICTOR an efficient RSA hardware implementation....Pages 245-252
Experimental Quantum Cryptography....Pages 253-265
A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted Party....Pages 266-282
Lower Bounds for Authentication Codes with Splitting....Pages 283-293
Essentially ℓ -fold secure authentication systems....Pages 294-305
On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2....Pages 306-312
Cryptanalysis of a public-key cryptosystem based on approximations by rational numbers....Pages 313-317
A Known-Plaintext Attack on Two-Key Triple Encryption....Pages 318-325
Confirmation that Some Hash Functions Are Not Collision Free....Pages 326-343
Inverting the Pseudo Exponentiation....Pages 344-351
Cryptosystem for Group Oriented Cryptography....Pages 352-360
A Provably-Secure Strongly-Randomized Cipher....Pages 361-373
General public key residue cryptosystems and mental poker protocols....Pages 374-388
A Proposal for a New Block Encryption Standard....Pages 389-404
A new trapdoor in knapsacks....Pages 405-411
On the Design of Provably-Secure Cryptographic Hash Functions....Pages 412-431
Fast Signature Generation with a Fiat Shamir — Like Scheme....Pages 432-440
A Remark on a Signature Scheme Where Forgery can be Proved....Pages 441-445
Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme....Pages 446-457
Zero-Knowledge Undeniable Signatures (extended abstract)....Pages 458-464
Precautions taken against various potential attacks....Pages 465-473
Software Run-Time Protection: A Cryptographic Issue....Pages 474-480
An identity-based identification scheme based on discrete logarithms modulo a composite number....Pages 481-486
A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparison Approach....Pages 487-491
The MD4 Message Digest Algorithm....Pages 492-492
A remark on the efficiency of identification schemes....Pages 493-495
On an Implementation of the Mohan-Adiga Algorithm....Pages 496-500