3. SCN 2002: Amalfi, Italy

Invited Talks

• Eyal Kushilevitz:
  Some Applications of Polynomials for the Design of Cryptographic Protocols. 1-13
  
• Ueli M. Maurer:
  Secure Multi-party Computation Made Simple. 14-28
  

Forward Security

• Jonathan Katz, Rafail Ostrovsky, Moti Yung:
  Forward Secrecy in Password-Only Key Exchange Protocols. 29-44
  
• Gene Tsudik:
  Weak Forward Security in Mediated RSA. 45-54
  

Foundations of Cryptography

• Yevgeniy Dodis, Leonid Reyzin:
  On the Power of Claw-Free Permutations. 55-73
  
• Giovanni Di Crescenzo:
  Equivocable and Extractable Commitment Schemes. 74-87
  
• Nenad Dedic, Leonid Reyzin, Salil P. Vadhan:
  An Improved Pseudorandom Generator Based on Hardness of Factoring. 88-101
  
• Gene Itkis:
  Intrusion-Resilient Signatures: Generic Constructions, or Defeating Strong Adversary with Minimal Assumptions. 102-118
  

Key Management

• Giovanni Di Crescenzo, Olga Kornievskaia:
  Efficient Re-keying Protocols for Multicast Encryption. 119-132
  
• Frank Niedermeyer, Werner Schindler:
  On a Class of Key Agreement Protocols Which Cannot Be Unconditionally Secure. 133-145
  
• Hartono Kurnio, Reihaneh Safavi-Naini, Huaxiong Wang:
  A Group Key Distribution Scheme with Decentralised User Join. 146-163
  

Cryptanalysis

• Yuri L. Borissov, Svetla Nikova, Bart Preneel, Joos Vandewalle:
  On a Resynchronization Weakness in a Class of Combiners with Memory. 164-173
  
• Ali Aydin Selçuk, Ali Biçak:
  On Probability of Success in Linear and Differential Cryptanalysis. 174-185
  
• Hitoshi Yanami, Takeshi Shimoyama:
  Differential Cryptanalysis of a Reduced-Round SEED. 186-198
  

System Security

• Giuseppe Ateniese, Reza Curtmola, Breno de Medeiros, Darren Davis:
  Medical Information Privacy Assurance: Cryptographic and System Aspects. 199-218
  
• Luigi Catuogno, Ivan Visconti:
  A Format-Independent Architecture for Run-Time Integrity Checking of Executable Code. 219-233
  

Signature Schemes

• Louis Granboulan:
  How to Repair ESIGN. 234-240
  
• Anton Kozlov, Leonid Reyzin:
  Forward-Secure Signatures with Fast Key Update. 241-256
  
• Paulo S. L. M. Barreto, Ben Lynn, Michael Scott:
  Constructing Elliptic Curves with Prescribed Embedding Degrees. 257-267
  
• Jan Camenisch, Anna Lysyanskaya:
  A Signature Scheme with Efficient Protocols. 268-289
  

Zero Knowledge

• Yvo Desmedt, Yongge Wang:
  Efficient Zero-Knowledge Proofs for Some Practical Graph Problems. 290-302
  
• Xiaotie Deng, Chan H. Lee, Yunlei Zhao, Hong Zhu:
  Reduction Zero-Knowledge. 303-317
  
• Shirley H. C. Cheung, Xiaotie Deng, Chan H. Lee, Yunlei Zhao:
  A New Notion of Soundness in Bare Public-Key Model. 318-325
  

Information Theory and Secret Sharing

• Amos Beimel, Yoav Stahl:
  Robust Information-Theoretic Private Information Retrieval. 326-341
  
• B. Prabhu, K. Srinathan, C. Pandu Rangan:
  Trading Players for Efficiency in Unconditional Multiparty Computation. 342-353
  
• Jaume Martí-Farré, Carles Padró:
  Secret Sharing Schemes on Access Structures with Intersection Number Equal to One. 354-363