Papers
Topics
Authors
Recent
2000 character limit reached

Analysis of Digital Knapsack Based Sealed Bid Auction

Published 1 May 2014 in cs.CR | (1405.0201v1)

Abstract: The need of totally secure online auction has led to the invention of many auction protocols. But as new attacks are developed, auction protocols also require corresponding strengthening. We analyze the auction protocol based on the well-known mathematical public-key knapsack problem for the design of asymmetric public-key knapsack trapdoor cryptosystem. Even though the knapsack system is not cryptographically secure, it can be used in certain auction situations. We describe the limitations of the protocol like detecting and solving the tie between bidders, malicious behavior of participants and also selection of price set by the seller and offer solutions.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.