Publications of crypto 1997

Page	Title
1-15	The Complexity of Computing Hard Core Predicates
16-30	Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
31-45	Keeping the SZK-Verifier Honest Unconditionally
46-74	On the Foundations of Modern Cryptography
75-89	Plug and Play Encryption
90-104	Deniable Encryption
105-111	Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem
112-131	Public-Key Cryptosystems from Lattice Reduction Problems
132-149	RSA-Based Undeniable Signatures
150-164	Security of Blind Digital Signatures (Extended Abstract)
165-179	Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption)
180-197	How to Sign Digital Streams
198-212	Merkle-Hellman Revisited: A Cryptoanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations
213-220	Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack
221-234	A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy
235-248	On the Security of the KMOV Public Key Cryptosystem
249-263	A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroupp
264-276	The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems
277-291	"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case
292-306	Unconditional Security Against Memory-Bounded Adversaries
307-321	Privacy Amplification Secure Against Active Adversaries
322-336	Visual Authentication and Identification
337-341	Quantum Information Processing: The Good, the Bad and the Ugly
342-356	Efficient Algorithms for Elliptic Curve Cryptosystems
357-371	An Improved Algorithm for Arithmetic on a Family of Elliptic Curves
372-384	Fast RSA-Type Cryptosystems Using N-Adic Expansion
385-394	A One Way Function Based on Ideal Arithmetic in Number Fields
395-409	Efficient Anonymous Multicast and Reception (Extended Abstract)
410-424	Efficient Group Signature Schemes for Large Groups (Extended Abstract)
425-439	Efficient Generation of Shared RSA Keys (Extended Abstract)
440-454	Proactive RSA
455-469	Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
470-484	Collision-Resistant Hashing: Towards Making UOWHFs Practical
485-498	Fast and Secure Hashing Based on Codes
499-512	Edit Distance Correlation Attack on the Alternating Step Generator
513-525	Differential Fault Analysis of Secret Key Cryptosystems
526-537	Cryptoanalysis of the Cellular Encryption Algorithm