Round-efficient perfectly secure message transmission scheme against general adversary

DOI10.1007/s10623-011-9546-5zbMath1236.94058OpenAlexW2041149044MaRDI QIDQ766245

Kaoru Kurosawa

Publication date: 23 March 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9546-5

zbMATH Keywords

adversary structure\(Q ^2\)-adversary2-round3-roundperfectly secure message transmission schemesPSMTround efficiency

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Multiple assignment scheme for sharing secret
• Efficient perfectly secure message transmission in synchronous networks
• Player simulation and general adversary structures in perfect multiparty computation
• Perfectly secure message transmission
• On perfectly secure communication over arbitrary networks
• Advances in Cryptology – CRYPTO 2004
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
• Algorithms and Computation

This page was built for publication: Round-efficient perfectly secure message transmission scheme against general adversary