Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman? Stanford University [removed]

First Page		Document Content
Date: 2010-07-03 01:40:38 Computational hardness assumptions Finite groups Decisional Diffie–Hellman assumption XDH assumption XTR Cyclic group Subgroup Group action BLS Abstract algebra Group theory Algebra		Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman? Stanford University [removed] Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 347,10 KB Share Document on Facebook

	PDF Document DocID: 1xEB3 - View Document
	PDF Document DocID: 1x7Pp - View Document
	PDF Document DocID: 1x2j0 - View Document
	PDF Document DocID: 1wbaP - View Document
	PDF Document DocID: 1vZNA - View Document