Advances in Cryptology
EuroCrypt '94
Edited by Alfredo De Santis
- Visual cryptography, Naor, M. and Shamir, A.
- The size of a share must be large, Csirmaz, L.
- A linear construction of perfect secret sharing schemes, Dijk, M. van
- On the dealer's randomness required in secret sharing schemes, Blundo, C., Giorgio Gaggia, A. and Stinson, D. R.
- Black box cryptanalysis of hash networks based on multipermutations, Schnorr, C. P. and Vaudenay, S.
- A practical attack against knapsack based hash functions, Joux, A. and Granboulan, L.
- The blinding of weak signatures, Franklin, M. K. and Yung, M.
- Can D. S. A. be improved? Complexity trade-offs with the digital signature standard, Naccache, D., M'raihi, D., Vaudenay, S. and Raphaeli, D.
- Designated confirmer signatures, Chaum, D.
- Optimal asymmetric encryption, Bellare, M. and Rogaway, P.
- A multiple-iterated trapdoor for dense compact knapsacks, Orton, G. A.
- On the security of some cryptosystems based on error-correcting codes, Chabaud, F.
- Parallel divertibility of proofs of knowledge, Chen, L., Damgård, I. B. and Pedersen, T. P.
- Methodology for digital money based on general cryptographic tools, D'Amiano, S. and Di Crescenzo, G.
- New group signature schemes, Chen, L. and Pedersen, T. P.
- Message recovery for signature schemes based on the discrete logarithm problem, Nyberg, K. and Rueppel, R. A.
- Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders, Li, C. M., Hwang, T. and Lee, N. Y.
- The self-shrinking generator, Meier, W. and Staffelbach, O.
- Feedback registers based on ramified extensions of the 2-adic numbers, Goresky, M. and Klapper, A.
- A general lower bound for the linear complexity of the product of shift-register sequences, Goettfert, R. and Niederreiter, H.
- Embedding and probabilistic correlation attacks on clock-controlled shift registers, Golic, J. D. and O'Connor, L.
- Near optimal unconditionally secure authentication, Taylor, R.
- Authentication codes in plaintext and chosen-content attacks, Safavi-Naini, R. and Tombak, L.
- Linking information reconciliation and privacy amplification, Cachin, C. and Maurer, U. M.
- A secure and efficient conference key distribution system, Burmester, M. V. D. and Desmedt, Y.
- Space requirements for broadcast encryption, Blundo, C. and Cresti, A.
- How to break and repair Leighton and Micali's key agreement protocol, Zheng, Y.
- Single-term divisible electronic coins, Eng, T. and Okamoto, T.
- Formal requirements for key distribution protocols, Syverson, P. and Meadows, C.
- Breaking an efficient anonymous channel, Pfitzmann, B.
- On Matsui's linear cryptanalysis, Biham, E.
- Links between differential and linear cryptanalysis, Chabaud, F. and Vaudenay, S.
- On correlation between the order of S-boxes and the strength of DES, Matsui, M.
- Relationships among nonlinearity criteria, Seberry, J., Zhang, X. M. and Zheng, Y.
- Efficient exponentiation using precomputation and vector addition chains, Rooij, P. de
- MIMD-factorisation on hypercubes, Damm, F., Heider, F. P. and Wambach, G.
- New attacks on all double block length hash functions of hash rate 1, including the parallel-DM, Knudsen, L. R. and Lai, X.
- New potentially "weak" keys for DES and LOKI, Knudsen, L. R.
- Blackmailing using undeniable signatures, Jakobsson, M.
- Blind signatures based on the discrete logarithm problem, Camenisch, J. L., Piveteau, J. M. and Stadler, M. A.
- Comments on Soviet encryption algorithm, Charnes, C., O'Connor, L., Pieprzyk, J., Safavi-Naini, R. and Zheng, Y.
- Linear approximation of block ciphers, Nyberg, K.
- Memory efficient variants of public-key schemes for smart card applications, Shamir, A.
- A systematic attack on clock controlled cascades, Menicocci, R.
- On A2-codes including arbiter's attacks, Johansson, T. and Smeets, B.
- An improvement of Davies' attack on DES, Biham, E. and Biryukov, A.
- Q-deformed quantum cryptography, Hruby, J.
Copyright © 1998, Springer-Verlag.