Advances in Cryptology - EUROCRYPT '94 Book

	Visual cryptography	1
	The size of a share must be large	13
	A linear construction of perfect secret sharing schemes	23
	On the dealer's randomness required in secret sharing schemes	35
	Black box cryptanalysis of hash networks based on multipermutations	47
	A practical attack against knapsack based hash functions	58
	The blinding of weak signatures	67
	Can D.S.A. be improved? Complexity trade-offs with the digital signature standard	77
	Designated confirmer signatures	86
	Optimal asymmetric encryption	92
	A multiple-iterated trapdoor for dense compact knapsacks	112
	On the security of some cryptosystems based on error-correcting codes	131
	Parallel divertibility of proofs of knowledge	140
	Methodology for digital money based on general cryptographic tools	156
	New group signature schemes	171
	Message recovery for signature schemes based on the discrete logarithm problem	182
	Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders	194
	The self-shrinking generator	205
	Feedback registers based on ramified extensions of the 2-adic numbers	215
	A general lower bound for the linear complexity of the product of shift-register sequences	223
	Embedding and probabilistic correlation attacks on clock-controlled shift registers	230
	Near optimal unconditionally secure authentication	244
	Authentication codes in plaintext and chosen-content attacks	254
	Linking information reconciliation and privacy amplification	266
	A secure and efficient conference key distribution system	275
	Space requirements for broadcast encryption	287
	How to break and repair Leighton and Micali's key agreement protocol	299
	Single-term divisible electronic coins	306
	Formal requirements for key distribution protocols	320
	Breaking an efficient anonymous channel	332
	On Matsui's linear cryptanalysis	341
	Links between differential and linear cryptanalysis	356
	On correlation between the order of S-boxes and the strength of DES	366
	Relationships among nonlinearity criteria	376
	Efficient exponentiation using precomputation and vector addition chains	389
	MIMD-factorisation on hypercubes	400
	New attacks on all double block length hash functions of hash rate 1, including the parallel-DM	410
	New potentially 'weak' keys for DES and LOKI	419
	Blackmailing using undeniable signatures	425
	Blind signatures based on the discrete logarithm problem	428
	Comments on soviet encryption algorithm	433
	Linear approximation of block ciphers	439
	Memory efficient variants of public-key schemes for smart card applications	445
	A systematic attack on clock controlled cascades	450
	On A[superscript 2]-codes including arbiter's attacks	456
	An improvement of Davies' attack on DES	461
	Q-deformed quantum cryptography	468
	Author Index	473