Abstract is missing.
- Keying the German Navy s EnigmaDavid Kahn. 2-5 [doi]
- Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General ContextYvo Desmedt. 6-16 [doi]
- On the Existence of Bit Commitment Schemes and Zero-Knowledge ProofsIvan Damgård. 17-27 [doi]
- Problems with the Normal Use of Cryptography for Providing Security on Unclassified NetworksRussell L. Brand. 30-34 [doi]
- The use of Encryption in Kerberos for Network AuthenticationJohn T. Kohl. 35-43 [doi]
- UNIX Password Security - Ten Years LaterDavid C. Feldmeier, Philip R. Karn. 44-63 [doi]
- Practical Problems with a Cryptographic Protection SchemeJonathan M. Smith. 64-73 [doi]
- The Smart Siskette - A Universal User Token and Personal Crypto-EnginePaul Barrett, Raymund Eisele. 74-79 [doi]
- On the Quadratic Spans of Periodic SequencesAgnes Hui Chan, Richard A. Games. 82-89 [doi]
- The Shortest Feedback Shift Register That Can Generate A Given SequenceCees J. A. Jansen, Dick E. Boekee. 90-99 [doi]
- Perfect Local Randomness in Pseudo-Random SequencesUeli M. Maurer, James L. Massey. 100-112 [doi]
- Sparse Pseudorandom DistributionsOded Goldreich, Hugo Krawczyk. 113-127 [doi]
- Bit Commitment Using Pseudo-RandomnessMoni Naor. 128-136 [doi]
- How to Predict Congruential GeneratorsHugo Krawczyk. 138-153 [doi]
- A Chosen Text Attack on The Modified Cryptographic Checksum Algorithm of Cohen and HuangBart Preneel, Antoon Bosselaers, René Govaerts, Joos Vandewalle. 154-163 [doi]
- On the Linear Consistency Test (LCT) in Cryptanalysis with ApplicationsKencheng Zeng, Chung-Huang Yang, T. R. N. Rao. 164-174 [doi]
- Batch RSAAmos Fiat. 175-185 [doi]
- On the Implementation of Elliptic Curve CryptosystemsAndreas Bender, Guy Castagnoli. 186-192 [doi]
- New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge ProofsMihir Bellare, Shafi Goldwasser. 194-211 [doi]
- Undeniable SignaturesDavid Chaum, Hans Van Antwerpen. 212-216 [doi]
- A Certified Digital SignatureRalph C. Merkle. 218-238 [doi]
- Efficient Identification and Signatures for Smart CardsClaus-Peter Schnorr. 239-252 [doi]
- A Signature with Shared Verification SchemeMarijke De Soete, Jean-Jacques Quisquater, Klaus Vedder. 253-262 [doi]
- On-Line/Off-Line Digital SchemesShimon Even, Oded Goldreich, Silvio Micali. 263-275 [doi]
- On the Classification of Idea Secret Sharing SchemesErnest F. Brickell, Daniel M. Davenport. 278-285 [doi]
- Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear SpaceChi-Sung Laih, Lein Harn, Jau-Yien Lee, Tzonelih Hwang. 286-298 [doi]
- Secret Sharing Over Infinite Domains (Extended Abstract)Benny Chor, Eyal Kushilevitz. 299-306 [doi]
- Threshold CryptosystemsYvo Desmedt, Yair Frankel. 307-315 [doi]
- Flexible Access Control with Master KeysGerald C. Chick, Stafford E. Tavares. 316-322 [doi]
- Key Distribution Protocol for Digital Mobile Communication SystemsMakoto Tatebayashi, Natsume Matsuzaki, David B. Newman Jr.. 324-334 [doi]
- A Key Exchange System Based on Real Quadratic FieldsJohannes Buchmann, Hugh C. Williams. 335-343 [doi]
- On Key Distribution SystemsYacov Yacobi, Zahava Shmuely. 344-355 [doi]
- SDNS Architecture and End-to-End EncryptionRuth Nelson, John Heimann. 356-366 [doi]
- A Survey of Hardware Implementation of RSA (Abstract)Ernest F. Brickell. 368-370 [doi]
- Modular Exponentiation Using Recursive Sums of ResiduesPaul A. Findlay, Brian A. Johnson. 371-386 [doi]
- A Fast Modular-multiplication Algorithm based on a Higher RadixHikaru Morita. 387-399 [doi]
- Addition Chain HeuristicsJurjen N. Bos, Matthijs J. Coster. 400-407 [doi]
- How Easy is Collision Search. New Results and Applications to DESJean-Jacques Quisquater, Jean-Paul Delescaille. 408-413 [doi]
- A Design Principle for Hash FunctionsIvan Damgård. 416-427 [doi]
- One Way Hash Functions and DESRalph C. Merkle. 428-446 [doi]
- Properties of Cryptosystem PGMSpyros S. Magliveras, Nasir D. Memon. 447-460 [doi]
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved HypothesesYuliang Zheng, Tsutomu Matsumoto, Hideki Imai. 461-480 [doi]
- Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic CashTatsuaki Okamoto, Kazuo Ohta. 481-496 [doi]
- Efficient Identification Schemes Using Two Prover Interactive ProofsMichael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson. 498-506 [doi]
- On the Concrete Complexity of Zero-Knowledge ProofsJoan Boyar, René Peralta. 507-525 [doi]
- Zero Knowledge Proofs of Knowledge in Two RoundsUriel Feige, Adi Shamir. 526-544 [doi]
- Minimum Resource Zero-Knowledge Proofs (Extended Abstract)Joe Kilian, Silvio Micali, Rafail Ostrovsky. 545-546 [doi]
- Non-Interactive Oblivious Transfer and SpplicationsMihir Bellare, Silvio Micali. 547-557 [doi]
- Multiparty Protocols Tolerating Half Faulty ProcessorsDonald Beaver. 560-572 [doi]
- Controlled Gradual Disclosure Schemes for Random Bits and Their ApplicationsRichard Cleve. 573-588 [doi]
- Multiparty Computation with Faulty MajorityDonald Beaver, Shafi Goldwasser. 589-590 [doi]
- The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from MajoritiesDavid Chaum. 591-602 [doi]
- On the Structure of Secret Key Exchange ProtocolsMihir Bellare, Lenore Cowen, Shafi Goldwasser. 604-605 [doi]
- An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract)Adi Shamir. 606-609 [doi]
- An Efficient Software Protection SchemeRafail Ostrovsky. 610-611 [doi]
- Good S-Boxes Are Easy To FindCarlisle M. Adams, Stafford E. Tavares. 612-615 [doi]
- Covert Distributed Processing with Computer VirusesSteve R. White. 616-619 [doi]
- Progress in Data Security StandardizationWyn L. Price. 620-623 [doi]
- The FEAL-8 Cryptosystem and a Call for AttackShoji Miyaguchi. 624-627 [doi]
- How to Explain Zero-Knowledge Protocols to Your ChildrenJean-Jacques Quisquater, Myriam Quisquater, Muriel Quisquater, Michaël Quisquater, Louis C. Guillou, Marie Annick Guillou, Gaïd Guillou, Anna Guillou, Gwenolé Guillou, Soazig Guillou, Thomas A. Berson. 628-631 [doi]