Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary

DOI10.1007/978-3-642-21554-4_17zbMATH Open1435.94126OpenAlexW45304567MaRDI QIDQ3011307FDOQ3011307

Authors: Ashish Choudhury, Kaoru Kurosawa, Arpita Patra 

Publication date: 28 June 2011

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21554-4_17

Recommendations

• Round-efficient perfectly secure message transmission scheme against general adversary
• Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes
• Secure message transmission in the presence of a fully generalised adversary
• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• Perfectly secure message transmission against rational timid adversaries
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
• Round-optimal perfectly secret message transmission with linear communication complexity

zbMATH Keywords

efficiencyinformation-theoretic securityByzantine corruptionnon-threshold adversary

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (3)

• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Secure message transmission in the presence of a fully generalised adversary
• Round-efficient perfectly secure message transmission scheme against general adversary

This page was built for publication: Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary

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