Publications of crypto 1999

Page	Title
1-18	On the Security of RSA Padding
19-30	Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization
31-46	The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
47-64	Information-Theoretic Cryptography
65-79	Information Theoretically Secure Communication in the Limited Storage Space Model
80-97	The All-or-Nothing Nature of Two-Party Secure Computation
98-115	Adaptive Security for Threshold Cryptosystems
116-129	Two Party RSA Key Generation
130-147	Robust Distributed Multiplicaton with out Interaction
148-164	A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic
165-180	Truncated Differentials and Skipjack
181-197	Fast Correlation Attacks Based on Turbo Code Techniques
198-215	Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality
216-233	UMAC: Fast and Secure Message Authentication
234-251	SQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions
252-269	Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions
270-287	Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier
288-304	Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
305-314	Weakness in Quaternion Signatures
315-325	Cryptanalysis of ``2 R'' Schemes
326-337	Factoring N = prq for Large r
338-353	An Efficient Public Key Traitor Tracing Scheme
354-371	Dynamic Traitor Training
372-387	Efficient Methods for Integrating Traceability and Broadcast Encryption
388-397	Differential Power Analysis
398-412	Towards Sound Approaches to Counteract Power-Analysis Attacks
413-430	Separability and Efficiency for Generic Group Signature Schemes
431-448	A Forward-Secure Digital Signature Scheme
449-466	Abuse-Free Optimistic Contract Signing
467-484	Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
485-502	On Concurrent Zero-Knowledge with Pre-processing
503-518	On the Security Properties of OAEP as an All-or-Nothing Transform
519-536	Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
537-554	Secure Integration of Asymmetric and Symmetric Encryption Schemes
555-572	Auditable, Anonymous Electronic Cash Extended Abstract
573-590	Oblivious Transfer with Adaptive Queries
591-608	Compressing Cryptographic Resources
609-623	Coding Constructions for Blacklisting Problems without Computational Assumptions
624-638	An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes