Abstract is missing.
- Multifeature Security through Homomorphic EncryptionThomas Beth. 1-17
- Multiplicative Non-abelian Sharing Schemes and their Application to Threshold CryptographyYvo Desmedt, Giovanni Di Crescenzo, Mike Burmester. 21-32
- Lower Bound on the Size of Shares of Nonperfect Secret Sharing SchemesKoji Okada, Kaoru Kurosawa. 33-41
- On Sharing Many Secrets (Extended Abstract)Wen-Ai Jackson, Keith M. Martin, Christine M. O Keefe. 42-54
- Combinatorial Interpretation of Secret Sharing SchemesKaoru Kurosawa, Koji Okada. 55-64
- A Correlation Attack on the Binary Sequence Generators with Time-Varying Output FunctionMiodrag J. Mihaljevic. 67-79
- On the Linear Complexity of Nonlinear Filtered PN-sequencesAmparo Fúster-Sabater, Pino Caballero-Gil. 80-90
- Intrinsic Statistical Weakness of Keystream GeneratorsJovan Dj. Golic. 91-103
- Semi-bent FunctionsSeongtaek Chee, Sangjin Lee, Kwangjo Kim. 107-118
- Structures of Cryptographic Functions with Strong Avalanche Characteristics (Extended Abstract)Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng. 119-132
- Formal Verification of Cryptographic Protocols: A SurveyCatherine Meadows. 135-150
- Efficient Electronic Money (Extended Abstract)Yacov Yacobi. 153-163
- How to Prevent Buying of Votes in Computer ElectionsValtteri Niemi, Ari Renvall. 164-170
- Design and Analysis of Key Exchange Protocols via Secure Channel IdentificationColin Boyd, Wenbo Mao. 171-181
- Zero-Knowledge Proofs af Computational Power in the Shared String ModelAlfredo De Santis, Tatsuaki Okamoto, Giuseppe Persiano. 182-192
- Information Security Aspects of Spread Spectrum SystemsHideki Imai. 193-208
- Combinatorial Structure of A-codes with r-fold SecurityReihaneh Safavi-Naini, L. Tombak. 211-223
- Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their ApplicationsPatrick Horster, Markus Michels, Holger Petersen. 224-237
- A Digital Signature Scheme Based on Linear Error-correcting Block CodesMohssen Alabbadi, Stephen B. Wicker. 238-248
- Secure Acceleration of DSS Signatures Using Insecure ServerPhilippe Béguin, Jean-Jacques Quisquater. 249-259
- The Magic Words are Squeamish OssifrageDerek Atkins, Michael Graff, Arjen K. Lenstra, Paul C. Leyland. 263-277
- Cryptanalysis of Multiple Modes of OperationEli Biham. 278-292
- Linear Cryptanalysis of LOKI and s:::2:::DESToshio Tokita, Tohru Sorimachi, Mitsuru Matsui. 293-303
- Collisions and Inversions for Damgård s Whole Hash FunctionJacques Patarin. 307-321
- Attacking the SL::2:: Hashing SchemeChris Charnes, Josef Pieprzyk. 322-330
- Security of the Center in Key Distribution SchemesKaoru Kurosawa, Koji Okada, Keiichi Sakano. 333-341
- Incidence Structures for Key Sharing (Extended Abstract)Tsutomu Matsumoto. 342-353
- A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete LogarithmsPeter Smith, Christopher Skinner. 357-364
- Higher Radix Nonrestoring Modular Multiplication Algorithm and Public-key LSI Architecture with Limited Hardware ResourcesMasayuki Abe, Hikaru Morita. 365-375
- Low Exponent Attack against Elliptic Curve RSAKaoru Kurosawa, Koji Okada, Shigeo Tsujii. 376-383
- A Unified Markow Approach to Differential and Linear CryptanalysisLuke O Connor, Jovan Dj. Golic. 387-397
- How to Strengthen DES Using Existing HardwareEli Biham, Alex Biryukov. 398-412
- Some Cryptographic Properties of Exponential FunctionsXingong Chang, Zong-Duo Dai, Guang Gong. 415-418
- Factoring: The DNA SolutionDonald Beaver. 419-423
- Can One Design a Signature Scheme Based on Error-Correctin Codes?Jacques Stern. 424-426
- DESV-1: A Variation of the Data Encryption Standard (DES)Gary Carter, Andrew Clark, Lauren Nielsen. 427-430