Abstract is missing.
- Yvo Desmedt: All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic AssumptionsMike Burmester. 1-10 [doi]
- On the Importance of Memory Resources in the Security of Key Exchange ProtocolsGeorge I. Davida, Yvo Desmedt, René Peralta. 11-15 [doi]
- Provably Secure Key-Updating Schemes in Identity-Based SystemsS. Shinozaki, Toshiya Itoh, Atsushi Fujioka, Shigeo Tsujii. 16-30 [doi]
- Oblivous Transfer Protecting SecrecyBert den Boer. 31-45 [doi]
- Public-Randomness in Public Key CryptographyAlfredo De Santis, Giuseppe Persiano. 46-62 [doi]
- An Interactive Identification Scheme Based on Discrete Logarithms and FactoringErnest F. Brickell, Kevin S. McCurley. 63-71 [doi]
- Factoring With Two Large PrimesArjen K. Lenstra, Mark S. Manasse. 72-82 [doi]
- Which New RSA Signatures Can Be Computed From Some Given RSA Signatures?Jan-Hendrik Evertse, Eugène van Heyst. 83-97 [doi]
- Implementation of a Key Exchange Protocol Using Some Real Quadratic FieldsRenate Scheidler, Johannes Buchmann, Hugh C. Williams. 98-109 [doi]
- Distributed Primality Proving and the Primality of (2:::3539:::+1)/3François Morain. 110-123 [doi]
- Properties of Binary FunctionsSheelagh Lloyd. 124-139 [doi]
- How to Construct Pseudorandom Permutations from Single Pseudorandom FunctionsJosef Pieprzyk. 140-150 [doi]
- Constructions of Bent Functions and Difference SetsKaisa Nyberg. 151-160 [doi]
- Propagation Characteristics of Boolean FunctionsBart Preneel, Werner Van Leekwijck, Luc Van Linden, René Govaerts, Joos Vandewalle. 161-173 [doi]
- The Linear Complexity Profile and the Jump Complexity of Keystream SequencesHarald Niederreiter. 174-188 [doi]
- Lower Bounds for the Linear Complexity of Sequences over Residue RingsZong-Duo Dai, Thomas Beth, Dieter Gollmann. 189-195 [doi]
- On the Construction of Run Permuted SequencesCees J. A. Jansen. 196-203 [doi]
- Correlation Properties of Combiners with Memory in Stream CiphersWilli Meier, Othmar Staffelbach. 204-213 [doi]
- Exponentiating Faster with Addition ChainsYacov Yacobi. 222-229 [doi]
- Experimental Quantum CryptographyCharles H. Bennett, François Bessette, Gilles Brassard, Louis Salvail, John A. Smolin. 253-265 [doi]
- A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted PartyIngemar Ingemarsson, Gustavus J. Simmons. 266-282 [doi]
- Lower Bounds for Authentication Codes With SplittingAndrea Sgarro. 283-293 [doi]
- On the Construction of Authentication Codes With Secrecy and Codes Withstanding Spoofing Attacks of Order L >= 2Ben J. M. Smeets, Peter Vanroose, Zhe-xian Wan. 306-312 [doi]
- Cryptanalysis of a Public-Key Cryptosystem Based on Approximations by Rational NumbersJacques Stern, Philippe Toffin. 313-317 [doi]
- A Known Plaintext Attack on Two-Key Triple EncryptionPaul C. van Oorschot, Michael J. Wiener. 318-325 [doi]
- Confirmation that Some Hash Functions Are Not Collision FreeShoji Miyaguchi, Kazuo Ohta, Masahiko Iwata. 326-343 [doi]
- Inverting the Pseudo ExponentiationFritz Bauspieß, Hans-Joachim Knobloch, Peer Wichmann. 344-351 [doi]
- Cryptosystem for Group Oriented CryptographyTzonelih Hwang. 352-360 [doi]
- A Provably-Secure Strongly-Randomized CipherUeli M. Maurer. 361-373 [doi]
- General Public Key Residue Cryptosystems and Mental Poker ProtocolsKaoru Kurosawa, Yutaka Katayama, Wakaha Ogata, Shigeo Tsujii. 374-388 [doi]
- A Proposal for a New Block Encryption StandardXuejia Lai, James L. Massey. 389-404 [doi]
- A New Trapdoor in KnapsacksValtteri Niemi. 405-411 [doi]
- On the Design of Provably Secure Cryptographic Hash FunctionsAlfredo De Santis, Moti Yung. 412-431 [doi]
- Fast Signature Generation With a Fiat Shamir-Like SchemeH. Ong, Claus-Peter Schnorr. 432-440 [doi]
- A Remark on a Signature Scheme Where Forgery Can Be ProvedGerrit Bleumer, Birgit Pfitzmann, Michael Waidner. 441-445 [doi]
- Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir SchemeKazuo Ohta, Tatsuaki Okamoto, Kenji Koyama. 446-457 [doi]
- Zero-Knowledge Undeniable SignaturesDavid Chaum. 458-464 [doi]
- Precautions Taken Against Various Potential Attacks in ISO/IEC DIS 9796 Digital Signature Scheme Giving Message Recovery Louis C. Guillou, Jean-Jacques Quisquater, Michael Walker, Peter Landrock, Caroline Shafer. 465-473 [doi]
- Software Run-Time Protection: A Cryptographic IssueJosep Domingo-Ferrer. 474-480 [doi]
- An Identity-based Identification Scheme Based on Discrete Logarithms Modulo a Composite NumberMarc Girault. 481-486 [doi]
- A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparion ApproachJovan Dj. Golic, Miodrag J. Mihaljevic. 487-491 [doi]
- The MD4 Message Digest Algorithm (Abstract)Burton S. Kaliski Jr.. 492 [doi]
- A Remark on the Efficiency of Identification SchemesMike Burmester. 493-495 [doi]
- On an Implementation of the Mohan-Adiga AlgorithmGisela Meister. 496-500 [doi]