Secure communication in minimal connectivity models
From MaRDI portal
Publication:1976002
DOI10.1007/s001459910002zbMath0957.68042OpenAlexW1964378537MaRDI 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
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (20)
Learning the state of nature in repeated games with incomplete information and signals ⋮ AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT ⋮ On one-round reliable message transmission ⋮ Mechanism design and communication networks ⋮ On minimal connectivity requirements for secure message transmission in directed networks ⋮ Probabilistic reliability and privacy of communication using multicast in general neighbor networks ⋮ Secure message transmission in asynchronous networks ⋮ On private computation in incomplete networks ⋮ Secure message transmission on directed networks ⋮ Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH ⋮ A folk theorem for repeated games played on a network ⋮ Cryptanalysis of Secure Message Transmission Protocols with Feedback ⋮ A one-round secure message broadcasting protocol through a key sharing tree ⋮ Efficient reliable communication over partially authenticated networks ⋮ On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks ⋮ Secure Message Transmission in Asynchronous Directed Graphs ⋮ Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness
This page was built for publication: Secure communication in minimal connectivity models
