Secure message transmission in the presence of a fully generalised adversary

DOI10.1515/JMC-2013-0046zbMATH Open1346.68089arXiv1512.04393OpenAlexW2964339741MaRDI QIDQ897708FDOQ897708

Chris Dowden

Publication date: 7 December 2015

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

Abstract: We investigate the problem of secure message transmission in the presence of a "fully generalised" adversary, who disrupts and listens to separate sets of communication wires. We extend previous results by considering the case when these sets may have arbitrary size, providing necessary and sufficient conditions for both one-way and two-way communication.

Full work available at URL: https://arxiv.org/abs/1512.04393

Recommendations

• Perfectly secure message transmission against rational timid adversaries
• Round-efficient perfectly secure message transmission scheme against general adversary
• scientific article; zbMATH DE number 2086727
• Perfectly Secure Message Transmission Revisited
• Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• Brief announcement: Reliable message transmission under partial knowledge and general adversaries
• Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes
• On Proactive Perfectly Secure Message Transmission

zbMATH Keywords

two-way communicationsecure message transmissiongeneralised adversaryone-way communication

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)

Cited In (5)

• Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
• On message protection in cryptosystems modelled as the generalized wire-tap channel II
• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Asynchronous Secure Communication Tolerating Mixed Adversaries
• Strong Secrecy From Channel Resolvability

This page was built for publication: Secure message transmission in the presence of a fully generalised adversary

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