Advances in Cryptology - EUROCRYPT 2002: International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002 ProceedingsLars Knudsen This book constitutes the refereed proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2002, held in Amsterdam, The Netherlands, in April/May 2002. The 33 revised full papers presented were carefully reviewed and selected from a total of 122 submissions. The papers are organized in topical sections on cryptanalysis, public-key encryption, information theory and new models, implementational analysis, stream ciphers, digital signatures, key exchange, modes of operation, traitor tracing and id-based encryption, multiparty and multicast, and symmetric cryptology. |
Contents
Cryptanalysis of a Pseudorandom Generator Based on Braid Groups | 1 |
Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups | 14 |
Extending the GHS Weil Descent Attack | 29 |
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure PublicKey Encryption | 45 |
KeyInsulated Public Key Cryptosystems | 65 |
On the Security of Joint Signature and Encryption | 83 |
AES and the Wide Trail Design Strategy | 108 |
Indistinguishability of Random Systems | 110 |
Cryptanalysis of the Revised NTRU Signature Scheme | 299 |
Dynamic Group DiffieHellman Key Exchange under Standard Assumptions | 321 |
Universally Composable Notions of Key Exchange and Secure Channels | 337 |
On Deniability in Quantum Key Exchange | 352 |
A PracticeOriented Treatment of Pseudorandom Number Generators | 368 |
A BlockCipher Mode of Operation for Parallelizable Message Authentication | 384 |
Whats Trust Got to Do with It? | 398 |
Efficient Generic ForwardSecure Signatures with an Unbounded Number Of Time Periods | 400 |
How to Fool an Unbounded Adversary with a Short Key | 133 |
Cryptography in an Unbounded Computational Model | 149 |
Performance Analysis and Parallel Implementation of Dedicated Hash Functions | 165 |
Fault Injection and a Timing Channel on an Analysis Technique | 181 |
Speeding Up Point Multiplication on Hyperelliptic Curves with EfficientlyComputable Endomorphisms | 197 |
An Algorithmic Point of View | 209 |
BDDBased Cryptanalysis of Keystream Generators | 222 |
Linear Cryptanalysis of Bluetooth Stream Cipher | 238 |
Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups | 256 |
Optimal Security Proofs for PSS and Other Signature Schemes | 272 |
Cryptanalysis of SFLASH | 288 |
Minimizing Assumptions for Security and ForwardSecurity | 418 |
Security Notions for Unconditionally Secure Signature Schemes | 434 |
Traitor Tracing with Constant Transmission Rate | 450 |
Toward Hierarchical IdentityBased Encryption | 466 |
Unconditional Byzantine Agreement and Multiparty Computation Secure against Dishonest Minorities from Scratch | 482 |
Perfectly Secure Message Transmission Revisited | 502 |
Degree of Composition of Highly Nonlinear Functions and Applications to Higher Order Differential Cryptanalysis | 518 |
Security Flaws Induced by CBC Padding Applications to SSL IPSEC WTLS | 534 |
| 546 | |
Other editions - View all
Advances in Cryptology - EUROCRYPT 2002: International Conference on the ... Lars Knudsen No preview available - 2002 |
Common terms and phrases
Advances in Cryptology adversary algorithm apply assume assumption authentication Bellare bits block cipher braid groups chosen ciphertext coefficients complexity Computer Science consider construction correlation corresponding cryptanalysis CRYPTO cryptographic Cryptology decryption defined Definition denote Diffie-Hellman digital signature distribution efficient elements elliptic curves encryption scheme equations EUROCRYPT finite forger forward-secure given hash functions hyperelliptic curves identification scheme input integer key exchange keystream lattice Lecture Notes Lemma length LFSR linear LNCS matrix node Notes in Computer obtain output permutation plaintext players polynomial prime private key PRNG probability problem projective hash family protocol pseudorandom public key Q(PK qsig queries random oracle model random system real numbers secret key Section security notion security parameter security proof semantic security sequence SFLASH signature scheme signcryption simulator Springer Springer-Verlag string Theorem tion traitor tracing update vector verifier