Advances in Cryptology — CRYPTO’ 99: 19th Annual International Cryptology Conference Santa Barbara, California, USA, August 15–19, 1999 Proceedings

Jean-Sébastien Coron, David Naccache, Julien P. Stern (auth.), Michael Wiener (eds.)3540663479, 9783540663478

Crypto ’99, the Nineteenth Annual Crypto Conference, was sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department, University of California, Santa Barbara (UCSB). The General Chair, Donald Beaver, was responsible for local organization and registration. The Program Committee considered 167 papers and selected 38 for presentation. This year’s conference program also included two invited lectures. I was pleased to include in the program UeliM aurer’s presentation “Information Theoretic Cryptography” and Martin Hellman’s presentation “The Evolution of Public Key Cryptography.” The program also incorporated the traditional Rump Session for informal short presentations of new results, run by Stuart Haber. These proceedings include the revised versions of the 38 papers accepted by the Program Committee. These papers were selected from all the submissions to the conference based on originality, quality, and relevance to the field of cryptology. Revisions were not checked, and the authors bear full responsibility for the contents of their papers.

---

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