Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

65

FOCS
2007
IEEE

favoriteEmaildiscussreport

150views Theoretical Computer Science» more FOCS 2007»

Space-Efficient Identity Based Encryption Without Pairings

14 years 8 months ago

Space-Efficient Identity Based Encryption Without Pairings

Download eprint.iacr.org

Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which builds an IBE based on the quadratic residuosity problem modulo an RSA composite N. The Cocks

Dan Boneh, Craig Gentry, Michael Hamburg

Real-time Traffic

Bilinear Maps | FOCS 2007 | Identity Based Encryption | Residuosity Problem Modulo | Theoretical Computer Science |

claim paper

Related Content

» Identity Based Group Signatures from Hierarchical IdentityBased Encryption

» Strongly Unforgeable Signatures and Hierarchical IdentityBased Signatures from Lattices wi...

» Secure Identity Based Encryption Without Random Oracles

» Identity Based Encryption Without Redundancy

» IdentityBased Encryption from the Weil Pairing

» Practical IdentityBased Encryption Without Random Oracles

» Anonymous Hierarchical IdentityBased Encryption Without Random Oracles

» Efficient SelectiveID Secure IdentityBased Encryption Without Random Oracles

» Proxy Reencryption Systems for IdentityBased Encryption

Post Info
More Details (n/a)

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2007
Where	FOCS
Authors	Dan Boneh, Craig Gentry, Michael Hamburg

Comments (0)