Stelvio Cimato / Clemente Galdi / Giuseppe Persiano (eds.)

Security in Communication Networks

Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002, Revised Papers
Herausgegeben:Cimato, Stelvio; Galdi, Clemente; Persiano, Giuseppe

• Broschiertes Buch

Produktbeschreibung

The Third International Conference on Security in Communication Networks 2002 (SCN 2002) was held in the Salone Morelli of the Civic Museum of Amal?, Italy, September 11 13, 2002. The conference takes place every three years (p- vious ones were held in 1996 and 1999 in Amal? too) and aims to bring together researchers in the ?eld of security in communication networks to foster coop- ation and the exchange of ideas. The main topics included all technical aspects of data security including: anonymity implementation, authentication, key distribution, block ciphers, - erating systems security, complexity-based cryptography, privacy, cryptanalysis, protocols, digital signatures, public key encryption, electronic money, public key infrastructure, hash functions, secret sharing, identi?cation, surveys, and the state of the art. The program committee received 90 submissions in electronic format from 5 continents of which 24 were selected for presentation in 8 sessions. We had two invitedtalks, one by Eyal Kushilevitz from the Technion, Israel on Some ApplicationsofPolynomialsfortheDesignofCryptographicProtocols, andthe other by Ueli Maurer from ETH, Zurich, on Secure Multi-Party Computation Made Simple. Due to the high number of submissions, the reviewing phase was a very challenging process, and many good submissions had to be rejected. We are very grateful to all the program committee members, assisted by their colleagues, who devoted much e?ort and valuable time to read and select the papers.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 2576
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-00420-2
• 2003
• Seitenzahl: 380
• Erscheinungstermin: 21. Januar 2003
• Englisch
• Abmessung: 235mm x 155mm x 21mm
• Gewicht: 531g
• ISBN-13: 9783540004202
• ISBN-10: 3540004203
• Artikelnr.: 23388245

Autorenporträt

Stelvio Cimato, University of Salerno, Baronissi (SA), Italy / Clemente Galdi, Computer Technology Institute and University of Patras, Rio, Greece / Giuseppe Persiano, University of Salerno, Baronissi (SA), Italy

Inhaltsangabe

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.