An efficient multi-round anonymous auction protocol

DOI10.1080/09720529.2007.10698138MaRDI QIDQ5446259zbMATH OpenOpenAlexFDO

Authors Cheng-Chi Lee, Min-Shiang Hwang, Chih-Wei Lin

Publication date 6 March 2008

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2007.10698138

zbMATH Keywords

knapsack problemsecurityauctionanonymitymultiparty computation

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• scientific article; zbMATH DE number 2080173
• A new protocol for multi-item electronic auctions
• scientific article; zbMATH DE number 1440072
• Fully private auctions in a constant number of rounds
• Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol

Cites work

• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• Adding timestamps to the secure electronic auction protocol
• Cryptanalysis: a survey of recent results
• How to share a secret

Cited in

(6)

• A new protocol for multi-item electronic auctions
• scientific article; zbMATH DE number 1857524 (Why is no real title available?)
• An efficient protocol for anonymous and fair document exchange.
• Practical electronic auction scheme with strong anonymity and bidding privacy
• Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol
• A Two-Server, Sealed-Bid Auction Protocol

This page was built for publication: An efficient multi-round anonymous auction protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446259)