Structured for the needs of professionals, as well as graduate level computer science students, this is the first reference to address the methodology, cryptographic and computational demands of a secure web. Using the author's observations of duality in two well-known cryptographic 'primitives', Digital Signatures introduces new strategies and methodologies for designing provably secure group-signatures based on traitor tracing schemes.

Contains full descriptions and formal proofs of almost all known provably-secure signature schemes Includes details on state-of-the-art signature schemes used extensively in practice Explains many of the the underlying methodologies for constructing secure signature schemes Appropriate for practitioners and students; will serve well as a reference or as a text for self-study Includes supplementary material: sn.pub/extras

Autorentext
Jonathan Katz is an associate professor in the Department of Computer Science at the University of Maryland. Active in the cryptography research community, he has held visiting positions at UCLA, '{E}cole Normale Sup'{e}rieure, and IBM. He has given several introductory lectures on cryptography to general audiences in both industry and government, and is an author of the textbook "Introduction to Modern Cryptography".

Klappentext
Digital Signatures is the first comprehensive account of the theoretical principles and techniques used in the design of provably secure signature schemes. In addition to providing the reader with a better understanding of the security guarantees provided by digital signatures, the book also contains full descriptions and detailed proofs for essentially all known secure signature schemes in the cryptographic literature. A valuable reference for students, professors, and researchers, Digital Signature Schemes can be used for self-study, as a supplement to a course on theoretical cryptography, or as a textbook in a graduate-level seminar.

Inhalt
Setting the Stage.- Digital Signatures: Background and Definitions.- Cryptographic Hardness Assumptions.- Digital Signature Schemes without Random Oracles.- Constructions Based on General Assumptions.- Signature Schemes Based on the (Strong) RSA Assumption.- Constructions Based on Bilinear Maps.- Digital Signature Schemes in the Random Oracle Model.- The Random Oracle Model.- Full-Domain Hash (and Related) Signature Schemes.- Signature Schemes from Identification Schemes.