Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme

DOI10.1109/TIT.2009.2030434MaRDI QIDQ4974071zbMATH OpenFDO

Authors Kaoru Kurosawa, Kazuhiro Suzuki

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2009.2030434

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(11)

• Oblivious transfer in incomplete networks
• Quantum verifiable protocol for secure modulo zero-sum randomness
• Two-message key exchange with strong security from ideal lattices
• On one-round reliable message transmission
• Round-optimal perfectly secret message transmission with linear communication complexity
• Secure Message Transmission in Asynchronous Directed Graphs
• Perfectly Secure Message Transmission in Two Rounds
• Realistic versus rational secret sharing
• Perfectly secure message transmission against independent rational adversaries
• Must the communication graph of MPC protocols be an expander?
• Practical unconditionally secure two-channel message authentication

This page was built for publication: Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme

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