Cryptology ePrint Archive: Listing for 2001

• [ePrint 1996 - now ] (~5MB!)
• [ePrint 2020 - now ]    [ePrint 2026]    [ePrint 2025]    [ePrint 2024]    [ePrint 2023]    [ePrint 2022]    [ePrint 2021]    [ePrint 2020]
• [ePrint 2010 - 2019]    [ePrint 2019]    [ePrint 2018]    [ePrint 2017]    [ePrint 2016]    [ePrint 2015]    [ePrint 2014]    [ePrint 2013]    [ePrint 2012]    [ePrint 2011]    [ePrint 2010]
• [ePrint 2000 - 2009]    [ePrint 2009]    [ePrint 2008]    [ePrint 2007]    [ePrint 2006]    [ePrint 2005]    [ePrint 2004]    [ePrint 2003]    [ePrint 2002]    [ePrint 2001]    [ePrint 2000]
• [ePrint 1996 - 1999]    [ePrint 1999]    [ePrint 1998]    [ePrint 1997]    [ePrint 1996]

• 2001/113 (PDF)
  Efficient Revocation of Anonymous Group Membership
  Jan Camenisch, Anna Lysyanskaya
• 2001/112 (PDF)
  A Proposal for an ISO Standard for Public Key Encryption
  Victor Shoup
• 2001/111 (PDF)
  An Identity Based Authenticated Key Agreement Protocol Based on the Weil Pairing
  N. P. Smart
• 2001/110 (PDF)
  RSA hybrid encryption schemes
  Louis Granboulan
• 2001/109 (PDF)
  New Notions of Soundness and Simultaneous Resettability in the Public-Key Model
  Yunlei ZHAO
• 2001/108 (PDF)
  Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
  Ronald Cramer, Victor Shoup
• 2001/107 (PDF)
  Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
  Yehuda Lindell
• 2001/106 (PDF)
  Cryptanalysis of the COS (2,128) Stream Ciphers
  Steve Babbage
• 2001/105 (PDF)
  Universal Arguments and their Applications
  Boaz Barak, Oded Goldreich
• 2001/104 (PDF)
  Concurrent Zero-Knowledge With Timing, Revisited
  Oded Goldreich
• 2001/103 (PDF)
  Countermeasures against Side-Channel Attacks for Elliptic Curve Cryptosystems
  Antonio Bellezza
• 2001/102 (PDF)
  An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates
  Ivan Damgård, Gudmund Frandsen
• 2001/101 (PDF)
  Quasi-Efficient Revocation of Group Signatures
  Giuseppe Ateniese, Dawn Song, Gene Tsudik
• 2001/100 (PDF)
  A Note on Girault's Self-Certified Model
  Shahrokh Saeednia
• 2001/099 (PDF)
  Linear Code Implies Public-Key Traitor Tracing
  Kaoru Kurosawa, Takuya Yoshida
• 2001/098 (PDF)
  Fast hashing onto elliptic curves over fields of characteristic 3
  Paulo S. L. M. Barreto, Hae Yong Kim
• 2001/097 (PDF)
  An Efficient MAC for Short Messages
  Sarvar Patel
• 2001/096 (PDF)
  Constructing elliptic curves with a given number of points over a finite field
  Amod Agashe, Kristin Lauter, Ramarathnam Venkatesan
• 2001/095 (PDF)
  Secure Vickrey Auctions without Threshold Trust
  Helger Lipmaa, N. Asokan, Valtteri Niemi
• 2001/094 (PDF)
  Slope packings and coverings, and generic algorithms for the discrete logarithm problem
  M. Chateauneuf, A. C. H. Ling, D. R. Stinson
• 2001/093 (PDF)
  Threshold Cryptosystems Based on Factoring
  Jonathan Katz, Moti Yung
• 2001/092 (PDF)
  BDD-based Cryptanalysis of Keystream Generators
  Matthias Krause
