Craig Gentry, Jakob Jonsson, Jacques Stern, Michael Szydlo (auth.), Colin Boyd (eds.)3540429875, 9783540429876
Table of contents :
Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001….Pages 1-20
On the Insecurity of a Server-Aided RSA Protocol….Pages 21-35
The Modular Inversion Hidden Number Problem….Pages 36-51
Secure Human Identification Protocols….Pages 52-66
Unbelievable Security Matching AES Security Using Public Key Systems ….Pages 67-86
A Probable Prime Test with Very High Confidence for n ≡ 1 mod 4….Pages 87-106
Speeding Up XTR….Pages 107-124
An Efficient Implementation of Braid Groups….Pages 125-143
How to Achieve a McEliece-Based Digital Signature Scheme….Pages 144-156
Efficient Traitor Tracing Algorithms Using List Decoding….Pages 157-174
Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis….Pages 175-192
Known-IV Attacks on Triple Modes of Operation of Block Ciphers….Pages 193-207
Generic Attacks on Feistel Schemes….Pages 208-221
A Compact Rijndael Hardware Architecture with S-Box Optimization….Pages 222-238
Provable Security of KASUMI and 3GPP Encryption Mode f 8….Pages 239-254
Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices….Pages 255-271
Provably Authenticated Group Diffie-Hellman Key Exchange — The Dynamic Case….Pages 272-289
Fully Distributed Threshold RSA under Standard Assumptions….Pages 290-309
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes….Pages 310-330
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks….Pages 331-350
Oblivious Polynomial Evaluation and Oblivious Neural Learning….Pages 351-368
Mutually Independent Commitments….Pages 369-384
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank….Pages 385-401
Responsive Round Complexity and Concurrent Zero-Knowledge….Pages 402-421
Practical Construction and Analysis of Pseudo-Randomness Primitives….Pages 422-441
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions….Pages 442-459
An Extension of Kedlaya’s Point-Counting Algorithm to Superelliptic Curves….Pages 460-479
Supersingular Curves in Cryptography….Pages 480-494
Short Signatures from the Weil Pairing….Pages 495-513
Self-Blindable Credential Certificates from the Weil Pairing….Pages 514-532
How to Leak a Secret….Pages 533-551
Key-Privacy in Public-Key Encryption….Pages 552-565
Provably Secure air Blind Signatures with Tight Revocation….Pages 566-582
….Pages 583-601
Reviews
There are no reviews yet.