New Reports in the Cryptology ePrint Archive

   2001/044 
          Optimistic Asynchronous Multi-Party Contract Signing with
          Reduced Number of Rounds
          Birgit Baum-Waidner
   2001/043
          Cryptanalysis of the Vesta-2M Stream Cipher
          Marina Pudovkina
   2001/042 
          Simple Forward-Secure Signatures From Any Signature Scheme
          Hugo Krawczyk
   2001/041
          Solving Elliptic Curve Discrete Logarithm Problems Using Weil
          Descent
          Michael Jacobson and Alfred Menezes and Andreas Stein
   2001/040 
          Analysis of Key-Exchange Protocols and Their Use for Building
          Secure Channels
          Ran Canetti and Hugo Krawczyk
   2001/039 
          Robust Software Tokens: Towards Securing a Digital Identity
          Taekyoung Kwon
   2001/038 
          Flaws in differential cryptanalysis of Skipjack
          Louis Granboulan
   2001/037
          EMpowering Side-Channel Attacks
          Josyula R. Rao and Pankaj Rohatgi
   2001/036 
          Anti-persistence: History Independent Data Structures
          Moni Naor and Vanessa Teague
   2001/035
          Forward security in private key cryptography
          Mihir Bellare and Bennet Yee
   2001/034 
          Composition and Efficiency Tradeoffs for Forward-Secure Digital
          Signatures
          Tal Malkin and Daniele Micciancio and Sara Miner
   2001/033
          Dual of New Method for Upper Bounding the Maximum Average
          Linear Hull Probability for SPNs
          Liam Keliher and Henk Meijer and Stafford Tavares
   2001/032
          Efficient and Non-Interactive Non-Malleable Commitment
          Giovanni Di Crescenzo and Jonathan Katz and Rafail Ostrovsky
          and Adam Smith
   2001/031
          Efficient Password-Authenticated Key Exchange Using
          Human-Memorable Passwords
          Jonathan Katz and Rafail Ostrovsky and Moti Yung
   2001/030
          On the Power of Nonlinear Secret-Sharing
          Amos Beimel and Yuval Ishai
   2001/029
          On multivariate signature-only public key cryptosystems
          Nicolas T. Courtois
   2001/028
          Efficient Encryption for Rich Message Spaces Under General
          Assumptions
          Alexander Russell and Hong Wang
   2001/027
          PMAC
          Phillip Rogaway and John Black 
   2001/026
          OCB Mode
          Phillip Rogaway and Mihir Bellare and John Black and Ted
          Krovetz
   2001/025 
          Cryptanalysis of some elliptic curve based cryptosystems of
          Paillier
          Steven D. Galbraith
   2001/024 
          Secure Multiparty Computation of Approximations
          Joan Feigenbaum and Yuval Ishai and Tal Malkin and Kobbi Nissim
          and Martin Strauss and Rebecca N. Wright
   2001/023
          Robustness for Free in Unconditional Multi-Party Computation
          Martin Hirt and Ueli Maurer
   2001/022
          Optimistic Asynchronous Atomic Broadcast
          Klaus Kursawe and Victor Shoup
   2001/021 
          The Rectangle Attack - Rectangling the Serpent
          Biham Eli, Orr Dunkelman, Nathan Keller
   2001/020 
          Some observations on the theory of cryptographic hash functions
          D.R. Stinson
   2001/019
          An Efficient System for Non-transferable Anonymous Credentials
          with Optional Anonymity Revocation
          Jan Camenisch and Anna Lysyanskaya
   2001/018 
          Analysis of a Subset Sum Randomizer
          Peter Gemmell and Anna Johnston
   2001/017
          On adaptive vs. non-adaptive security of multiparty protocols
          Ran Canetti and Ivan Damgard and Stefan Dziembowski and Yuval
          Ishai and Tal Malkin
   2001/016 
          Efficient Traitor Tracing Algorithms using List Decoding
          Alice Silverberg and Jessica Staddon and Judy Walker
   2001/015
          An observation regarding Jutla's modes of operation
          Shai Halevi
   2001/014
          Timed-Release Cryptography
          Wenbo Mao
   2001/013 
          Digitally Watermarking RSA Moduli
          Anna M. Johnston
   2001/012
          Ciphers with Arbitrary Finite Domains
          John Black and Phillip Rogaway
   2001/011
          New Zero-knowledge Undeniable Signatures - Forgery of Signature
          Equivalent to Factorisation
          Wenbo Mao
   2001/010
          How to achieve a McEliece-based Digital Signature Scheme
          Nicolas Courtois, Matthieu Finiasz and Nicolas Sendrier
   2001/009 
          Robust key-evolving public key encryption schemes
          Wen-Guey Tzeng, Zhi-Jia Tzeng
   2001/008
          Fully Distributed Threshold RSA under Standard Assumptions
          Pierre-Alain Fouque and Jacques Stern
   2001/007 
          Are 'Strong' Primes Needed for RSA
          Ron RIvest & Robert Silverman
   2001/006
          Secure and Efficient Asynchronous Broadcast Protocols
          Christian Cachin and Klaus Kursawe and Frank Petzold and Victor
          Shoup