• 2001/091 (PDF)
  Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
  Ivan Damgård, Jesper B. Nielsen
• 2001/090 (PDF)
  Identity Based Encryption From the Weil Pairing
  Dan Boneh, Matthew Franklin
• 2001/089 (PDF)
  Linear broadcast encryption schemes
  Carles Padró, Ignacio Gracia, Sebastià Martín, Paz Morillo
• 2001/088 (PDF)
  Improving the trade-off between storage and communication in broadcast encryption schemes
  Ignacio Gracia, Sebastià Martín, Carles Padró
• 2001/087 (PDF)
  A Linear Algebraic Approach to Metering Schemes
  C. Blundo, S. Martìn, B. Masucci, C. Padrò
• 2001/086 (PDF)
  Statistical Zero-Knowledge Proofs from Diophantine Equations
  Helger Lipmaa
• 2001/085 (PDF)
  Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
  Ronald Cramer, Victor Shoup
• 2001/084 (PDF)
  Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
  Markus Maurer, Alfred Menezes, Edlyn Teske
• 2001/083 (PDF)
  On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices
  Maria Fedorova, Yuriy Tarannikov
• 2001/082 (PDF)
  A Description of Protocols for Private Credentials
  Ariel Glenn, Ian Goldberg, Frédéric Légaré, Anton Stiglic
• 2001/081 (PDF)
  A Sufficient Condition for Secure Ping--Pong Protocols
  Masao Mori
• 2001/080 (PDF)
  COS Ciphers are not "extremely weak"! - The Design Rationale of COS Ciphers
  Eric Filiol, Caroline Fontaine
• 2001/079 (PDF)
  Authenticated Encryption in the Public-Key Setting: Security Notions and Analyses
  Jee Hea An
• 2001/078 (PDF)
  The COS Stream Ciphers are Extremely Weak
  Steve Babbage
• 2001/077 (PDF)
  A Time-Memory Tradeoff Attack Against LILI-128
  Markku-Juhani Olavi Saarinen
• 2001/076 (PDF)
  Communication Complexity and Secure Function Evaluation
  Moni Naor, Kobbi Nissim
• 2001/075 (PDF)
  Pseudo-Random Functions and Factoring
  Moni Naor, Omer Reingold, Alon Rosen
• 2001/074 (PDF)
  On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit - A New Construction
  Eliane Jaulmes, Antoine Joux, Frederic Valette
• 2001/073 (PDF)
  Efficient oblivious transfer schemes
  Wen-Guey Tzeng
• 2001/072 (PDF)
  On the Goubin-Courtois Attack on TTM
  T. Moh, Jiun-Ming Chen
• 2001/071 (PDF)
  Multi-Recipient Public-Key Encryption with Shortened Ciphertext
  Kaoru Kurosawa
• 2001/070 (PDF)
  Security Assessment of Hierocrypt and Rijndael against the Differential and Linear Cryptanalysis (Extended Abstract)
  Kenji Ohkuma, Hideo Shimizu, Fumihiko Sano, Shinichi Kawamura
• 2001/069 (PDF)
  On the (Im)possibility of Obfuscating Programs
  Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, Ke Yang
• 2001/068 (PDF)
  SQUARE Attacks on Reduced-Round PES and IDEA Block Ciphers
  J. Nakahara Jr, P. S. L. M. Barreto, B. Preneel, J. Vandewalle, H. Y. Kim
• 2001/067 (PDF)
  An Attack on A Traitor Tracing Scheme
  Jeff Jianxin Yan, Yongdong Wu
• 2001/066 (PDF)
  IMPROVED PUBLIC KEY CRYPTOSYSTEM USING FINITE NON ABELIAN GROUPS
  SEONG-HUN PAENG, DAESUNG KWON, KIL-CHAN HA, JAE HEON KIM
• 2001/065 (PDF)
  Analysis of chosen plaintext attacks on the WAKE Stream Cipher
  Marina Pudovkina
