Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol

DOI10.1007/S10998-012-6512-6zbMATH Open1289.94046OpenAlexW2169307834MaRDI QIDQ2392053FDOQ2392053

Authors: Mihály Bárász, László Mérai, Dániel A. Nagy, Péter Ligeti 

Publication date: 6 August 2013

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-012-6512-6

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

zbMATH Keywords

proof of knowledgesealed bid auctionsanonymous broadcastdining cryptographers

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites Work

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Progress in Cryptology – Mycrypt 2005
• How to obtain full privacy in auctions
• Advances in Cryptology - EUROCRYPT 2004
• Information Security and Cryptology - ICISC 2003
• Another twist in the dining cryptographers' protocol
• Title not available (Why is that?)

Cited In (4)

• An efficient multi-round anonymous auction protocol
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Two-Server, Sealed-Bid Auction Protocol

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)