13. CRYPTO 1993: Santa Barbara, California, USA
Douglas R. Stinson (Ed.): Advances in Cryptology - CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings. Springer 1994 Lecture Notes in Computer Science ISBN 3-540-57766-1
Cryptosystems
- Adi Shamir: Efficient Signature Schemes Based on Birational Permutations. 1-12
- Jacques Stern: A New Identification Scheme Based on Syndrome Decoding. 13-21
Stream Ciphers and Cryptographic Functions
- Richard Taylor: An Integrity Check Value Algorithm for Stream Ciphers. 40-48
- Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng: Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract). 49-60
Proof Systems and Zero-knowledge
- Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii: A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. 61-72
- Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: Secret Sharing and Perfect Zero Knowledge. 73-84
- Ivan Damgård: Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract). 100-109
Secret Sharing
- Carlo Blundo, Antonella Cresti, Alfredo De Santis, Ugo Vaccaro: Fully Dynamic Secret Sharing Schemes. 110-125
- Hugo Krawczyk: Secret Sharing Made Short. 136-146
Number Theory and Algorithms
- Leonard M. Adleman, Jonathan DeMarrais: A Subexponential Algorithm for Discrete Logarithms over All Finite Fields. 147-158
- Thomas F. Denny, Bruce Dodson, Arjen K. Lenstra, Mark S. Manasse: On the Factorization of RSA-120. 166-174
- Antoon Bosselaers, René Govaerts, Joos Vandewalle: Comparison of Three Modular Reduction Functions. 175-186
Differential Cryptoanalysis
- Bart Preneel, Marnix Nuttin, Vincent Rijmen, Johan Buelens: Cryptanalysis of the CFB Mode of the DES with a Reduced Number of Rounds. 212-223
Complexity Theory
- Ivan Damgård, Torben P. Pedersen, Birgit Pfitzmann: On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures. 250-265
- Matthew K. Franklin, Stuart Haber: Joint Encryption and Message-Efficient Secure Computation. 266-277
- Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton: Cryptographic Primitives Based on Hard Learning Problems. 278-291
Applications
- Niels Ferguson: Extensions of Single-term Coins. 292-301
- Stefan Brands: Untraceable Off-line Cash in Wallets with Observers (Extended Abstract). 302-318
Authentication Codes
- Jürgen Bierbrauer, Thomas Johansson, Gregory Kabatianskii, Ben J. M. Smeets: On Families of Hash Functions via Geometric Codes and Concatenation. 331-342
- Thomas Johansson: On the Construction of Perfect Authentication Codes that Permit Arbitration. 343-354
Hash Functions
- Bart Preneel, René Govaerts, Joos Vandewalle: Hash Functions Based on Block Ciphers: A Synthetic Approach. 368-378
- Walter Hohl, Xuejia Lai, Thomas Meier, Christian Waldvogel: Security of Iterated Hash Functions Based on Block Ciphers. 379-390
Cryptoanalysis
- Luke O'Connor: On the Distribution of Characteristics in Composite Permutations. 403-412
- Chae Hoon Lim, Pil Joong Lee: Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks. 420-434
- Don Coppersmith, Jacques Stern, Serge Vaudenay: Attacks on the Birational Permutation Signature Schemes. 435-443
Key Distribution
- Frank Thomson Leighton, Silvio Micali: Secret-Key Agreement without Public-Key Cryptography. 456-479
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team