• 2001/064 (PDF)
  An Integer Commitment Scheme based on Groups with Hidden Order
  Ivan Damgard, Eiichiro Fujisaki
• 2001/063 (PDF)
  Resettably-Sound Zero-Knowledge and its Applications
  Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell
• 2001/062 (PDF)
  Optimal security proofs for PSS and other signature schemes
  Jean-Sébastien Coron
• 2001/061 (PDF)
  Clock-Controlled Shift Registers for Key-Stream Generation
  Alexander Kholosha
• 2001/060 (PDF)
  The Security of Practical Two-Party RSA Signature Schemes
  Mihir Bellare, Ravi Sandhu
• 2001/059 (PDF)
  Revocation and Tracing Schemes for Stateless Receivers
  Dalit Naor, Moni Naor, Jeff Lotspiech
• 2001/058 (PDF)
  Efficient Zero-knowledge Authentication Based on a Linear Algebra Problem MinRank
  Nicolas T. Courtois
• 2001/057 (PDF)
  On the Security of the SPEKE Password-Authenticated Key Exchange Protocol
  Philip MacKenzie
• 2001/056 (PDF)
  On the Complexity of Matsui's Attack
  P. Junod
• 2001/055 (PDF)
  Universally Composable Commitments
  Ran Canetti, Marc Fischlin
• 2001/054 (PDF)
  Extending the GHS Weil Descent Attack
  S. D. Galbraith, F. Hess, N. P. Smart
• 2001/053 (PDF)
  Security Proofs for the RSA-PSS Signature Scheme and Its Variants
  Jakob Jonsson
• 2001/052 (PDF)
  Differential Probability of Modular Addition with a Constant Operand
  Alexis Warner Machado
• 2001/051 (PDF)
  Black-Box Concurrent Zero-Knowledge Requires $\tilde\Omega(\log n)$ Rounds
  Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
• 2001/050 (PDF)
  Elliptic curve Paillier schemes
  Steven D Galbraith
• 2001/049 (PDF)
  A known plaintext attack on the ISAAC keystream generator
  Marina Pudovkina
• 2001/048 (PDF)
  Forward-Secure Signatures with Optimal Signing and Verifying
  Gene Itkis, Leonid Reyzin
• 2001/047 (PDF)
  ON THE METHOD OF "XL" AND ITS INEFFICIENCY TO TTM
  T. MOH
• 2001/046 (PDF)
  The simple ideal cipher system
  Boris Ryabko
• 2001/045 (PDF)
  The order of encryption and authentication for protecting communications (Or: how secure is SSL?)
  Hugo Krawczyk
• 2001/044 (PDF)
  Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds
  Birgit Baum-Waidner
• 2001/043 (PDF)
  Cryptanalysis of the Vesta-2M Stream Cipher
  Marina Pudovkina
• 2001/042 (PDF)
  Simple Forward-Secure Signatures From Any Signature Scheme
  Hugo Krawczyk
• 2001/041 (PDF)
  Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent
  Michael Jacobson, Alfred Menezes, Andreas Stein
• 2001/040 (PDF)
  Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
  Ran Canetti, Hugo Krawczyk
• 2001/039 (PDF)
  Robust Software Tokens: Towards Securing a Digital Identity
  Taekyoung Kwon
• 2001/038 (PDF)
  Flaws in differential cryptanalysis of Skipjack
  Louis Granboulan
• 2001/037 (PDF)
  EMpowering Side-Channel Attacks
  Josyula R. Rao, Pankaj Rohatgi
• 2001/036 (PDF)
  Anti-persistence: History Independent Data Structures
  Moni Naor, Vanessa Teague
• 2001/035 (PDF)
  Forward-Security in Private-Key Cryptography
  Mihir Bellare, Bennet Yee
• 2001/034 (PDF)
  Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures
  Tal Malkin, Daniele Micciancio, Sara Miner
• 2001/033 (PDF)
  Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
  Liam Keliher, Henk Meijer, Stafford Tavares
