General perfectly secure message transmission using linear codes

DOI10.1007/978-3-642-17373-8_26MaRDI QIDQ3058672zbMATH OpenOpenAlexFDO

Authors Qiushi Yang, Yvo Desmedt

Publication date 7 December 2010

Published in Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17373-8_26

zbMATH Keywords

adversary structurelinear codesperfectly secure message transmissionround complexitytransmission complexity

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60) Linear codes (general theory) (94B05)

Recommendations

• Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• Perfectly Secure Message Transmission in Two Rounds
• Advances in Cryptology – CRYPTO 2004
• Round-efficient perfectly secure message transmission scheme against general adversary

Cited in

(5)

• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• Bounds and constructions for 1-round (0, )-secure message transmission against generalized adversary
• Limited view adversary codes: bounds, constructions and applications
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
• Round-efficient perfectly secure message transmission scheme against general adversary

This page was built for publication: General perfectly secure message transmission using linear codes

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