Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010343227 | TK5102.94 C36 2013 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
Modern cryptography has evolved dramatically since the 1970s. With the rise of new network architectures and services, the field encompasses much more than traditional communication where each side is of a single user. It also covers emerging communication where at least one side is of multiple users. New Directions of Modern Cryptography presents general principles and application paradigms critical to the future of this field.
The study of cryptography is motivated by and driven forward by security requirements. All the new directions of modern cryptography, including proxy re-cryptography, attribute-based cryptography, batch cryptography, and noncommutative cryptography have arisen from these requirements. Focusing on these four kinds of cryptography, this volume presents the fundamental definitions, precise assumptions, and rigorous security proofs of cryptographic primitives and related protocols. It also describes how they originated from security requirements and how they are applied.
The book provides vivid demonstrations of how modern cryptographic techniques can be used to solve security problems. The applications cover wired and wireless communication networks, satellite communication networks, multicast/broadcast and TV networks, and newly emerging networks. It also describes some open problems that challenge the new directions of modern cryptography.
This volume is an essential resource for cryptographers and practitioners of network security, security researchers and engineers, and those responsible for designing and developing secure network systems.
Author Notes
Zhenfu Cao is with Shanghai Jiao Tong University, P.R. of China
Table of Contents
Preface | p. xi |
Acknowledgments | p. xv |
Comments and Errata | p. xvii |
1 Introduction | p. 1 |
1.1 Trust Problem | p. 1 |
1.1.1 Trusted Domains Transfer Problem | p. 1 |
1.1.2 Trusted Server Problem | p. 3 |
1.2 Ciphertext Access Control Problem | p. 5 |
1.3 Efficiency Problems in Multi-Message Cryptology | p. 9 |
1.4 The Challenges from Quantum and Biological Computing | p. 11 |
1.5 Organization | p. 13 |
2 Proxy Re-Cryptography | p. 15 |
2.1 Introduction | p. 15 |
2.2 Proxy Re-Signature | p. 16 |
2.2.1 Properties and Definition | p. 16 |
2.2.2 Related Work | p. 19 |
2.2.3 Security Model: The AH Model | p. 20 |
2.2.4 Multiuse, Private Proxy and Bidirectional Scheme | p. 25 |
2.2.5 Incompleteness of the AH Model | p. 32 |
2.2.6 AH+ Model | p. 41 |
2.3 Proxy Re-Encryption | p. 44 |
2.3.1 Properties and Definition | p. 44 |
2.3.2 Related Work | p. 47 |
2.3.3 Security Models | p. 48 |
2.3.4 Single-Use, Unidirectional Scheme | p. 57 |
2.4 Notes | p. 72 |
3 Attribute-Based Cryptography | p. 73 |
3.1 Introduction | p. 73 |
3.2 Universal Definitions | p. 74 |
3.3 Bounded Ciphertext-Policy Encryption Schemes | p. 75 |
3.3.1 Definitions | p. 81 |
3.3.2 Security Models | p. 84 |
3.3.3 Basic BCPABE Scheme BCP1 | p. 85 |
3.3.4 Security Proof of BCP1 | p. 87 |
3.3.5 Extended BCPABE Scheme BCP2 | p. 92 |
3.3.6 Security Proof of BCP2 | p. 94 |
3.3.7 Comparisons | p. 99 |
3.4 Multi-Authority Encryption Schemes | p. 101 |
3.4.1 Security Models | p. 104 |
3.4.2 Construction | p. 110 |
3.4.3 Security Analysis | p. 113 |
3.4.4 Security Proofs | p. 119 |
3.5 Interval Encryption Schemes | p. 131 |
3.5.1 Definitions | p. 135 |
3.5.2 Security Models | p. 136 |
3.5.3 Binary Tree Encryption and Forward Secure Encryption | p. 138 |
3.5.4 A Generic Transformation from BTE to Interval Encryption | p. 141 |
3.5.5 Basic Construction: A Concrete Instantiation Based on HIBE | p. 144 |
3.5.6 Discussion on Efficiency and Security | p. 146 |
3.5.7 Extension Work | p. 148 |
3.6 Fuzzy Identity-Based Signature Schemes | p. 151 |
3.6.1 Definitions | p. 154 |
3.6.2 Security Models | p. 156 |
3.6.3 Construction | p. 157 |
3.6.4 Security Proofs | p. 159 |
3.6.5 Applications to Biometric Authentication | p. 163 |
3.7 Notes | p. 169 |
4 Batch Cryptography | p. 171 |
4.1 Introduction | p. 171 |
4.2 Aggregate Signature and Batch Verification | p. 172 |
4.2.1 Definitions | p. 174 |
4.2.2 Aggregate Signature | p. 176 |
4.2.3 Identity-Based Aggregate Signature | p. 177 |
4.3 Batch Decryption and Batch Key Agreement | p. 179 |
4.3.1 Review of RSA | p. 181 |
4.3.2 Batch RSA | p. 182 |
4.3.3 Batch Key Agreement | p. 187 |
4.4 Batch RSA's Implementation Based on Diophantine Equations | p. 188 |
4.4.1 Implementation Based on Plus-Type Equations | p. 188 |
4.4.2 A Concrete Example Based on Plus-Type Equations | p. 192 |
4.4.3 Implementation Based on Minus-Type Equations | p. 198 |
4.4.4 A Concrete Example Based on Minus-Type Equations | p. 200 |
4.5 Solving the Diophantine Equations | p. 202 |
4.5.1 Plus-Type Equations | p. 202 |
4.5.2 Minus-Type Equations | p. 217 |
4.6 Notes | p. 230 |
5 Noncommutative Cryptography | p. 233 |
5.1 Introduction | p. 233 |
5.2 Braid-Based Cryptography | p. 240 |
5.2.1 Basic Definitions | p. 240 |
5.2.2 Conjugacy and Related Problems | p. 241 |
5.2.3 Key Exchange, Encryption and Authentication | p. 244 |
5.2.4 Braid-Based Signatures | p. 248 |
5.2.5 One-More Like Assumptions and Provable Security | p. 249 |
5.2.6 New Cryptographic Problems in Braid Groups | p. 254 |
5.3 Z-Modular Method | p. 256 |
5.3.1 Z-Modular Method over Noncommutative Rings | p. 256 |
5.3.2 New Problems over Noncommutative Rings | p. 258 |
5.3.3 Diffie-Hellman-Like Key Agreement Protocol | p. 260 |
5.3.4 ElGamal-Like Encryption Scheme | p. 262 |
5.3.5 Instantiation and Illustration (I) | p. 269 |
5.3.6 Z-Modular Method over Noncommutative Groups/Semigroups | p. 275 |
5.3.7 Instantiation and Illustration (II) | p. 280 |
5.4 Using Monomials in Z-Modular Method | p. 286 |
5.4.1 Conjugate Left Self-Distributed System (Conj-LD) | p. 286 |
5.4.2 New Assumptions in Conj-LD Systems | p. 289 |
5.4.3 Cryptosystems from Conj-LD Systems | p. 293 |
5.4.4 Security and Efficiency Issues on Fat(b) | p. 299 |
5.5 Improved Key Exchange over Thompson's Group | p. 300 |
5.5.1 Thompson's Group and Decomposition Problem | p. 301 |
5.5.2 Analysis of SU05 Protocol | p. 302 |
5.5.3 Analysis of RST07 Attack | p. 303 |
5.5.4 Tests and Improvements | p. 308 |
5.6 Notes | p. 313 |
6 Perspectives | p. 315 |
6.1 On Proxy Re-Cryptography | p. 315 |
6.2 On Attribute-Based Cryptography | p. 317 |
6.3 On Batch Cryptography | p. 321 |
6.4 On Noncommutative Cryptography | p. 322 |
Appendixes | p. 329 |
Appendix A | p. 329 |
Appendix B | p. 332 |
Appendix C | p. 334 |
References | p. 347 |
Index | p. 373 |