Security in Communication Networks Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002, Revised Papers

This book constitutes the thoroughly refereed post-proceedings of the Third International Conference on Security in Communication Networks, SCN 2002, held in Amalfi, Italy in September 2002.
The 24 revised full papers presented together with two invited papers were carefully selected from 90 submissions during two rounds of reviewing and revision. The papers are organized in topical sections on forward security, foundations of cryptography, key management, cryptanalysis, systems security, digital signature schemes, zero knowledge, and information theory and secret sharing.

Invited Talks.- Some Applications of Polynomials for the Design of Cryptographic Protocols.- Secure Multi-party Computation Made Simple.- Forward Security.- Forward Secrecy in Password-Only Key Exchange Protocols.- Weak Forward Security in Mediated RSA.- Foundations of Cryptography.- On the Power of Claw-Free Permutations.- Equivocable and Extractable Commitment Schemes.- An Improved Pseudorandom Generator Based on Hardness of Factoring.- Intrusion-Resilient Signatures: Generic Constructions, or Defeating Strong Adversary with Minimal Assumptions.- Key Management.- Efficient Re-keying Protocols for Multicast Encryption.- On a Class of Key Agreement Protocols Which Cannot Be Unconditionally Secure.- A Group Key Distribution Scheme with Decentralised User Join.- Cryptanalysis.- On a Resynchronization Weakness in a Class of Combiners with Memory.- On Probability of Success in Linear and Differential Cryptanalysis.- Differential Cryptanalysis of a Reduced-Round SEED.- System Security.- Medical Information Privacy Assurance: Cryptographic and System Aspects.- A Format-Independent Architecture for Run-Time Integrity Checking of Executable Code.- Signature Schemes.- How to Repair ESIGN.- Forward-Secure Signatures with Fast Key Update.- Constructing Elliptic Curves with Prescribed Embedding Degrees.- A Signature Scheme with Efficient Protocols.- Zero Knowledge.- Efficient Zero-Knowledge Proofs for Some Practical Graph Problems.- Reduction Zero-Knowledge.- A New Notion of Soundness in Bare Public-Key Model.- Information Theory and Secret Sharing.- Robust Information-Theoretic Private Information Retrieval.- Trading Players for Efficiency in Unconditional Multiparty Computation.- Secret Sharing Schemes on Access Structures with Intersection Number Equal to One.