Abstract is missing.
- Security of Improved Identity-Based Conference Key Distribution SystemsKenji Koyama, Kazuo Ohta. 11-19 [doi]
- Subliminal-Free Authentication and Signature (Extended Abstract)Yvo Desmedt. 23-33 [doi]
- Zero-Knowledge Proofs of Identity And Veracity of Transaction ReceiptsGustavus J. Simmons, George B. Purdy. 35-49 [doi]
- Authentication Codes with Multiple Arbiters (Extended Abstract)Ernest F. Brickell, Douglas R. Stinson. 51-55 [doi]
- Some Constructions for Authentication-Secrecy CodesMarijke De Soete. 57-75 [doi]
- Efficient Zero-Knowledge Identification Scheme for Smart CardsThomas Beth. 77-84 [doi]
- A Smart Card Implementation of the Fiat-Shamir Identification SchemeHans-Joachim Knobloch. 87-95 [doi]
- Manipulations and Errors, Detection and LocalizationPhilippe Godlewski, Paul Camion. 97-106 [doi]
- Privacy Protected Payments - Realization of a Protocol that Guarantees Payer AnonymitySvein J. Knapskog. 107-122 [doi]
- A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and MemoryLouis C. Guillou, Jean-Jacques Quisquater. 123-128 [doi]
- A Generalized Birthday AttackMarc Girault, Robert Cohen, Mireille Campana. 129-156 [doi]
- An Interactive Data Exchange Protocol Based on Discrete ExponentiationGordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone. 159-166 [doi]
- Anonymous and Verifiable Registration in DatabasesJørgen Brandt, Ivan Damgård, Peter Landrock. 167-176 [doi]
- Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSADavid Chaum. 177-182 [doi]
- Passports and Visas Versus IDS (Extended Abstract)George I. Davida, Yvo Desmedt. 183-188 [doi]
- The Probabilistic Theory of Linear ComplexityHarald Niederreiter. 191-209 [doi]
- A Probabilistic Primality test Based on the Properties of Certain Generalized Lucas NumbersAdina di Porto, Piero Filipponi. 211-223 [doi]
- On the Construction of Random Number Generators and Random Function GeneratorsClaus-Peter Schnorr. 225-232 [doi]
- Factorization of Large Integers on a Massively Parallel ComputerJames A. Davis, Diane B. Holdridge. 235-243 [doi]
- A Fast Modular Arithmetic Algorithm Using a Residue Table (Extended Abstract)Shin-ichi Kawamura, Kyoko Hirano. 245-250 [doi]
- Fast Exponentiation in ::::GF(2:::n:::)::::Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone. 251-255 [doi]
- Fast RSA-Hardware: Dream or Reality?Frank Hoornaert, Marc Decroos, Joos Vandewalle, René Govaerts. 257-264 [doi]
- Properties of the Euler Totient Function Modulo 24 and Some of its Cryptographic ImplicationsRaouf N. Gorgui-Naguib, Satnam Singh Dlay. 267-274 [doi]
- An Observation on the Security of McEliece s Public-Key CryptosystemPil Joong Lee, Ernest F. Brickell. 275-280 [doi]
- How to Break Okamoto s Cryptosystem by Reducing Lattice BasesBrigitte Vallée, Marc Girault, Philippe Toffin. 281-291 [doi]
- Fast Correltaion Attacks on Stream Ciphers (Extended Abstract)Willi Meier, Othmar Staffelbach. 301-314 [doi]
- A New Class of Nonlinear Functions for Running-key Generators (Extended Abstract)Shu Tezuka. 317-324 [doi]
- Windmill Generators: A Generalization and an Observation of How Many There AreBen J. M. Smeets, William G. Chambers. 325-330 [doi]
- Lock-In Effect in Cascades of Clock-Controlled Shift-RegistersWilliam G. Chambers, Dieter Gollmann. 331-343 [doi]
- Proof of Massey s Conjectured AlgorithmCunsheng Ding. 345-349 [doi]
- Linear Recurring m-ArraysDongdai Lin, Mulan Liu. 351-357 [doi]
- Substantial Number of Cryptographic Keys and Its Application to Encryption DesignsEiji Okamoto. 361-373 [doi]
- A Measure of SemiequivocationAndrea Sgarro. 375-387 [doi]
- Some New Classes of Geometric Threshold SchemesMarijke De Soete, Klaus Vedder. 389-401 [doi]
- A New Probabilistic Encryption SchemeHe Jingmin, Lu Kaicheng. 415-418 [doi]
- Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-EncryptionTsutomu Matsumoto, Hideki Imai. 419-453 [doi]
- Some Applications of Multiple Key CiphersColin Boyd. 455-467 [doi]