• 2001/032 (PDF)
  Efficient and Non-Interactive Non-Malleable Commitment
  Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith
• 2001/031 (PDF)
  Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
  Jonathan Katz, Rafail Ostrovsky, Moti Yung
• 2001/030 (PDF)
  On the Power of Nonlinear Secret-Sharing
  Amos Beimel, Yuval Ishai
• 2001/029 (PDF)
  On multivariate signature-only public key cryptosystems
  Nicolas T. Courtois
• 2001/028 (PDF)
  Efficient Encryption for Rich Message Spaces Under General Assumptions
  Alexander Russell, Hong Wang
• 2001/027 (PDF)
  A Block-Cipher Mode of Operation for Parallelizable Message Authentication
  John Black, Phillip Rogaway
• 2001/026 (PDF)
  OCB Mode
  Phillip Rogaway, Mihir Bellare, John Black, Ted Krovetz
• 2001/024 (PDF)
  Secure Multiparty Computation of Approximations
  Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright
• 2001/023 (PDF)
  Robustness for Free in Unconditional Multi-Party Computation
  Martin Hirt, Ueli Maurer
• 2001/022 (PDF)
  Optimistic Asynchronous Atomic Broadcast
  Klaus Kursawe, Victor Shoup
• 2001/021 (PDF)
  The Rectangle Attack - Rectangling the Serpent
  Biham Eli, Orr Dunkelman, Nathan Keller
• 2001/020 (PDF)
  Some observations on the theory of cryptographic hash functions
  D. R. Stinson
• 2001/019 (PDF)
  An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
  Jan Camenisch, Anna Lysyanskaya
• 2001/018 (PDF)
  Analysis of a Subset Sum Randomizer
  Peter Gemmell, Anna Johnston
• 2001/017 (PDF)
  On adaptive vs. non-adaptive security of multiparty protocols
  Ran Canetti, Ivan Damgard, Stefan Dziembowski, Yuval Ishai, Tal Malkin
• 2001/016 (PDF)
  Efficient Traitor Tracing Algorithms using List Decoding
  Alice Silverberg, Jessica Staddon, Judy Walker
• 2001/015 (PDF)
  An observation regarding Jutla's modes of operation
  Shai Halevi
• 2001/014 (PDF)
  Timed-Release Cryptography
  Wenbo Mao
• 2001/013 (PDF)
  Digitally Watermarking RSA Moduli
  Anna M. Johnston
• 2001/012 (PDF)
  Ciphers with Arbitrary Finite Domains
  John Black, Phillip Rogaway
• 2001/011 (PDF)
  New Zero-knowledge Undeniable Signatures - Forgery of Signature Equivalent to Factorisation
  Wenbo Mao
• 2001/010 (PDF)
  How to achieve a McEliece-based Digital Signature Scheme
  Nicolas Courtois, Matthieu Finiasz, Nicolas Sendrier
• 2001/009 (PDF)
  Robust key-evolving public key encryption schemes
  Wen-Guey Tzeng, Zhi-Jia Tzeng
• 2001/008 (PDF)
  Fully Distributed Threshold RSA under Standard Assumptions
  Pierre-Alain Fouque, Jacques Stern
• 2001/007 (PDF)
  Are 'Strong' Primes Needed for RSA
  Ron Rivest, Robert Silverman
• 2001/006 (PDF)
  Secure and Efficient Asynchronous Broadcast Protocols
  Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup
• 2001/005 (PDF)
  A Note on Cryptanalysis of the Preliminary Version of the NTRU Signature Scheme
  Ilya Mironov
• 2001/003 (PDF)
  Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups
  Antoine Joux, Kim Nguyen
• 2001/002 (PDF)
  The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
  M. Bellare, C. Namprempre, D. Pointcheval, M. Semanko
• 2001/001 (PDF)
  Efficient Algorithms for Computing Differential Properties of Addition
  Helger Lipmaa, Shiho Moriai