Corpus ID: 13924976

Implementing a Secure Verifiable Auction

@inproceedings{Bun2015ImplementingAS,
  title={Implementing a Secure Verifiable Auction},
  author={Mark Bun and Yi-Hsiu Chen and Tom Morgan},
  year={2015}
}
An online auction system provides a platform that allows users to exchange items. Such a platform raises a number of interesting security concerns that are in tension with each other. On one hand, each bidder wishes to keep her bid private so that other bidders do not gain an advantage over her in the present or subsequent auctions. On the other hand, bidders and regulating authorities want to be able to verify that the result of an auction is correct, even in the face of a cheating auctioneer… Expand

Figures from this paper

References

SHOWING 1-7 OF 7 REFERENCES
Practical secrecy-preserving, verifiably correct and trustworthy auctions
We present a practical protocol based on homomorphic cryptography for conducting provably fair sealed-bid auctions. The system preserves the secrecy of the bids, even after the announcement ofExpand
Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions
TLDR
A novel secure and highly efficient method for validating correctness of the output of a transaction while keeping input values secret and for preparation of any number of committed-to split representations of the n input values is employed. Expand
Efficient End to End Verifiable Electronic Voting Employing Split Value Representations
We present a simple and fast method for conducting end to end voting and allowing public verification of correctness of the announced vote tallying results. In the present note voter privacyExpand
Cryptography miracles, secure auctions, matching problem verification
A solution to the persistent problem of preventing collusion in Vickrey auctions.
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications
We present a highly efficient method for proving correctness of computations while preserving secrecy of the input values. This is done in an Evaluator-Prover model which can also be realized by aExpand
Rivest . Efficient end to end verifiable electronic voting employing split value representations . To appear in
  • Proc . EVOTE
  • 2014