TIENE EN SU CESTA DE LA COMPRA
en total 0,00 €
Features
Explains the state-of-the-art of the CL-PKC, including current challenges
Supplies rigorous treatment of CL-PKC that includes definitions, precise assumptions, and rigorous proofs of security
Provides vivid demonstrations of how CL-PKC can be used to solve practical problems
Describes some open problems that challenge new directions
Summary
As an intermediate model between conventional PKC and ID-PKC, CL-PKC can avoid the heavy overhead of certificate management in traditional PKC as well as the key escrow problem in ID-PKC altogether. Since the introduction of CL-PKC, many concrete constructions, security models, and applications have been proposed during the last decade. Differing from the other books on the market, this one provides rigorous treatment of CL-PKC.
Definitions, precise assumptions, and rigorous proofs of security are provided in a manner that makes them easy to understand.
Table of Contents
Setting the Stage
Avoiding key escrow
Mathematical concepts and properties
CL-PKC without Random Oracles
Concrete constructions of CLE
Generic construction of CLE
CLS secure in the standard model
CL-PKC in the Random Oracle Models
The random oracle model
CLE, CLS and CL-AKE secure in the random oracle model
CL-PKC without parings
Applications, Extensions and Related Primitives
Applications of CL-PKC
Extensions of CL-PKC
Comparisons between CL-PKC and SGC-PKC, Certificate-based PKC
Future Directions
Perspectives