Identity-based CryptographyMarc Joye, Gregory Neven IOS Press, 2009 - 263 Seiten Posed as an open problem in 1984, but efficiently instantiated only in 2001, identity-based encryption hasn't left the forefront of cryptographic research since. Praised by fans as the economical alternative to public-key infrastructures, booed by critics for its inherent key escrow, identity-based cryptography is also the topic of numerous debates in the cryptographic community. Identity-Based Cryptography looks beyond the controversy and intends to give an overview of the current state-of-the-art in identity-based cryptography. Since research on the topic is still actively continuing, this is necessarily a snapshot of a field in motion, rather than the final word about it. Still, the authors felt the main concepts have by now sufficiently matured to collect them in a single dedicated volume. |
Inhalt
Introduction to IdentityBased Cryptography | 1 |
Pairings on Elliptic Curves | 13 |
IdentityBased Signatures | 31 |
IdentityBased Encryption and Hierarchical IdentityBased Encryption | 45 |
Flexible IBE and Beyond in the CommutativeBlinding Framework | 65 |
Generalized IBE in the ExponentInversion Framework | 83 |
ForwardSecure Hierarchical IBE with Applications to Broadcast Encryption | 100 |
IdentityBased Identification and Signature Schemes Using Error Correcting Codes | 119 |
AttributeBased Encryption | 156 |
On Generic Groups and Related Bilinear Problems | 169 |
Software Implementation of Pairings | 188 |
Hardware Implementation of Pairings | 207 |
Implementation Attacks Countermeasures | 226 |
Bibliography | 245 |
| 263 | |
Certificateless Encryption | 135 |
Häufige Begriffe und Wortgruppen
access structure Advances in Cryptology adversary algorithm arithmetic attack bilinear bilinear pairing Boneh certificate certificateless challenger chosen plaintext attack ciphertext Commutative Blinding Computer Science construction cryptography cryptosystems cyclic groups Dan Boneh decryption decryption oracle defined Diffie-Hellman Diffie-Hellman problem discrete logarithm editor efficient elements elliptic curve embedding degree encryption scheme finite field forward-secure fs-HIBE scheme given hash function HIBE scheme IBE scheme ID-tuple identity id identity-based encryption implementation input integer key derivation Lecture Notes master secret MHIBE multiplication node Notes in Computer outputs partial private key polynomial power analysis private key problem protocol pseudo-random public key queries random oracle random oracle model requires secret key selective-ID Setup signature scheme SIMD Springer-Verlag SSE2 standard model supersingular Tate pairing Theorem verify volume Weil pairing