Abstract is missing.
- Differential Cryptanalysis of DES-like CryptosystemsEli Biham, Adi Shamir. 2-21 [doi]
- A Statistical Attack of the FEAL-8 CryptosystemHenri Gilbert, Guy Chassé. 22-33 [doi]
- An Improved Linear Syndrome Algorithm in Cryptanalysis With ApplicationsKencheng Zeng, Chung-Huang Yang, T. R. N. Rao. 34-47 [doi]
- Quantum Bit Commitment and Coin Tossing ProtocolsGilles Brassard, Claude Crépeau. 49-61 [doi]
- Security with Low Communication OverheadDonald Beaver, Joan Feigenbaum, Joe Kilian, Phillip Rogaway. 62-76 [doi]
- Fair Computation of General Functions in Presence of Immoral MajorityShafi Goldwasser, Leonid A. Levin. 77-93 [doi]
- One-Way Group ActionsGilles Brassard, Moti Yung. 94-107 [doi]
- Solving Large Sparse Linear Systems over Finite FieldsBrian A. LaMacchia, Andrew M. Odlyzko. 109-133 [doi]
- On the Computation of Discrete Logarithms in Class GroupsJohannes Buchmann, Stephan Düllmann. 134-139 [doi]
- Matrix Extensions of the RSA AlgorithmChih-Chwen Chuang, James George Dunham. 140-155 [doi]
- Constructing Elliptic Curve Cryptosystems in Characteristic 2Neal Koblitz. 156-167 [doi]
- Identification Tokens - or: Solving the Chess Grandmaster ProblemThomas Beth, Yvo Desmedt. 169-177 [doi]
- Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter s Attacks (Extended Abstract)Yvo Desmedt, Moti Yung. 177-188 [doi]
- Convertible Undeniable SignaturesJoan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen. 189-205 [doi]
- Unconditionally Secure Digital SignaturesDavid Chaum, Sandra Roijakkers. 206-214 [doi]
- Geometric Shared Secret and/or Shared Control SchemesGustavus J. Simmons. 216-241 [doi]
- Some Improved Bounds on the Information Rate of Perfect Secret Sharing SchemesErnest F. Brickell, Douglas R. Stinson. 242-252 [doi]
- Collective Coin Tossing Without Assumptions nor BroadcastingSilvio Micali, Tal Rabin. 253-266 [doi]
- A Key Distribution Paradox Yacov Yacobi. 268-273 [doi]
- A Modular Approach to Key DistributionWalter Fumy, Michael Munzert. 274-283 [doi]
- Structural Properties of One-way Hash FunctionsYuliang Zheng, Tsutomu Matsumoto, Hideki Imai. 285-302 [doi]
- The MD4 Message Digest AlgorithmRonald L. Rivest. 303-311 [doi]
- Achieving Zero-Knowledge RobustlyJoe Kilian. 313-325 [doi]
- Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract)Donald Beaver, Joan Feigenbaum, Victor Shoup. 326-338 [doi]
- Multi-Language Zero Knowledge Interactive Proof SystemsKaoru Kurosawa, Shigeo Tsujii. 339-352 [doi]
- Publicly Verifiable Non-Interactive Zero-Knowledge ProofsDror Lapidot, Adi Shamir. 353-365 [doi]
- Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover SystemsAlfredo De Santis, Moti Yung. 366-377 [doi]
- Interactive Proofs with Provable Security Against Honest VerifiersJoe Kilian. 378-392 [doi]
- Adi Shamir: On the Universality of the Next Bit TestA. W. Schrift. 394-408 [doi]
- A Universal Statistical Test for Random Bit GeneratorsUeli M. Maurer. 409-420 [doi]
- On the Impossibility of Private Key Cryptography with Weakly Random KeysJames L. McInnes, Benny Pinkas. 421-435 [doi]
- How to Time-Stamp a Digital DocumentStuart Haber, W. Scott Stornetta. 437-455 [doi]
- How to Utilize the Randomness of Zero-Knowledge ProofsTatsuaki Okamoto, Kazuo Ohta. 456-475 [doi]
- Fast Software Encryption FunctionsRalph C. Merkle. 476-501 [doi]
- CORSAIR: A SMART Card for Public Key CryptosystemsDominique de Waleffe, Jean-Jacques Quisquater. 502-513 [doi]
- Fast Checkers for CryptographyKireeti Kompella, Leonard M. Adleman. 515-529 [doi]
- Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.SRichard Cleve. 530-544 [doi]
- The REDOC II CryptosystemThomas W. Cusick, Michael C. Wood. 545-563 [doi]
- A Recursive Construction Method of S-boxes Satisfying Strict Avalanche CriterionKwangjo Kim, Tsutomu Matsumoto, Hideki Imai. 564-574 [doi]
- A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete LogarithmsPaul C. van Oorschot. 576-581 [doi]
- Nonlinear Parity Circuits and their Cryptographic ApplicationsKenji Koyama, Routo Terada. 582-600 [doi]
- Cryptographic Significance of the Carry for Ciphers Based on Integer AdditionOthmar Staffelbach, Willi Meier. 601-614 [doi]
- Computation of Discrete Logarithms in Prime Fields (Extended Abstract)Brian A. LaMacchia, Andrew M. Odlyzko. 616-618 [doi]
- Systolic Modular MultiplicationShimon Even. 619-624 [doi]
- Finding Four Million Large Random PrimesRonald L. Rivest. 625-626 [doi]
- The FEAL Cipher FamilyShoji Miyaguchi. 627-638 [doi]
- Discrete-Log With Compressible ExponentsYacov Yacobi. 639-643 [doi]