a short signature scheme from the rsa family

ISCAS OpenIR > 信息安全国家重点实验室

	a short signature scheme from the rsa family
	Yu Ping; Xue Rui
	2011
会议名称	13th Information Security Conference, ISC 2010
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	307-318
会议日期	25-Oct
会议地点	Boca Raton, FL, United states
收录类别	EI
出版地	Germany
ISSN	3029743
ISBN	9783642181771
部门归属	(1) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
摘要	We propose a short signature scheme based on the complexity assumptions related to the RSA modulus. More specifically, the new scheme is secure in the standard model based on the strong RSA subgroup assumption. Most short signature schemes are based on either the discrete logarithm problem (or its variants), or the problems from bilinear mapping. So far we are not aware of any signature schemes in the RSA family can produce a signature shorter than the RSA modulus (in a typical setting, an RSA modulus is 1024 bits). The new scheme can produce a 420-bit signature, much shorter than the RSA modulus. In addition, the new scheme is very efficient. It only needs one modulo exponentiation with a 200-bit exponent to produce a signature. In comparison, most RSA-type signature schemes at least need one modulo exponentiation with 1024-bit exponent, whose cost is more than five times of the new scheme's. © 2011 Springer-Verlag.
关键词	Algebra Authentication
主办者	Center for Cryptology and Information Security (CCIS); Cent. Secur. Assur. IT (C-SAIT) Florida State Univ.; Charles E. Schmidt Coll. Sci. Florida Atlantic Univ.; Datamaxx Group
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/14375
专题	信息安全国家重点实验室
推荐引用方式 GB/T 7714	Yu Ping,Xue Rui. a short signature scheme from the rsa family[C]. Germany,2011:307-318.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
a short signature sc（215KB）			开放获取	--	请求全文