Concurrently Secure Identification Schemes based on the Worst-Case Hardness of Lattice Problems ASIACRYPT 2008 Dec. 10 - Group-based cryptography - Document - PDFSEARCH.IO

First Page	Meta Content
	Concurrently Secure Identification Schemes based on the Worst-Case Hardness of Lattice Problems ASIACRYPT 2008 Dec. 10 Add to Reading List Document Date: 2010-01-23 11:51:04 Open Document File Size: 2,98 MB Share Result on Facebook Facility Tokyo Institute of Technology / / Organization Tokyo Institute of Technology / / Person Keisuke Tanaka / Keita Xagawa / Akinori Kawachi / / Position SVP / SVP SVP / / SocialTag Cryptography Analytic geometry Lattice Abstract algebra Group theory Mathematics

Concurrently Secure Identification Schemes based on the Worst-Case Hardness of Lattice Problems ASIACRYPT 2008 Dec. 10Add to Reading List