Publications of eurocrypt 1999

Page	Title
1-11	Cryptanalysis of RSA with Private Key d Less than N0.292
12-23	Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
24-41	Software Performance of Universal Hash Functions
42-55	Lower Bounds for Oblivious Transfer Reductions
56-73	On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
74-89	Conditional Oblivious Transfer and Timed-Release Encryption
90-106	An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack
107-122	Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
123-139	Secure Hash-and-Sign Signatures Without the Random Oracle
140-149	A Note on the Limits of Collusion-Resistant Watermarks
150-164	Coin-Based Anonymous Fingerprinting
165-175	On the Performance of Hyperelliptic Cryptosystems
176-189	Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
190-205	Comparing the MOV and FR Reductions in Elliptic Curve Cryptography
206-222	Unbalanced Oil and Vinegar Signature Schemes
223-238	Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
239-254	New Public Key Cryptosystems Based on the Dependent-RSA Problems
255-271	Resistance Against General Iterated Attacks
272-285	XOR and Non-XOR Differential Probabilities
286-294	S-boxes with Controllable Nonlinearity
295-310	Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
311-326	Efficient Multiparty Computations Secure Against an Adaptive Adversary
327-346	Distributed Pseudo-random Functions and KDCs
347-362	Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
363-374	Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem
375-388	An Analysis of Exponentiation Based on Formal Languages
389-401	Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key
402-414	Computationally Private Information Retrieval with Polylogarithmic Communication
415-431	On the Concurrent Composition of Zero-Knowledge Proofs
432-445	Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications
446-458	Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question
459-474	Efficient Communication-Storage Tradeoffs for Multicast Encryption