Katz Digital Signatures

1. Auflage 2010
ISBN: 978-0-387-27712-7
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 192 Seiten

As a beginning graduate student, I recall being frustrated by a general lack of acces sible sources from which I could learn about (theoretical) cryptography. I remember wondering: why aren't there more books presenting the basics of cryptography at an introductory level? Jumping ahead almost a decade later, as a faculty member my graduate students now ask me: what is the best resource for learning about (various topics in) cryptography? This monograph is intended to serve as an answer to these 1 questions - at least with regard to digital signature schemes. Given the above motivation, this book has been written with a beginninggraduate student in mind: a student who is potentially interested in doing research in the ?eld of cryptography, and who has taken an introductory course on the subject, but is not sure where to turn next. Though intended primarily for that audience, I hope that advanced graduate students and researchers will find the book useful as well. In addition to covering various constructions of digital signature schemes in a unified framework, this text also serves as a compendium of various 'folklore' results that are, perhaps, not as well known as they should be. This book could also serve as a textbook for a graduate seminar on advanced cryptography; in such a class, I expect the entire book could be covered at a leisurely pace in one semester with perhaps some time left over for excursions into related topics.

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, Ecole Normale Superieure, 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'.

Autoren/Hrsg.

Katz, Jonathan

Inhaltsverzeichnis

1;Preface;8
2;Contents;12
3;Part I Setting the Stage;16
3.1;Chapter 1 Digital Signatures: Background and Definitions;17
3.1.1;1.1 Digital Signature Schemes: A Quick Introduction;17
3.1.2;1.2 Computational Security;20
3.1.3;1.3 Defining Signature Schemes;23
3.1.4;1.4 Motivating the Definitions of Security;25
3.1.5;1.5 Formal Definitions of Security;28
3.1.6;1.6 Relations Between the Notions;32
3.1.7;1.7 Achieving CMA-Security fromWeaker Primitives;33
3.1.8;1.8 From Unforgeability to Strong Unforgeability;41
3.1.9;1.9 Extending the Message Length;44
3.1.10;1.10 Further Reading;46
3.2;Chapter 2Cryptographic Hardness Assumptions;48
3.2.1;2.1 “Generic” Cryptographic Assumptions;48
3.2.2;2.2 Specific Assumptions;56
3.2.3;2.3 Hash Functions;66
3.2.4;2.4 Applications of Hash Functions to Signature Schemes;74
3.2.5;2.5 Further Reading;79
4;Part II Digital Signature Schemes withoutRandom Oracles;80
4.1;Chapter 3 Constructions Based on General Assumptions;81
4.1.1;3.1 Lamport’s One-Time Signature Scheme;82
4.1.2;3.2 Signatures from One-Time Signatures;86
4.1.3;3.3 Signatures from One-Way Functions;95
4.1.4;3.4 Further Reading;96
4.2;Chapter 4 Signature Schemes Based on the (Strong) RSAAssumption;98
4.2.1;4.1 Introduction;98
4.2.2;4.2 Signature Schemes Based on the RSA Assumption;101
4.2.3;4.3 Schemes Based on the Strong RSA Assumption;119
4.2.4;4.4 Further Reading;129
4.3;Chapter 5 Constructions Based on Bilinear Maps;131
4.3.1;5.1 Introduction;131
4.3.2;5.2 The Boneh-Boyen Scheme;133
4.3.3;5.3 The Waters Scheme;137
4.3.4;5.4 Further Reading;141
5;Part III Digital Signature Schemes in the Random Oracle Model;142
5.1;Chapter 6 The Random Oracle Model;143
5.1.1;6.1 Security Proofs in the Random Oracle Model;145
5.1.2;6.2 Is the Random Oracle Methodology Sound?;146
5.1.3;6.3 The Random Oracle Model in Practice;149
5.1.4;6.4 Further Reading;150
5.2;Chapter 7 Full-Domain Hash (and Related) SignatureSchemes;151
5.2.1;7.1 The Full-Domain Hash (FDH) Signature Scheme;151
5.2.2;7.2 An Improved Security Reduction for FDH;155
5.2.3;7.3 Probabilistic FDH;157
5.2.4;7.4 A Simpler Variant with a Tight Reduction;159
5.2.5;7.5 Further Reading;160
5.3;Chapter 8 Signature Schemes from Identification Schemes;162
5.3.1;8.1 Identification Schemes;163
5.3.2;8.2 From Identification Schemes to Signatures;166
5.3.3;8.3 Some Secure Identification Schemes;178
5.3.4;8.4 Further Reading;189
6;References;191
7;Index;197