+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Advances in Cryptology - Asiacrypt 2003 : 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings - Chi Sung Laih

Advances in Cryptology - Asiacrypt 2003

9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings

By: Chi Sung Laih (Editor)

Paperback Published: 18th November 2003
ISBN: 9783540205920
Number Of Pages: 550

Share This Book:


or 4 easy payments of $36.76 with Learn more
Ships in 10 to 15 business days

Earn 294 Qantas Points
on this Book

ASIACRYPT 2003 was held in Taipei, Taiwan, from Nov. 30 to Dec. 4, 2003. The 9th Annual ASIACRYPT conference was sponsored by the International Association for Cryptologic Research (IACR), this year in cooperation with the ChineseCryptologyandInformationSecurityAssociation(CCISA)andNational Cheng Kung University (NCKU) in Taiwan. One hundred and eighty-eight papers from 26 countries were submitted to ASIACRYPT 2003 and 33 (of which one paper was withdrawn by the authors afternoti?cation)ofthesewereselectedforpresentation.Theseproceedingsc- tainrevisedversionsoftheacceptedpapers.WehadanIACR2003Distinguished Lecture, by Dr. Don Coppersmith, entitled "Solving Low Degree Polynomials." In addition, two invited talks were given at the conference. One was given by Dr. Adi Shamir. The other one was given by Dr. Hong-Sen Yan, entitled "The Secret and Beauty of Ancient Chinese Locks." The conference program also included a rump session, chaired by Tzong Chen Wu, which featured short informal talks on recent results. It was a pleasure for me to work with the program committee, which was composed of 27 members from 17 countries; I thank them for working very hard overseveralmonths.Asamatteroffact, thereviewprocesswasachallengingand time-consuming task, and it lasted about 8 weeks, followed by more than half a month for discussions among the program committee members. All submissions were anonymously reviewed by at least 3 members in the relevant areas of the program committee; in some cases, particularly for those papers submitted by a member of the program committee, they were reviewed by at least six members. We are grateful to all the program committee members who put in a lot of e?ort andprecioustimegivingtheirexpertanalysisandcommentsonthesubmissions.

Chosen-Ciphertext Security without Redundancyp. 1
Some RSA-Based Encryption Schemes with Tight Security Reductionp. 19
A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applicationsp. 37
Factoring Estimates for a 1024-Bit RSA Modulusp. 55
Index Calculus Attack for Hyperelliptic Curves of Small Genusp. 75
Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curvesp. 93
Tate Pairing Implementation for Hyperelliptic Curves y[superscript 2] = x[superscript p] - x + dp. 111
The ACM-X[subscript 0](N) Heegner Point Lifting Algorithm and Elliptic Curve Point Countingp. 124
Key Management Schemes for Stateless Receivers Based on Time Varying Heterogeneous Logical Key Hierarchyp. 137
Leakage-Resilient Authenticated Key Establishment Protocolsp. 155
Untraceable Fair Network Payment Protocols with Off-Line TTPp. 173
Incremental Multiset Hash Functions and Their Application to Memory Integrity Checkingp. 188
New Parallel Domain Extenders for UOWHFp. 208
Cryptanalysis of 3-Pass HAVALp. 228
Efficient Group Signatures without Trapdoorsp. 246
Accumulating Composites and Improved Group Signingp. 269
Almost Uniform Density of Power Residues and the Provable Security of ESIGNp. 287
Rotations and Translations of Number Field Sieve Polynomialsp. 302
On Class Group Computations Using the Number Field Sievep. 311
The Secret and Beauty of Ancient Chinese Padlocksp. 326
A Traceable Block Cipherp. 331
A New Attack against Khazadp. 347
An Efficient Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attackp. 359
Sequential Key Derivation Patterns for Broadcast Encryption and Key Predistribution Schemesp. 374
Boneh et al.'s k-Element Aggregate Extraction Assumption Is Equivalent to the Diffie-Hellman Assumptionp. 392
On Diophantine Complexity and Statistical Zero-Knowledge Argumentsp. 398
Verifiable Homomorphic Oblivious Transfer and Private Equality Testp. 416
Generalized Powering Functions and Their Application to Digital Signaturesp. 434
Certificateless Public Key Cryptographyp. 452
A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystemsp. 474
The Insecurity of Esign in Practical Implementationsp. 492
Efficient One-Time Proxy Signaturesp. 507
Universal Designated-Verifier Signaturesp. 523
Author Indexp. 543
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540205920
ISBN-10: 3540205926
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 550
Published: 18th November 2003
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.9
Weight (kg): 0.78

Earn 294 Qantas Points
on this Book