Abstract is missing.
- A Calculus for Access Control in Distributed SystemsMartín Abadi, Michael Burrows, Butler W. Lampson, Gordon D. Plotkin. 1-23 [doi]
- Deriving the Complete Knowledge of Participants in Cryptographic Protocols (Extended Abstract)Marie-Jeanne Toussaint. 24-43 [doi]
- Systematic Design of Two-Party Authentication ProtocolsRay Bird, Inder S. Gopal, Amir Herzberg, Philippe A. Janson, Shay Kutten, Refik Molva, Moti Yung. 44-61 [doi]
- Combinatorial Characterizations of Authentication CodesDouglas R. Stinson. 62-73 [doi]
- Universal Hashing and Authentication CodesDouglas R. Stinson. 74-85 [doi]
- On Correlation-Immune FunctionsPaul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier. 86-100 [doi]
- On the Size of Shares for Secret Sharing SchemesRenato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro. 101-113 [doi]
- On Verification in Secret SharingCynthia Dwork. 114-128 [doi]
- Non-Interactive and Information-Theoretic Secure Verifiable Secret SharingTorben P. Pedersen. 129-140 [doi]
- Multiparty Secret Key Exchange Using a Random Deal of CardsMichael J. Fischer, Rebecca N. Wright. 141-155 [doi]
- Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and LuciferEli Biham, Adi Shamir. 156-171 [doi]
- A Known Plaintext Attack of FEAL-4 and FEAL-6Anne Tardy-Corfdir, Henri Gilbert. 172-181 [doi]
- A Switching Closure Test to Analyze CryptosystemsHikaru Morita, Kazuo Ohta, Shoji Miyaguchi. 183-193 [doi]
- An Attack on the Last Two Rounds of MD4Bert den Boer, Antoon Bosselaers. 194-203 [doi]
- The Cryptoanalysis of a New Public-Key Cryptosystem Based on Modular KnapsacksYeow Meng Chee, Antoine Joux, Jacques Stern. 204-212 [doi]
- A One-Round, Two-Prover, Zero-Knowledge Protocol for NPDror Lapidot, Adi Shamir. 213-224 [doi]
- Interactive Proofs with Space Bounded ProversJoe Kilian, Ronitt Rubinfeld. 225-231 [doi]
- Functional Inversion and Communication ComplexityShang-Hua Teng. 232-241 [doi]
- The Use of Interaction in Public Cryptosystems (Extended Abstract)Steven Rudich. 242-251 [doi]
- New Public-Key Schemes Based on Elliptic Curves over the Ring Z::n::Kenji Koyama, Ueli M. Maurer, Tatsuaki Okamoto, Scott A. Vanstone. 252-266 [doi]
- Efficient Algorithms for the Construction of Hyperelliptic CryptosystemsTatsuaki Okamoto, Kouichi Sakurai. 267-278 [doi]
- CM-Curves with Good Cryptographic PropertiesNeal Koblitz. 279-287 [doi]
- A New ID-Based Key Sharing SystemShigeo Tsujii, Jinhui Chao. 288-299 [doi]
- Pseudo-random Generators from One-way Functions (Abstract)Michael Luby. 300 [doi]
- New Results on Pseudorandom Permutation Generators Based on the DES SchemeJacques Patarin. 301-312 [doi]
- Faster Modular Multiplication by Operand ScalingColin D. Walter. 313-323 [doi]
- Universal Electronic CashTatsuaki Okamoto, Kazuo Ohta. 324-337 [doi]
- How To Break and Repair A Provably Secure Untraceable Payment SystemBirgit Pfitzmann, Michael Waidner. 338-350 [doi]
- Practical Quantum Oblivious TransferCharles H. Bennett, Gilles Brassard, Claude Crépeau, Marie-Hélène Skubiszewska. 351-366 [doi]
- Exploiting Parallelism in Hardware Implementations of the DESAlbert G. Broscius, Jonathan M. Smith. 367-376 [doi]
- Foundations of Secure Interactive ComputingDonald Beaver. 377-391 [doi]
- Secure Computation (Abstract)Silvio Micali, Phillip Rogaway. 392-404 [doi]
- A Cryptographic Scheme for Computerized ElectionsKenneth R. Iversen. 405-419 [doi]
- Efficient Multiparty Protocols Using Circuit RandomizationDonald Beaver. 420-432 [doi]
- Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext AttackCharles Rackoff, Daniel R. Simon. 433-444 [doi]
- Towards Practical Public Key Systems Secure Against Chosen Ciphertext AttacksIvan Damgård. 445-456 [doi]
- Shared Generation of Authenticators and Signatures (Extended Abstract)Yvo Desmedt, Yair Frankel. 457-469 [doi]
- Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the SignerDavid Chaum, Eugène van Heijst, Birgit Pfitzmann. 470-484 [doi]