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

DOI10.1007/s10998-012-6512-6zbMath1289.94046OpenAlexW2169307834MaRDI QIDQ2392053

Mihály Bárász, Dániel A. Nagy, László Mérai, 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

zbMATH Keywords

proof of knowledgesealed bid auctionsanonymous broadcastdining cryptographers

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Advances in Cryptology - EUROCRYPT 2004
• ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL
• Progress in Cryptology – Mycrypt 2005
• How to obtain full privacy in auctions
• Information Security and Cryptology - ICISC 2003

This page was built for publication: Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol