Secure Hypergraphs: Privacy from Partial Broadcast

DOI10.1137/S0895480198335215zbMath1080.94019OpenAlexW2080970448MaRDI QIDQ5317559

Matthew Franklin, Mordechai M. Yung

Publication date: 16 September 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480198335215

zbMATH Keywords

unconditional securitysecure communication

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

Oblivious transfer in incomplete networks ⋮ AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT ⋮ Privacy in non-private environments ⋮ Must the communication graph of MPC protocols be an expander? ⋮ ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH ⋮ A one-round secure message broadcasting protocol through a key sharing tree

This page was built for publication: Secure Hypergraphs: Privacy from Partial Broadcast