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 Asiacrypt 2003
Preface and frontmatter
Page
Title
1-18
Chosen-Ciphertext Security without Redundancy
19-36
Some RSA-Based Encryption Schemes with Tight Security Reduction
37-54
A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications
55-74
Factoring Estimates for a 1024-Bit RSA Modulus
75-92
Index Calculus Attack for Hyperelliptic Curves of Small Genus
93-110
Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves
111-123
Tate Pairing Implementation for Hyperelliptic Curves y
^{2}
= x
^{p}
-x + d
124-136
The AGM-X
_{0}
(N) Heegner Point Lifting Algorithm and Elliptic Curve Point Counting
137-154
Key Management Schemes for Stateless Receivers Based on Time Varying Heterogeneous Logical Key Hierarchy
155-172
Leakage-Resilient Authenticated Key Establishment Protocols
173-187
Untraceable Fair Network Payment Protocols with Off-Line TTP
188-207
Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking
208-227
New Parallel Domain Extenders for UOWHF
228-245
Cryptanalysis of 3-Pass HAVAL
246-268
Efficient Group Signatures without Trapdoors
269-286
Accumulating Composites and Improved Group Signing
287-301
Almost Uniform Density of Power Residues and the Provable Security of ESIGN
302-310
Rotations and Translations of Number Field Sieve Polynomials
311-325
On Class Group Computations Using the Number Field Sieve
326-330
The Secret and Beauty of Ancient Chinese Padlocks
331-346
A Traceable Block Cipher
347-358
A New Attack against Khazad
359-373
An Efficient Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
374-391
Sequential Key Derivation Patterns for Broadcast Encryption and Key Predistribution Schemes
392-397
Boneh et al.'s k-Element Aggregate Extraction Assumption Is Equivalent to the Diffie-Hellman Assumption
398-415
On Diophantine Complexity and Statistical Zero-Knowledge Arguments
416-433
Verifiable Homomorphic Oblivious Transfer and Private Equality Test
434-451
Generalized Powering Functions and Their Application to Digital Signatures
452-473
Certificateless Public Key Cryptography
474-491
A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems
492-506
The Insecurity of Esign in Practical Implementations
507-522
Efficient One-Time Proxy Signatures
523-542
Universal Designated-Verifier Signatures