Secure communication in minimal connectivity models

DOI10.1007/s001459910002zbMath0957.68042MaRDI QIDQ1976002

Matthew Franklin, Rebecca N. Wright

Publication date: 8 May 2000

Published in: Journal of Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

network models; secure communication

Mathematics Subject Classification ID

68P25: Data encryption (aspects in computer science)

94A62: Authentication, digital signatures and secret sharing

Related Items

Mechanism design and communication networks, ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH, Cryptanalysis of Secure Message Transmission Protocols with Feedback, Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary, Efficient reliable communication over partially authenticated networks, Secure message transmission in asynchronous networks, A one-round secure message broadcasting protocol through a key sharing tree, On minimal connectivity requirements for secure message transmission in directed networks, A folk theorem for repeated games played on a network, Learning the state of nature in repeated games with incomplete information and signals, On private computation in incomplete networks, Quantum verifiable protocol for secure modulo zero-sum randomness, On one-round reliable message transmission, Probabilistic reliability and privacy of communication using multicast in general neighbor networks, Secure message transmission on directed networks, Secure Message Transmission in Asynchronous Directed Graphs, AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT, Perfectly Secure Message Transmission Against Independent Rational Adversaries, Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited, On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks