Summing over a network without revealing summands

DOI10.1007/BF01932709zbMath0669.94024OpenAlexW2022441221MaRDI QIDQ1119609

George B. Purdy, Catherine A. Meadows

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932709

zbMATH Keywords

networksecuritygraph connectivitycryptographic protocolsnodeconspiracysecret elements

Mathematics Subject Classification ID

Cryptography (94A60) Applications of graph theory to circuits and networks (94C15)

Cites Work

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• How to share a secret
• On secret sharing systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Summing over a network without revealing summands