View Document Preview and Link Document Date: 2010-07-03 01:40:38 Open Document File Size: 347,10 KB Share Result on Facebook
City Universiteit Leiden / Converting Pairing / / Company Introduction Bilinear / AES / G0t / Bilinear / / Country Netherlands / / / Event FDA Phase / / IndustryTerm subexponental-time algorithm / composite-order group protocols / tensor product / vector dot product / polynomial-time algorithm / generic algorithm / secure protocols / product groups / prime-order / non-interactive proof systems / online voting / finite / cyclic / abelian groups / / Organization NSF Directorate for Mathematical and Physical Sciences / g20 / office of Multidisciplinary Activities / National Science Foundation / Stanford University / / Person David Mandell Freeman / / Product G1 / / RadioStation Katz / / SportsLeague Stanford University / / Technology encryption / cryptography / secret key / subexponental-time algorithm / attribute-based encryption / polynomial-time algorithm / hierarchical identity-based encryption / / SocialTag 
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman? Stanford University [removed]