检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南昌大学软件学院,南昌330047 [2]沈阳市电化教育馆,沈阳110032 [3]东北大学信息科学与工程学院,沈阳110004
出 处:《计算机应用研究》2011年第1期322-325,共4页Application Research of Computers
基 金:基金项目:国家自然科学基金资助项目(60803131)
摘 要:完美同时签名技术是为解决公平交换问题而提出的,但目前几乎所有的公平交换协议都不提供机密性保护或采用的是先签名后加密的方法,而机密性是公平交换协议极为重要的安全需求。针对该问题,结合完美同时签名与签密技术提出了完美同时签密的概念,并提出了无证书的完美同时签密方案以及在随机预言模型下证明了方案的安全性。另外,该方案对交换双方模糊签密数据的产生顺序没有要求。与“先签名后加密”的方案比较,其具有更短的消息长度以及更少的计算开销,使得方案具有广泛的应用前景。Perfect concurrent signature was introduced as an efficient approach to solving the problem of fair exchange of sig- natures. Almost all fair exchange e-commerce protocols that have been proposed until now either do not provide message priva- cy protection or adopt the sign-then-encrypt scheme to provide confidentiality. However, confidentiality is an important re- quirement of e-commerce protocols. This paper proposed a new concept called perfect concurrent signcryption which combined the concepts of perfect concurrent signature and signcryption together to resolve the confidentiality problem in e-commerce sys- tems. It also proposed a certificateless perfect concurrent sigucryption scheme and proved its security in the random oracle model. The scheme published the two ambiguous signcryptions in any order. Compared with the sigu-then-encrypt scheme, this scheme enjoys shorter message length and less operation cost, which makes the scheme has wide application prospects.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222