Moni Naor, Adi Shamir (auth.), Alfredo De Santis (eds.)3540601767, 9783540601760
The 36 revised full papers presented in the book are selected from 137 submissions and address all current research and advanced applicational aspects of cryptography; in addition, there are 11 short papers originating from the best special presentations accepted for the traditional rump session. The papers are organized in sections on secret sharing, hash functions, signatures, cryptosystems, pseudorandom generators, authentication codes, key agreement and key distribution, protocols, cryptanalysis and block ciphers, and number theory and algorithms.
Table of contents :
Visual cryptography….Pages 1-12
The size of a share must be large….Pages 13-22
A linear construction of perfect secret sharing schemes….Pages 23-34
On the dealer’s randomness required in secret sharing schemes….Pages 35-46
Black box cryptanalysis of hash networks based on multipermutations….Pages 47-57
A practical attack against knapsack based hash functions….Pages 58-66
The blinding of weak signatures….Pages 67-76
Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —….Pages 77-85
Designated confirmer signatures….Pages 86-91
Optimal asymmetric encryption….Pages 92-111
A multiple-iterated trapdoor for dense compact knapsacks….Pages 112-130
On the security of some cryptosystems based on error-correcting codes….Pages 131-139
Parallel divertibility of proofs of knowledge….Pages 140-155
Methodology for digital money based on general cryptographic tools….Pages 156-170
New group signature schemes….Pages 171-181
Message recovery for signature schemes based on the discrete logarithm problem….Pages 182-193
Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders….Pages 194-204
The self-shrinking generator….Pages 205-214
Feedback registers based on ramified extensions of the 2-adic numbers….Pages 215-222
A general lower bound for the linear complexity of the product of shift-register sequences….Pages 223-229
Embedding and probabilistic correlation attacks on clock-controlled shift registers….Pages 230-243
Near optimal unconditionally secure authentication….Pages 244-253
Authentication codes in plaintext and chosen-content attacks….Pages 254-265
Linking information reconciliation and privacy amplification….Pages 266-274
A secure and efficient conference key distribution system….Pages 275-286
Space requirements for broadcast encryption….Pages 287-298
How to break and repair Leighton and Micali’s key agreement protocol….Pages 299-305
Single-term divisible electronic coins….Pages 306-319
Formal requirements for key distribution protocols….Pages 320-331
Breaking an efficient anonymous channel….Pages 332-340
On Matsui’s linear cryptanalysis….Pages 341-355
Links between differential and linear cryptanalysis….Pages 356-365
On correlation between the order of S-boxes and the strength of DES….Pages 366-375
Relationships among nonlinearity criteria….Pages 376-388
Efficient exponentiation using precomputation and vector addition chains….Pages 389-399
MIMD-Factorisation on hypercubes….Pages 400-409
New attacks on all double block length hash functions of hash rate 1, including the Parallel-DM….Pages 410-418
New potentially ‘weak’ keys for DES amd LOK….Pages 419-424
Blackmailing using undeniable signatures….Pages 425-427
Blind signatures based on the discrete logarithm problem….Pages 428-432
Comments on Soviet encryption algorithm….Pages 433-438
Linear approximation of block ciphers….Pages 439-444
Memory efficient variants of public-key schemes for smart card applications….Pages 445-449
A systematic attack on clock controlled cascades….Pages 450-455
On A 2 -codes including arbiter’s attacks….Pages 456-460
An improvement of Davies’ attack on DES….Pages 461-467
Q-deformed quantum cryptography….Pages 468-472
Reviews
There are no reviews yet.