http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Information Security and Cryptology - ICISC 2000
Third International Conference, Seoul, Korea, December 8-9, 2000, Proceedings
I would like to welcome all the participants to the 3rd International Conference on Information Security and Cryptology (ICISC 2000). It is sponsored by the Korea Institute of Information Security and Cryptology (KIISC) and is being held at Dongguk University in Seoul, Korea from December 8 to 9, 2000. This conference aims at providing a forum for the presentation of new results in research, development, and application in information security and cryptology. This is also intended to be a place where research information can be exchanged. The Call for Papers brought 56 papers from 15 countries and 20 papers will be presented in ve sessions. As was the case last year the review process was totally blind and the anonymity of each submission was maintained. The 22 TPC members nally selected 20 top-quality papers for presentation at ICISC 2000. I am very grateful to the TPC members who devoted much e ort and time to reading and selecting the papers. We also thank the experts who assisted the TPC in evaluating various papers and apologize for not including their names here. Moreover, I would like to thank all the authors who submitted papers to ICISC 2000 and the authors of accepted papers for their preparation of came- ready manuscripts. Last but not least, I thank my student, Joonsuk Yu, who helped me during the whole process of preparation for the conference. I look forward to your participation and hope you will nd ICISC 2000 a truly rewarding experience.
A Note on the Higher Order Differential Attack of Block Ciphers with Two-Block Structures -- On the strength of KASUMI without FL functions against Higher Order Differential Attack -- On MISTY1 Higher Order Differential Cryptanalysis -- Difference Distribution Attack on DONUT and Improved DONUT -- New Results on Correlation Immunity -- Elliptic Curves and Resilient Functions -- Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction -- Characterization of Elliptic Curve Traces Under FR-Reduction -- A Multi-party Optimistic Non-repudiation Protocol -- Secure Matchmaking Protocol -- An Improved Scheme of the Gennaro-Krawczyk-Rabin Undeniable Signature System Based on RSA -- Efficient and Secure Member Deletion in Group Signature Schemes -- An Efficient and Practical Scheme for Privacy Protection in the E-Commerce of Digital Goods -- An Internet Anonymous Auction Scheme -- Efficient Sealed-bid Auction using Hash Chain -- Micropayments for Wireless Communications -- Cryptographic Applications of Sparse Polynomials over Finite Rings -- Efficient anonymous fingerprinting of electronic information with improved automation with improved automatic identification of redistributors -- Hash to the Rescue: Space Minimization for PKI Directories -- A Design of the Security Evaluation System for Decision Support in the Enterprise Network Security Management.
Discrete Mathematics in Computer Science
Management of Computing and Information Systems