Search
International Association for Cryptologic Research
What's new
Archive
Paper awards
Videos
Authors
Coauthors
By year
By venue
All Committees
Most Committees
Report errors
About
Publications of EPRINT 2001
Page
Title
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
New Notions of Soundness and Simultaneous Resettability in the Public-Key Model
RSA hybrid encryption schemes
An Identity Based Authenticated Key Agreement Protocol Based on the Weil Pairing
A Proposal for an ISO Standard for Public Key Encryption
Efficient Revocation of Anonymous Group Membership
Efficient Algorithms for Computing Differential Properties of Addition
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups
MinRank problem and Zero-knowledge authentication
A Note on Cryptanalysis of the Preliminary Version of the NTRU Signature Scheme
Secure and Efficient Asynchronous Broadcast Protocols
Are 'Strong' Primes Needed for RSA
Fully Distributed Threshold RSA under Standard Assumptions
Robust key-evolving public key encryption schemes
How to achieve a McEliece-based Digital Signature Scheme
New Zero-knowledge Undeniable Signatures - Forgery of Signature Equivalent to Factorisation
Ciphers with Arbitrary Finite Domains
Digitally Watermarking RSA Moduli
Timed-Release Cryptography
An observation regarding Jutla's modes of operation
Efficient Traitor Tracing Algorithms using List Decoding
On adaptive vs. non-adaptive security of multiparty protocols
Analysis of a Subset Sum Randomizer
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Some observations on the theory of cryptographic hash functions
The Rectangle Attack - Rectangling the Serpent
Optimistic Asynchronous Atomic Broadcast
Robustness for Free in Unconditional Multi-Party Computation
Secure Multiparty Computation of Approximations
Cryptanalysis of some elliptic curve based cryptosystems of Paillier
OCB Mode
A Block-Cipher Mode of Operation for Parallelizable Message Authentication
Efficient Encryption for Rich Message Spaces Under General Assumptions
On multivariate signature-only public key cryptosystems
On the Power of Nonlinear Secret-Sharing
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
Efficient and Non-Interactive Non-Malleable Commitment
Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures
Forward-Security in Private-Key Cryptography
Anti-persistence: History Independent Data Structures
EMpowering Side-Channel Attacks
Flaws in differential cryptanalysis of Skipjack
Robust Software Tokens: Towards Securing a Digital Identity
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent
Simple Forward-Secure Signatures From Any Signature Scheme
Cryptanalysis of the Vesta-2M Stream Cipher
Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds
The order of encryption and authentication for protecting communications (Or: how secure is SSL?)
The simple ideal cipher system
ON THE METHOD OF "XL" AND ITS INEFFICIENCY TO TTM
Forward-Secure Signatures with Optimal Signing and Verifying
A known plaintext attack on the ISAAC keystream generator
Elliptic curve Paillier schemes
Black-Box Concurrent Zero-Knowledge Requires $\tilde\Omega(\log n)$ Rounds
Differential Probability of Modular Addition with a Constant Operand
Security Proofs for the RSA-PSS Signature Scheme and Its Variants
Extending the GHS Weil Descent Attack
Universally Composable Commitments
On the Complexity of Matsui's Attack
On the Security of the SPEKE Password-Authenticated Key Exchange Protocol
Efficient Zero-knowledge Authentication Based on a Linear Algebra Problem MinRank
Revocation and Tracing Schemes for Stateless Receivers
The Security of Practical Two-Party RSA Signature Schemes
Clock-Controlled Shift Registers for Key-Stream Generation
Optimal security proofs for PSS and other signature schemes
Resettably-Sound Zero-Knowledge and its Applications
An Integer Commitment Scheme based on Groups with Hidden Order
Analysis of chosen plaintext attacks on the WAKE Stream Cipher
IMPROVED PUBLIC KEY CRYPTOSYSTEM USING FINITE NON ABELIAN GROUPS
An Attack on A Traitor Tracing Scheme
SQUARE Attacks on Reduced-Round PES and IDEA Block Ciphers
On the (Im)possibility of Obfuscating Programs
Security Assessment of Hierocrypt and Rijndael against the Differential and Linear Cryptanalysis (Extended Abstract)
Multi-Recipient Public-Key Encryption with Shortened Ciphertext
On the Goubin-Courtois Attack on TTM
Efficient oblivious transfer schemes
On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit - A New Construction
Pseudo-Random Functions and Factoring
Communication Complexity and Secure Function Evaluation
A Time-Memory Tradeoff Attack Against LILI-128
The COS Stream Ciphers are Extremely Weak
Authenticated Encryption in the Public-Key Setting: Security Notions and Analyses
COS Ciphers are not "extremely weak"! - The Design Rationale of COS Ciphers
A Sufficient Condition for Secure Ping--Pong Protocols
A Description of Protocols for Private Credentials
On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Statistical Zero-Knowledge Proofs from Diophantine Equations
A Linear Algebraic Approach to Metering Schemes
Improving the trade-off between storage and communication in broadcast encryption schemes
Linear broadcast encryption schemes
Identity Based Encryption From the Weil Pairing
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
BDD-based Cryptanalysis of Keystream Generators
Threshold Cryptosystems Based on Factoring
Slope packings and coverings, and generic algorithms for the discrete logarithm problem
Secure Vickrey Auctions without Threshold Trust
Constructing elliptic curves with a given number of points over a finite field
An Efficient MAC for Short Messages
Fast hashing onto elliptic curves over fields of characteristic 3
Linear Code Implies Public-Key Traitor Tracing
A Note on Girault's Self-Certified Model
Quasi-Efficient Revocation of Group Signatures
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates
Countermeasures against Side-Channel Attacks for Elliptic Curve Cryptosystems
Concurrent Zero-Knowledge With Timing, Revisited
Universal Arguments and their Applications
Cryptanalysis of the COS (2,128) Stream Ciphers
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation