Bounds and constructions for 1-round (0, )-secure message transmission against generalized adversary

DOI10.1007/978-3-642-31410-0_6zbMATH Open1304.94082OpenAlexW161845448MaRDI QIDQ2900611FDOQ2900611

Authors: Mohammed Ashraful Alam Tuhin, Reihaneh Safavi-Naini 

Publication date: 23 July 2012

Published in: Progress in Cryptology - AFRICACRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31410-0_6

Recommendations

• General perfectly secure message transmission using linear codes
• Advances in Cryptology – CRYPTO 2004
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• Perfectly Secure Message Transmission in Two Rounds
• Secure Message Transmission in Asynchronous Directed Graphs

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (2)

• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
• Perfectly secure message transmission against independent rational adversaries

This page was built for publication: Bounds and constructions for \(1\)-round \((0,\delta )\)-secure message transmission against generalized adversary

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