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 (Herausgeber)

Buch | Softcover

XIV, 550 Seiten

2003 | 2003
Springer Berlin (Verlag)
978-3-540-20592-0 (ISBN)

Artikel merken

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.

Public Key Cryptography I.- Chosen-Ciphertext Security without Redundancy.- Some RSA-Based Encryption Schemes with Tight Security Reduction.- A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications.- Number Theory I.- Factoring Estimates for a 1024-Bit RSA Modulus.- Index Calculus Attack for Hyperelliptic Curves of Small Genus.- Efficient Implementations.- Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves.- Tate Pairing Implementation for Hyperelliptic Curves y 2 = x p - x + d.- The AGM-X 0(N) Heegner Point Lifting Algorithm and Elliptic Curve Point Counting.- Key Management and Protocols.- Key Management Schemes for Stateless Receivers Based on Time Varying Heterogeneous Logical Key Hierarchy.- Leakage-Resilient Authenticated Key Establishment Protocols.- Untraceable Fair Network Payment Protocols with Off-Line TTP.- Hash Functions.- Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking.- New Parallel Domain Extenders for UOWHF.- Cryptanalysis of 3-Pass HAVAL.- Group Signatures.- Efficient Group Signatures without Trapdoors.- Accumulating Composites and Improved Group Signing.- Almost Uniform Density of Power Residues and the Provable Security of ESIGN.- Number Theory II.- Rotations and Translations of Number Field Sieve Polynomials.- On Class Group Computations Using the Number Field Sieve.- Invited Talk.- The Secret and Beauty of Ancient Chinese Padlocks.- Block Ciphers.- A Traceable Block Cipher.- A New Attack against Khazad.- Broadcast and Multicast.- An Efficient Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack.- Sequential Key Derivation Patterns for Broadcast Encryption and Key Predistribution Schemes.- Foundationsand Complexity Theory.- Boneh et al.'s k-Element Aggregate Extraction Assumption Is Equivalent to the Diffie-Hellman Assumption.- On Diophantine Complexity and Statistical Zero-Knowledge Arguments.- Verifiable Homomorphic Oblivious Transfer and Private Equality Test.- Public Key Cryptography II.- Generalized Powering Functions and Their Application to Digital Signatures.- Certificateless Public Key Cryptography.- A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems.- The Insecurity of Esign in Practical Implementations.- Digital Signature.- Efficient One-Time Proxy Signatures.- Universal Designated-Verifier Signatures.

Erscheint lt. Verlag	18.11.2003
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	XIV, 550 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	840 g
Themenwelt	Informatik ► Theorie / Studium ► Kryptologie
Schlagworte	Algorithm analysis and problem complexity • authentication • Complexity • Complexity theory • Computational Number Theory • Cryptanalysis • cryptographic protocols • cryptography • Cryptology • Cryptosystems • Data Security • digital signature schemes • group computation • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Information • Kryptographie / Kryptologie • multiparty-computation • Number Theory • Public Key Cryptography • secure communication • security
ISBN-10	3-540-20592-6 / 3540205926
ISBN-13	978-3-540-20592-0 / 9783540205920
Zustand	Neuware