Description |
1 online resource (xvi, 546 pages) : figure, table |
Series |
Lecture notes in computer science ; 3329 |
|
Lecture notes in computer science ; 3329
|
Contents |
Block Ciphers -- On Feistel Ciphers Using Optimal Diffusion Mappings Across Multiple Rounds -- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC -- Eliminating Random Permutation Oracles in the Even-Mansour Cipher -- Public Key Encryption -- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles -- OAEP 3-Round:A Generic and Secure Asymmetric Encryption Padding -- Invited Talk I -- Stream Ciphers: Dead or Alive? -- Number Theory and Algebra -- On the Generalized Linear Equivalence of Functions Over Finite Fields -- Sieving Using Bucket Sort -- Right-Invariance: A Property for Probabilistic Analysis of Cryptography Based on Infinite Groups -- Secure Computation -- Practical Two-Party Computation Based on the Conditional Gate -- Privacy in Non-private Environments -- Asynchronous Proactive Cryptosystems Without Agreement -- Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes -- Hash Functions -- Masking Based Domain Extenders for UOWHFs: Bounds and Constructions -- Higher Order Universal One-Way Hash Functions -- The MD2 Hash Function Is Not One-Way -- Key Management -- New Approaches to Password Authenticated Key Exchange Based on RSA -- Constant-Round Authenticated Group Key Exchange for Dynamic Groups -- A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size Against Self-Defensive Pirates -- Identification -- Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices -- Secret Handshakes from CA-Oblivious Encryption -- k-Times Anonymous Authentication (Extended Abstract) -- XL-Algorithms -- The XL-Algorithm and a Conjecture from Commutative Algebra -- Comparison Between XL and Gröbner Basis Algorithms -- Digital Signatures -- Generic Homomorphic Undeniable Signatures -- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings -- Public Key Cryptanalysis -- On the Security of MOR Public Key Cryptosystem -- Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice -- Colluding Attacks to a Payment Protocol and Two Signature Exchange Schemes -- Invited Talk II -- Information Security in Korea IT839 Strategy -- Symmetric Key Cryptanalysis -- How Far Can We Go Beyond Linear Cryptanalysis? -- The Davies-Murphy Power Attack -- Time-Memory Trade-Off Attacks on Multiplications and T-Functions -- Cryptanalysis of Bluetooth Keystream Generator Two-Level E0 -- Protocols -- On Provably Secure Time-Stamping Schemes -- Strong Conditional Oblivious Transfer and Computing on Intervals -- Improved Setup Assumptions for 3-Round Resettable Zero Knowledge |
Summary |
This book constitutes the refereed proceedings of the 10th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2004, held at Jeju Island, Korea in December 2004. The 35 revised full papers presented were carefully reviewed and selected from 208 submissions. The papers are organized in topical sections on block ciphers, public key encryption, number theory and applications, secure computation, hash functions, key management, identification, XL algorithms, digital signatures, public key cryptanalysis, symmetric key cryptanalysis, and cryptographic protocols |
Notes |
Title from title screen (viewed Nov. 17, 2004) |
|
Electronic book available via Springer Link |
|
Print version originally published in 2004 |
Bibliography |
Includes bibliographical references and index |
Notes |
Also issued online |
|
Mode of access: World Wide Web |
Subject |
Computer security -- Congresses.
|
|
Cryptography -- Congresses.
|
Genre/Form |
Conference papers and proceedings.
|
|
Conference papers and proceedings.
|
Author |
Lee, Pil Joong.
|
|
LINK (Online service)
|
LC no. |
2004115992 |
ISBN |
3540239758 |
|
9783540239758 |
|
3540305394 (electronic bk) |
|
9783540305392 (electronic bk) |
|