Advances in Cryptology - ASIACRYPT 2004: 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5-9, 2004, ProceedingsPil Joong Lee The 10th Annual ASIACRYPT 2004 was held in Jeju Island, Korea, d- ing December 5–9, 2004. This conference was organized by the International Association for Cryptologic Research (IACR) in cooperation with KIISC (- rean Institute of Information Security and Cryptology) and IRIS (International Research center for Information Security) at ICU (Information and Communi- tionsUniversity),andwas?nanciallysupportedbyMIC(MinistryofInformation and Communication) in Korea. The conference received, from 30 countries, 208 submissions that represent the current state of work in the cryptographic community worldwide, covering all areas of cryptologic research. Each paper, without the authors’ information, was reviewed by at least three members of the program committee, and the papers (co-)authored by members of the program committee were reviewed by at least six members. We also blinded the reviewers’ names among the reviewers until the ?nal decision, by using pseudonyms. The reviews were then followed by deep discussions on the papers, which greatly contributed to the quality of the ?nal selection. In most cases, extensive comments were sent to the authors. Among 208 submissions, the program committee selected 36 papers. Two submissions were merged into a single paper, yielding the total of 35 papers acceptedforpresentationinthetechnicalprogramoftheconference.Manyhi- quality works could not be accepted because of the competitive nature of the conference and the challenging task of selecting a program. These proceedings contain revised versions of the accepted papers. These revisions have not been checked for correctness, and the authors bear full responsibility for the contents of their papers. |
Contents
Block Ciphers | 1 |
Efficient Instantiations of Tweakable Blockciphers | 16 |
Eliminating Random Permutation Oracles in the EvenMansour Cipher | 32 |
Public Key Encryption | 48 |
A Generic and Secure Asymmetric Encryption Padding | 63 |
Invited Talk I | 78 |
Sieving Using Bucket Sort | 92 |
Secure Computation | 119 |
Secret Handshakes from CAOblivious Encryption | 293 |
kTimes Anonymous Authentication | 308 |
XLAlgorithms | 323 |
Comparison Between XL and Gröbner Basis Algorithms | 338 |
Digital Signatures | 354 |
Efficient and Provably Secure TrapdoorFree Group Signature Schemes | 372 |
Public Key Cryptanalysis | 387 |
Cryptanalyzing the PolynomialReconstruction Based PublicKey System | 401 |
Privacy in Nonprivate Environments | 137 |
Asynchronous Proactive Cryptosystems Without Agreement | 152 |
LatticeBased ThresholdChangeability | 170 |
Hash Functions | 187 |
Higher Order Universal OneWay Hash Functions | 201 |
The MD2 Hash Function Is Not OneWay | 214 |
Key Management | 230 |
ConstantRound Authenticated Group Key Exchange | 245 |
A PublicKey BlackBox Traitor Tracing Scheme with Sublinear | 260 |
Identification | 276 |
Colluding Attacks to a Payment Protocol | 417 |
Invited Talk II | 430 |
The DaviesMurphy Power Attack | 451 |
TimeMemory TradeOff Attacks on Multiplications and TFunctions | 468 |
Cryptanalysis of Bluetooth Keystream Generator TwoLevel | 483 |
Protocols | 500 |
Strong Conditional Oblivious Transfer and Computing on Intervals | 515 |
Improved Setup Assumptions for 3Round Resettable Zero Knowledge | 530 |
| 545 | |
Other editions - View all
Common terms and phrases
active S-boxes Advances in Cryptology adversary Alice ASIACRYPT assume assumption attack authentication bits black-box block cipher ciphertext collision communication complexity Computer Science consider construction CRYPTO cryptographic Cryptology cryptosystem decoder decryption defined Definition denote Diffie-Hellman discrete logarithm distribution efficient ElGamal encryption scheme equations EUROCRYPT finite Gröbner basis group signature hash function Hence homomorphism input integer key exchange Lecture Notes Lemma linear cryptanalysis linearly equivalent LNCS matrix multiplication Notes in Computer obtain optimal oracle model output pair parties permutation plaintext player polynomial prime probability problem proof proposed protocol prove pseudorandom public key query random oracle random oracle model reduced right-invariant round S-boxes secret sharing Section security parameter server session key share simulator solution Springer-Verlag string Theorem tweakable blockcipher undeniable signature UOWHF vector verifier XL algorithm zero-knowledge