Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications by Conference
Advances in Cryptology - CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings
Page
Title
1-12
Efficient Signature Schemes Based on Birational Permutations
13-21
A New Identification Scheme Based on Syndrome Decoding
22-39
The Shrinking Generator
40-48
An Integrity Check Value Algorithm for Stream Ciphers
49-60
Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract)
61-72
A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity
73-84
Secret Sharing and Perfect Zero Knowledge
85-99
On Message Proof Systems with Known Space Verifiers
100-109
Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract)
110-125
Fully Dynamic Secret Sharing Schemes
126-135
Multisecret Threshold Schemes
136-146
Secret Sharing Made Short
147-158
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
159-165
An Implementation of the General Number Field Sieve
166-174
On the Factorization of RSA-120
175-186
Comparison of Three Modular Reduction Functions
187-199
Differtial Cryptanalysis of Lucifer
200-211
Differential Attack on Message Authentication Codes
212-223
Cryptanalysis of the CFB Mode of the DES with a Reduced Number of Rounds
224-231
Weak Keys for IDEA
232-249
Entity Authentication and Key Distribution
250-265
On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
266-277
Joint Encryption and Message-Efficient Secure Computation
278-291
Cryptographic Primitives Based on Hard Learning Problems
292-301
Extensions of Single-term Coins
302-318
Untraceable Off-line Cash in Wallets with Observers (Extended Abstract)
319-330
Discreet Solitary Games
331-342
On Families of Hash Functions via Geometric Codes and Concatenation
343-354
On the Construction of Perfect Authentication Codes that Permit Arbitration
355-367
Codes for Interactive Authentication
368-378
Hash Functions Based on Block Ciphers: A Synthetic Approach
379-390
Security of Iterated Hash Functions Based on Block Ciphers
391-402
Improved Algorithms for the Permuted Kernel Problem
403-412
On the Distribution of Characteristics in Composite Permutations
413-420
Remark on the Threshold RSA Signature Scheme
420-434
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
435-443
Attacks on the Birational Permutation Signature Schemes
444-455
Interaction in Key Distribution Schemes (Extended Abstract)
456-479
Secret-Key Agreement without Public-Key Cryptography
480-491
Broadcast Encryption