Secure Hypergraphs: Privacy from Partial Broadcast

DOI10.1137/S0895480198335215MaRDI QIDQ5317559zbMATH OpenOpenAlexFDO

Authors Matthew Franklin, Moti 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

secure communicationunconditional security

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1263179
• Structural Information and Communication Complexity
• On private computation in incomplete networks
• Secret sharing schemes with partial broadcast channels
• Publication:4502504

Cited in

(14)

• Oblivious transfer in incomplete networks
• New bounds for randomized busing
• Privacy in non-private environments
• Percolation in the secrecy graph
• An application of st-numbering to secret key agreement
• scientific article; zbMATH DE number 1263179 (Why is no real title available?)
• scientific article; zbMATH DE number 1504553 (Why is no real title available?)
• scientific article; zbMATH DE number 1788241 (Why is no real title available?)
• Absolutely secure message transmission using a key sharing graph
• Secure Distributed Computing Made (Nearly) Optimal
• Distributed algorithms made secure: a graph theoretic approach
• Eavesdropping games
• Must the communication graph of MPC protocols be an expander?
• A one-round secure message broadcasting protocol through a key sharing tree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317559)