在当今电子消费系统中,经常出现由于多次消费而导致效率较低甚至金额紊乱的现象,为解决这一问题,提出一种新的电子消费方案。该方案基于双线性对和可链接环签名,运用可链接环签名的高效安全性,能够判断签名正确与否,并检测出同一用户的有限金额是否重复花费的功能,通过取款、消费、存款3个阶段,使消费者、商家及银行三方的交易相互联系,完成电子消费过程。分析结果表明,该方案安全、可行,能实现用户的匿名性及无法重复花费性,满足电子消费的基本要求。与Liu等人提出的方案(Wuhan University Journal of Natural Sciences,2013,No.2)相比,计算成本较低,效率较高。
Numerous privacy-preserving issues have emerged along with the fast development of Internet, both in theory and in real-life applications. To settle the privacy-preserving problems, secure multi-party computation is essential and critical. In this paper, we have solved two problems regarding to how to determine the position relation between points and curves without revealing any private information. Two protocols have been proposed in order to solve the problems in different conditions. In addition, some building blocks have been developed, such as scalar product protocol, so that we can take advantage of them to settle the privacy-preserving computational geometry problems which are a kind of special secure multi-party computation problems. Moreover, oblivious transfer and power series expansion serve as significant parts in our protocols. Analyses and proofs have also been given to argue our conclusion.
