Abstract is missing.
- Low-Exponent RSA with Related MessagesDon Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter. 1-9 [doi]
- Generating EIGamal Signatures Without Knowing the Secret KeyDaniel Bleichenbacher. 10-18 [doi]
- On the Security of Two MAC AlgorithmsBart Preneel, Paul C. van Oorschot. 19-32 [doi]
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric AlgorithmsJacques Patarin. 33-48 [doi]
- A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to FactoringBernd Meyer, Volker Müller. 49-59 [doi]
- Public Key Encryption and Signature Schemes Based on Polynomials over ZnJörg Schwenk, Jörg Eisfeld. 60-71 [doi]
- Multi-Autority Secret-Ballot Elections with Linear WorkRonald Cramer, Matthew K. Franklin, Berry Schoenmakers, Moti Yung. 72-83 [doi]
- Asymmetric Fingerprinting (Extended Abstract)Birgit Pfitzmann, Matthias Schunter. 84-95 [doi]
- Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature SharingMike Burmester. 96-106 [doi]
- Efficient Multiplicative Sharing SchemesSimon R. Blackburn, Mike Burmester, Yvo Desmedt, Peter R. Wild. 107-118 [doi]
- Equivocable Oblivious TransferDonald Beaver. 119-130 [doi]
- Short Discrete ProofsJoan Boyar, René Peralta. 131-142 [doi]
- Designated Verifier Proofs and Their ApplicationsMarkus Jakobsson, Kazue Sako, Russell Impagliazzo. 143-154 [doi]
- Finding a Small Root of a Univariate Modular EquationDon Coppersmith. 155-165 [doi]
- New Modular Multiplication Algorithms for Fast Modular ExponentiationSeong-Min Hong, Sang-Yeop Oh, Hyunsoo Yoon. 166-177 [doi]
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits KnownDon Coppersmith. 178-189 [doi]
- Publicly Verifiable Secret SharingMarkus Stadler. 190-199 [doi]
- Optimum Secret Sharing Scheme Secure against CheatingWakaha Ogata, Kaoru Kurosawa. 200-211 [doi]
- Non-Linear Approximations in Linear CryptoanalysisLars R. Knudsen, Matthew J. B. Robshaw. 224-236 [doi]
- On the Difficulty of Software Key EscrowLars R. Knudsen, Torben P. Pedersen. 237-244 [doi]
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome DecodingJean-Bernard Fischer, Jacques Stern. 245-255 [doi]
- On the Existence of Secure Feedback Registers (Extended Abstract)Andrew Klapper. 256-267 [doi]
- Fast Low Order Approximation of Cryptographic FunctionsJovan Dj. Golic. 268-282 [doi]
- Construction of t-Resilient Functions over a Finite AlphabetPaul Camion, Anne Canteaut. 283-293 [doi]
- Auto-Correlations and New Bounds on the Nonlinearity of Boolean FunctionsXian-Mo Zhang, Yuliang Zheng. 294-306 [doi]
- Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to FeistelWilliam Aiello, Ramarathnam Venkatesan. 307-320 [doi]
- Session Key Distribution Using Smart CardsVictor Shoup, Aviel D. Rubin. 321-331 [doi]
- On Diffie-Hellman Key Agreement with Short ExponentsPaul C. van Oorschot, Michael J. Wiener. 332-343 [doi]
- On the Security of a Practical Identification SchemeVictor Shoup. 344-353 [doi]
- Robust Threshold DSS SignaturesRosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin. 354-371 [doi]
- New Convertible Undeniable Signature SchemesIvan Damgård, Torben P. Pedersen. 372-386 [doi]
- Security Proofs for Signature SchemesDavid Pointcheval, Jacques Stern. 387-398 [doi]
- The Exact Security of Digital Signatures - HOw to Sign with RSA and RabinMihir Bellare, Phillip Rogaway. 399-416 [doi]