Cimato / Persiano / Galdi | Security in Communication Networks | Buch | 978-3-540-00420-2 | sack.de

Buch, Englisch, Band 2576, 263 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1170 g

Reihe: Lecture Notes in Computer Science

Cimato / Persiano / Galdi

Security in Communication Networks

Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002, Revised Papers
2003
ISBN: 978-3-540-00420-2
Verlag: Springer Berlin Heidelberg

Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002, Revised Papers

Buch, Englisch, Band 2576, 263 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1170 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-00420-2
Verlag: Springer Berlin Heidelberg


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 invited talks, 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.
Cimato / Persiano / Galdi Security in Communication Networks jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.