An Auction Protocol without Collusion and Third-party's Trust using the Polynomial = Polynomial을 이용한 경매에서 담합과 Third-party의 신뢰성 제고에 관한 연구

다국어 초록 (Multilingual Abstract)

As the Internet is prevailing, there has been many changes throughout the society. The auction which is to buy and sell goods by Internet is developing at high speed and the Internet auction is a field that many customers are concerned in. But the activation of the Internet auction has not been done enough compared with the growing concerns of that.
The reason is that it is not a easy thing to trade with someone who is invisible trusting him/her completely in front of the computer. So, reliability is the most important factor. Therefore, it is more important than any other things to provide a safe and strong model and enhance purchasers' reliance to activate the Internet auction.
In this thesis, I proposed an efficient and safe PAP using the way to analyse the nature and information of the polynomial.
PAP has a superiority because it applies the trait of secret dispersion.
That is, it is impossible to get or analogize information of certain Party unless all the participants of the Bidders except the person conspire. As the matter of the result, the Bidders can admit the auction result because everyone can approve that. In addition, it can sort out the inferior Party easily through the performance of the DSP. So, it can lessen the malicious action will and even though those actions occur, it can detect it easily. In short, the Bidders can be under guarantee of the system's reliability. In the existing auction system, to strengthen the privacy the security is dependent on the coded Key information and sets the Key value large, which performs large operation such as multiple, exponent, molulus. And that tents to lower the efficiency. But PAP has solved the possible problem of exposure by having their own information not depending on the information like the coded key. And PAP increased the efficiency by using XOR operation avoiding the large amount of operation to increase the performance speed. In the matter of the expansion, we can apply P2P networking, and then we don't need to manage the bidders' role. As a result, everyone can perform the role of the auctioneer easily by reducing the role of that.
This solved the centralizing traffic problem as it disperses the centralizing traffic to the auctioneer. In conclusion, PAP solves the existing problems of auction models such as the consultation, the auction manager's possible dishonesty and it is superior to the operation efficiency and expansion of the auction's unit maintaining the security. But, the things to be improved is that it is possible for the auctioneer to identify the bidding price of the auction while the bidder's anonymity is guaranteed. It can be good in the aspect of bidders' proving as for the result, but I would like to consider to hide it. So, I will strengthen this point that even after the auction is finished, the information revealed to the auctioneer has to be hided. And that can be possible by applying the Trap door one way function that maintains the order even if the information is coded.

국문 초록 (Abstract)

경매 프로토콜의 우수성은 보안성, 효율성, 안정성의 측면에 있다. 기존에 제안된 경매 프로토콜은 보안을 강화함으로 인해 많은 계산량과 메시지 전송이 요구되어 높은 트래픽을 발생한다. 또한 경매의 규모가 커짐에 따라 Auctioneer의 부담이 가중 된다. 본 논문에서는 중간값 정리와 개인 정보 분할을 통해 기존의 보안성을 유지하면서도 효율성을 높인 경매 프로토콜 PAP를 제안한다. 효율성을 높이기 위해 곱연산을 피하고 xor연산을 이용하여 계산량을 줄이고, 안전성을 높이기 위해 다항함수(Polynomial)의 기본 성질을 이용해서 Bidder들의 정보를 분할하여 담합의 가능성과 Third-party의 신뢰해야 하는 문제점을 해결하였다. 실혐결과 제안한 경매 프로토콜은 기존의 경매 모델의 보안성을 유지하면서도 계산량이 줄었으며 부정한 운영자와 담합의 문제점등을 해결하여 신뢰성이 우수하다.

목차 (Table of Contents)

• 목차
• 1. 서론 = 1
• 1.1 인터넷 경매의 그 특징 = 1
• 1.2 인터넷 경매의 요구조건 = 2
• 1.3 연구의 목적과 범위 = 4
• 2. 관련연구 = 6
• 2.1 인터넷 경매의 연구 현황 = 6
• 2.2 다자계산이론 = 7
• 2.3 다자계산을 이용한 경매 모델 = 9
• 2.4 P2P 네트워킹 = 13
• 2.5 수학적 이론들 = 15
• 2.6 암호학적인 개념 = 17
• 3. Polynomial Auction Protocol(PAP) = 20
• 3.1 PAP의 다자계산 모델 구성 = 20
• 3.2 Polynomial의 특성 활용 = 22
• 3.3 프로토콜 구성요소 = 23
• 3.4 구성요소들간의 관계 = 25
• 3.5 PAP의 세부 동작 = 27
• 3.6 DSP의 동작 = 32
• 4. PAP 평가 = 34
• 4.1 경매 요구 조건에 대한 PAP 분석 = 34
• 4.2 PAP의 복잡도 = 35
• 5. 결론 및 향후과제 = 39
• 참고문헌 = 41