A Two-Server, Sealed-Bid Auction Protocol
From MaRDI portal
Publication:2995363
Recommendations
- Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol
- The design of a secure and fair sealed-bid auction service
- scientific article; zbMATH DE number 1440072
- Information Security and Cryptology - ICISC 2003
- scientific article; zbMATH DE number 1980956
- scientific article; zbMATH DE number 773971
- An efficient multi-round anonymous auction protocol
- scientific article; zbMATH DE number 2006591
Cited in
(13)- A correction to `efficient and secure comparison for on-line auctions'
- An efficient quantum sealed bidding auction scheme based on the correlation of genuine five-qubit entangled state
- FAST: fair auctions via secret transactions
- On server trust in private proxy auctions
- Verifiable homomorphic oblivious transfer and private equality test
- Quantum sealed-bid auction using a modified scheme for multiparty circular quantum key agreement
- Secure sealed-bid online auctions using discreet cryptographic proofs
- Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol
- Cryptanalysis and improvement of multiparty quantum sealed-bid auction
- How to obtain full privacy in auctions
- TIDE: a novel approach to constructing timed-release encryption
- Bit-slice auction circuit
- A secure \(M + 1^{\text{st}}\) price auction protocol based on bit slice circuits
This page was built for publication: A Two-Server, Sealed-Bid Auction Protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995363)