Eurocrypt is a series of open workshops on the theory and application of cryptographic techniques. These meetings have taken place in Europe every year since 1982 and are sponsored by the International Association for Cryptologic Research. Eurocrypt '93 was held in the village of Lofthus in Norway in May 1993. The call for papers resulted in 117 submissions with authors representing 27 different countries. The 36 accepted papers were selected by the program committee after a blind refereeing process. The papers are grouped into parts on authentication, public key, block ciphers, secret sharing, stream ciphers, digital signatures, protocols, hash functions, payment systems, and cryptanalysis. The volume includes 6 further rump session papers.

This book constitutes the refereed proceedings of the 20th Annual International Cryptology Conference, CRYPTO 2000, held in Santa Barbara, CA, USA in August 2000. The 32 revised full papers presented together with one invited contribution were carefully reviewed and selected from 120 submissions. The papers are organized in topical sections on XTR and NTRU, privacy for databases, secure distributed computation, algebraic cryptosystems, message authentication, digital signatures, cryptanalysis, traitor tracing and broadcast encryption, symmetric encryption, to commit or not to commit, protocols, and stream ciphers and Boolean functions.

This monograph is devoted to computational morphology, particularly to the construction of a two-dimensional or a three-dimensional closed object boundary through a set of points in arbitrary position. By applying techniques from computational geometry and CAGD, new results are developed in four stages of the construction process: (a) the gamma-neighborhood graph for describing the structure of a set of points; (b) an algorithm for constructing a polygonal or polyhedral boundary (based on (a)); (c) the flintstone scheme as a hierarchy for polygonal and polyhedral approximation and localization; (d) and a Bezier-triangle based scheme for the construction of a smooth piecewise cubic boundary.

Security is a rapidly growing area of computer science, with direct and increasing relevance to real-life applications, such as Internet transactions, e-commerce, information protection, network and systems security, etc. Foundations for the analysis and design of security features of such applications are badly needed in order to validate and prove their correctness. This book presents thoroughly revised versions of six tutorial lectures given by leading researchers during two International Schools on Foundations of Security Analysis and Design, FOSAD 2001/2002, held in Bertinoro, Italy, in September 2001 and September 2002. The lectures are devoted to: - Formal Approaches to Approximating Noninterference Properties - The Key Establishment Problem - Name-Passing Calculi and Cryptoprimitives - Classification of Security Properties; Network Security - Cryptographic Algorithms for Multimedia Traffic - Security for Mobility

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques are now in widespread use, especially in the financial services industry, in the public sector, and by individuals for their personal privacy, such as in electronic mail. This Handbook will serve as a valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography. It is a necessary and timely guide for professionals who practice the art of cryptography. The Handbook of Applied Cryptography provides a treatment that is multifunctional: It serves as an introduction to the more practical aspects of both conventional and public-key cryptography It is a valuable source of the latest techniques and algorithms for the serious practitioner It provides an integrated treatment of the field, while still presenting each major topic as a self-contained unit It provides a mathematical treatment to accompany practical discussions It contains enough abstraction to be a valuable reference for theoreticians while containing enough detail to actually allow implementation of the algorithms discussed Now in its third printing, this is the definitive cryptography reference that the novice as well as experienced developers, designers, researchers, engineers, computer scientists, and mathematicians alike will use.

Algorithms and Theory of Computation Handbook is a comprehensive collection of algorithms and data structures that also covers many theoretical issues. It offers a balanced perspective that reflects the needs of practitioners, including emphasis on applications within discussions on theoretical issues. Chapters include information on finite precision issues as well as discussion of specific algorithms where algorithmic techniques are of special importance, including graph drawing, robotics, forming a VLSI chip, vision and image processing, data compression, and cryptography. The book also presents some advanced topics in combinatorial optimization and parallel/distributed computing. • applications areas where algorithms and data structuring techniques are of special importance • graph drawing • robot algorithms • VLSI layout • vision and image processing algorithms • scheduling • electronic cash • data compression • dynamic graph algorithms • on-line algorithms • multidimensional data structures • cryptography • advanced topics in combinatorial optimization and parallel/distributed computing

This book contains a set of revised refereed papers selected from the presentations at the Second International Workshop on Fast Software Encryption held in Leuven, Belgium, in December 1994. The 28 papers presented significantly advance the state of the art of software algorithms for two cryptographic primitives requiring very high speeds, namely encryption algorithms and hash functions: this volume contains six proposals for new ciphers as well as new results on the security of the new proposals. In addition, there is an introductory overview by the volume editor. The papers are organized in several sections on stream ciphers and block ciphers; other papers deal with new algorithms and protocols or other recent results.