International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT '90, Workshop on the Theory and Application of of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990, Proceedings

Page	Title
1-10	Yvo Desmedt: All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions
11-15	On the Importance of Memory Resources in the Security of Key Exchange Protocols
16-30	Provably Secure Key-Updating Schemes in Identity-Based Systems
31-45	Oblivous Transfer Protecting Secrecy
46-62	Public-Randomness in Public Key Cryptography
63-71	An Interactive Identification Scheme Based on Discrete Logarithms and Factoring
72-82	Factoring With Two Large Primes
83-97	Which New RSA Signatures Can Be Computed From Some Given RSA Signatures?
98-109	Implementation of a Key Exchange Protocol Using Some Real Quadratic Fields
110-123	Distributed Primality Proving and the Primality of (2³⁵³⁹+1)/3
124-139	Properties of Binary Functions
140-150	How to Construct Pseudorandom Permutations from Single Pseudorandom Functions
151-160	Constructions of Bent Functions and Difference Sets
161-173	Propagation Characteristics of Boolean Functions
174-188	The Linear Complexity Profile and the Jump Complexity of Keystream Sequences
189-195	Lower Bounds for the Linear Complexity of Sequences over Residue Rings
196-203	On the Construction of Run Permuted Sequences
204-213	Correlation Properties of Combiners with Memory in Stream Ciphers
214-221	Correlation Functions of Geometric Sequences
222-229	Exponentiating Faster with Addition Chains
230-244	A Cryptographic Library for the Motorola DSP56000
245-252	VICTOR an Efficient RSA Hardware Implementation
253-265	Experimental Quantum Cryptography
266-282	A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party
283-293	Lower Bounds for Authentication Codes With Splitting
294-305	Essentially l-Fold Secure Authentication Systems
306-312	On the Construction of Authentication Codes With Secrecy and Codes Withstanding Spoofing Attacks of Order L >= 2
313-317	Cryptanalysis of a Public-Key Cryptosystem Based on Approximations by Rational Numbers
318-325	A Known Plaintext Attack on Two-Key Triple Encryption
326-343	Confirmation that Some Hash Functions Are Not Collision Free
344-351	Inverting the Pseudo Exponentiation
352-360	Cryptosystem for Group Oriented Cryptography
361-373	A Provably-Secure Strongly-Randomized Cipher
374-388	General Public Key Residue Cryptosystems and Mental Poker Protocols
389-404	A Proposal for a New Block Encryption Standard
405-411	A New Trapdoor in Knapsacks
412-431	On the Design of Provably Secure Cryptographic Hash Functions
432-440	Fast Signature Generation With a Fiat Shamir-Like Scheme
441-445	A Remark on a Signature Scheme Where Forgery Can Be Proved
446-457	Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme
458-464	Zero-Knowledge Undeniable Signatures
465-473	Precautions Taken Against Various Potential Attacks in ISO/IEC DIS 9796 "Digital Signature Scheme Giving Message Recovery"
474-480	Software Run-Time Protection: A Cryptographic Issue
481-486	An Identity-based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number
487-491	A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparion Approach
492	The MD4 Message Digest Algorithm (Abstract)
493-495	A Remark on the Efficiency of Identification Schemes
496-500	On an Implementation of the Mohan-Adiga Algorithm