Trustworthy Computing Under Identity-Based Encryption

The authors propose a fully functional Identity-Based Encryption scheme (IBE). The scheme has chosen cipher text security in the random oracle model assuming a variant of the computational Diffie-Hellman problem. Their system is based on bilinear maps between groups. The Weil pairing on elliptic curves is an example of such a map. They give precise definitions for secure identity based encryption schemes and give several applications for such systems. Trustworthy computing modules like Secure coProcessors (ScP) are already in extensive use today, albeit limited predominantly to scenarios where constraints on cost is not a serious limiting factor.

Provided by: International Journal of Computer Technology and Applications Topic: Security Date Added: Sep 2011 Format: PDF

Find By Topic