The dining cryptographers problem: Unconditional sender and recipient untraceability
type: Item
instance of: scholarly article
title: The dining cryptographers problem: Unconditional sender and recipient untraceability
zbMATH Open document ID: 0654.94012
DOI: 10.1007/BF00206326
author: David Chaum
published in: Journal of Cryptology
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 4068778
zbMATH Keywords: dining cryptographers problem
zbMATH Keywords: untraceability
zbMATH Keywords: unconditional security
zbMATH Keywords: pseudonymity
zbMATH Keywords: one-time-use keys
zbMATH Keywords: public keys
Wikidata QID: Q56172630
MaRDI profile type: Publication
cites work: New directions in cryptography
cites work: Secure communications over insecure channels
description: scientific article; zbMATH DE number 4068778