Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol
From MaRDI portal
Publication:2392053
Recommendations
- An efficient multi-round anonymous auction protocol
- Secure sealed-bid online auctions using discreet cryptographic proofs
- scientific article; zbMATH DE number 1980956
- Practical electronic auction scheme with strong anonymity and bidding privacy
- A Two-Server, Sealed-Bid Auction Protocol
- scientific article; zbMATH DE number 773971
- scientific article; zbMATH DE number 1612530
Cites work
- scientific article; zbMATH DE number 1689604 (Why is no real title available?)
- scientific article; zbMATH DE number 1941238 (Why is no real title available?)
- scientific article; zbMATH DE number 2044547 (Why is no real title available?)
- scientific article; zbMATH DE number 883898 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- Another twist in the dining cryptographers' protocol
- How to obtain full privacy in auctions
- Information Security and Cryptology - ICISC 2003
- Progress in Cryptology – Mycrypt 2005
- The dining cryptographers problem: Unconditional sender and recipient untraceability
Cited in
(4)
This page was built for publication: Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392053)