一個植基於自發性概念與仲裁機制之公平且安全的團購系統

A Fair and Secure Group Buying System Based on the Concept of Spontaneity and Arbitration Mechanism

鄧詠元(YONG-YUAN DENG)

指導教授 ： 陳金鈴 ； 曾顯文

朝陽科技大學/資訊學院/資訊管理系/博士(2016年)

摘要

隨著網路環境的快速發展，我們日常生活中的許多活動，都可以透過網路來完成。線上購物是這些網路活動中最常見的一個，這也包含團購的行為。一般而言，團購網站可區分為商業性團購網站，以及自發性團購網站。前者無法洞悉消費者真正的需求，而後者缺乏足夠的安全防護。
傳統上，買家與商家的交易，將會透過一間團購服務公司加以進行。然而，有時交易糾紛將因此產生。這可能是由於買家已透過團購服務公司付款，但是卻沒有收到商品。另一種可能是商家已將商品送達買家，卻沒有收到應收貨款。消費糾紛因此產生。
本論文區分為兩部分。在第一部分，我們提出一個基於自發性概念的安全行動團購系統。此系統應用Schnorr數位簽章機制，並且滿足多種安全性需求。我們也計算了每個階段與角色的計算成本和通訊成本。
在第二部分，我們提出一個公平的團購系統。此方案應用安全計算理論，達成像是交互驗證、傳輸資料的完整性、以及買家的匿名性等安全需求。我們基於仲裁計算機制，提出一個公平且安全的團購系統，並具備一個全面性的方法仲裁消費糾紛。
環顧四週，現今尚無團購網站或研究論文，滿足所有的優勢。我們提出的團購系統是基於自發性概念以及具備仲裁機制，計算成本和通訊成本的分析也指出本方案相當適合真實世界的應用。我們為買家、商家、團購服務公司，創造一個雙贏的局面。未來的發展將會聚焦在本方案的實作上。

關鍵字

仲裁計算 ； 匿名性 ； 顧客導向 ； 團購 ； 行動商務 ； 交互驗證 ； 不可否認 ； Schnorr數位簽章 ； 安全運算

並列摘要

With the rapid development of network systems, many of our daily life activities can now be performed via the Internet. Online shopping is one of the most common of these activities, which include group buying behavior. Group buying websites can be classified as either commercial group buying or spontaneous group buying sites. As things stand today, the former lacks insight into what consumers really want, and the latter lacks sufficient security protection.
Traditionally, buyers and merchants trade through a group buying service company. However, sometimes transaction disputes arise. This might happen because a buyer has already paid through a group buying service company but hasn’t received the merchandise or because a merchant has delivered merchandise to a buyer but has not been paid. Transaction disputes arise.
This dissertation separates into two parts. In the first part, we propose a secure mobile group buying system for application on spontaneous group buying websites. The proposed mechanism uses the Schnorr digital signature technique, and is able to satisfy many security requirements. The computation cost of each phase and party were also analyzed, and the communication efficiency of each phase was calculated.
In the second part, we propose a fair group buying system. The proposed scheme uses secure computing theory to meet the security requirements such as mutual authentication, integrity of transaction data and anonymity of buyer. We propose a fair and secure group buying system based on arbitration computing mechanism to provide a comprehensive method for arbitrating an appeal.
Looking around, there is no existing group buying websites or research articles, achieving all of the advantages. The proposed group buying system is based on the concept of spontaneity and equipped with arbitration mechanism. The computation and communication costs indicate that the proposed scheme is suitable for real world application. We create a win-win situation for the buyers, the merchants and the group buying service companies. Future work will focus on the implementation of this scheme.

並列關鍵字

Arbitration computing ； Anonymity ； Consumer-oriented ； Group buying ； Mobile commerce ； Mutual authentication ； Non-repudiation ； Schnorr digital signature ； Secure computing

參考文獻

Biham, E., and Shamir, A. (1991), “Differential cryptanalysis of DES-like cryptosystems”. Journal of Cryptology, 4, 1, 3–72.

Bloom, B. (1970), “Space/Time tradeoffs in hash coding with allowable errors”. Communications of the ACM, 13, 7, 422–426.

Chen, C. L., and Liao, J. J. (2011), “A fair online payment system for digital content via subliminal channel”. Electronic Commerce Research and Applications, Vol. 10, No. 3, 279-287.

ElGamal, T. (1985), “A public-key cryptosystem and a signature scheme based on discrete logarithms.” IEEE Transactions on Information Theory, 31, 4, 469–472.

Lee, J. S., and Lin, K. S. (2013), “An innovative electronic group-buying system for mobile commerce”. Electronic Commerce Research and Applications, 12, 1-13.