http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
4th International Conference, SCN 2004, Amalfi, Italy, September 8-10, 2004, Revised Selected Papers
The 4th International Conference on Security in Communication Networks 2004 (SCN2004)washeldatthe“DioceseHall”oftheArchdioceseofAmal?-Cavade’ Tirreni and the “Armorial Bearings Hall” of the Archbishop Palace in Amal?, Italy, on September 8–10, 2004. Previous conferences also took place in Amal? in 1996, 1999 and 2002. The conference aimed at bringing together researchers in the ?elds of cr- tography and security in communication networks to foster cooperation and the exchange of ideas. The main topics included all technical aspects of data security, including: anonymity,authentication,blockciphers,complexity-basedcryptography,cry- analysis, digital signatures, distributed cryptography, hash functions, identi?- tion,implementations,keydistribution,privacy,publickeyencryption,threshold cryptography, and zero knowledge. The Program Committee, consisting of 21 members, considered 79 papers and selected 26 for presentation; one of them was withdrawn by the authors. These papers were selected on the basis of originality, quality and relevance to cryptography and security in communication networks. Due to the high number of submissions, paper selection was a di?cult and challenging task, and many good submissions had to be rejected. Each subm- sion was refereed by at least three reviewers and some had four reports or more. We are very grateful to all the program committee members, who devoted much e?ort and valuable time to read and select the papers. In addition, we gratefully acknowledge the help of colleagues who reviewed submissions in their areas of expertise. They are all listed on page VII and we apologize for any inadvertent omissions. These proceedings include the revised versions of the 26 accepted papers andtheabstractoftheinvitedtalkbyBartPreneel(ECRYPT:theCryptographic Research Challenges for the Next Decade).
Invited Talk -- ECRYPT: The Cryptographic Research Challenges for the Next Decade -- Reduction of Security/Primitives -- Relationships Between Diffie-Hellman and “Index Oracles” -- On the Security Notions for Public-Key Encryption Schemes -- Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel -- Signature Schemes -- A Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs -- Group Signatures with Separate and Distributed Authorities -- Threshold Cryptography in Mobile Ad Hoc Networks -- Anonymity and Privacy -- Designated Verifier Signatures: Anonymity and Efficient Construction from Any Bilinear Map -- Group Signatures: Better Efficiency and New Theoretical Aspects -- Efficient Blind Signatures Without Random Oracles -- Authentication and Identification -- Minimalist Cryptography for Low-Cost RFID Tags (Extended Abstract) -- On the Key Exposure Problem in Chameleon Hashes -- Zero Knowledge -- Identity-Based Zero-Knowledge -- Public Key Cryptosystems -- A Robust Multisignature Scheme with Applications to Acknowledgement Aggregation -- Efficient Key Encapsulation to Multiple Parties -- Improved Signcryption from q-Diffie-Hellman Problems -- Distributed Cryptography -- Colored Visual Cryptography Without Color Darkening -- On the Size of Monotone Span Programs -- Universally Composable DKG with Linear Number of Exponentiations -- Cryptanalysis of Public Key Cryptosystems -- An Algebraic Approach to NTRU (q = 2 n ) via Witt Vectors and Overdetermined Systems of Nonlinear Equations -- Efficient Cryptanalysis of RSE(2)PKC and RSSE(2)PKC -- Cryptanalysis -- The Decimated Sample Based Improved Algebraic Attacks on the Nonlinear Filters -- Non-randomness of the Full 4 and 5-Pass HAVAL -- Email Security -- Controlling Spam by Secure Internet Content Selection -- Key Distribution and Feedback Shift Registers -- On Session Identifiers in Provably Secure Protocols -- How to Embed Short Cycles into Large Nonlinear Feedback-Shift Registers.
Management of Computing and Information Systems
Algorithm Analysis and Problem Complexity