Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman Stanford University, USA Eurocrypt 2010 - Decisional Diffie–Hellman assumption - Document - PDFSEARCH.IO

First Page	Meta Content
	Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman Stanford University, USA Eurocrypt 2010 Add to Reading List Document Date: 2010-07-03 02:36:48 Open Document File Size: 408,43 KB Share Result on Facebook City Converting Pairing / / Company G1 / / Country Monaco / / Facility Prime-Order Groups David Mandell Freeman Stanford University / / IndustryTerm bilinear groups / proof systems / Given / composite-order group cryptosystems using infrastructure / prime-order bilinear groups / / Organization Stanford University / / Person David Mandell Freeman / / SportsLeague Stanford University / / Technology encryption / Attribute-based encryption / / SocialTag Group theory Cryptography Decisional Diffie–Hellman assumption Pairing G1 Subgroup XDH assumption Algebra Computational hardness assumptions Mathematics

Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman Stanford University, USA Eurocrypt 2010Add to Reading List