Schemes for Digital Gift Certificates with Low Computation Complexity

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6529

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6529

题名:	Schemes for Digital Gift Certificates with Low Computation Complexity
作者:	Chang, C. C.;Chang Y. F
关键词:	digital gift certificate;e-commerce
日期:	2005-12
上传时间:	2009-12-17 06:58:28 (UTC+0)
出版者:	Asia University
摘要:	Recently, e-commerce becomes widespread; hence electronic department stores come into being. As a result, Chan and Chang proposed a scheme for digital gift certificates in 2002. Because it is hard to estimate the number of the clients of the electronic department stores, reducing the computation complexity of the electronic department stores becomes an important issue. Due to the need, we propose two schemes for digital gift certificates. Our proposed schemes are very practical since the computation load is light. So the schemes can be applied to the terminals with low computation power.
關聯:	Informatica 16(4): 503-518
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
		0Kb	Unknown	351	检视/开启
310904400-6529.doc		43Kb	Microsoft Word	232	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.