Absolutely secure message transmission using a key sharing graph
2-connected graphabsolutely securecollusioneavesdropperinternally disjoint pathskey sharing graphmessage transmissionmulticasttreeunicast
Paths and cycles (05C38) Connectivity (05C40) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
- A one-round secure message broadcasting protocol through a key sharing tree
- Secure message transmission on directed networks
- An application of st-numbering to secret key agreement
- Secret key amplification from uniformly leaked key exchange complete graph
- Characterization of optimal key set protocols
- A one-round secure message broadcasting protocol through a key sharing tree
- An application of st-numbering to secret key agreement
- Communication Theory of Secrecy Systems*
- Perfectly secure message transmission
- Secure communication in minimal connectivity models
- Secure communication in multicast channels: The answer to Franklin and Wright's question
- Secure Hypergraphs: Privacy from Partial Broadcast
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Secret key amplification from uniformly leaked key exchange complete graph
- Secure Message Transmission in Asynchronous Directed Graphs
- An application of st-numbering to secret key agreement
- scientific article; zbMATH DE number 1222849 (Why is no real title available?)
- scientific article; zbMATH DE number 970800 (Why is no real title available?)
This page was built for publication: Absolutely secure message transmission using a key sharing graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903639)
