Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes

Autor:	Stelios Erotokritou, Yvo Desmedt, Reihaneh Safavi-Naini
Rok vydání:	2010
Předmět:	Transmission (telecommunications) Computer science Distributed computing Reliability (computer networking) Coding theory Cryptographic protocol Communication complexity Secret sharing Time complexity Anti-replay
Zdroj:	Progress in Cryptology – AFRICACRYPT 2010 ISBN: 9783642126772 AFRICACRYPT
DOI:	10.1007/978-3-642-12678-9_11
Popis:	Recently Kurosawa and Suzuki considered almost secure (1-phase n-channel) message transmission when n=(2t+1). The authors gave a lower bound on the communication complexity and presented an exponential time algorithm achieving this bound. In this paper we present a polynomial time protocol achieving the same security properties for the same network conditions. Additionally, we introduce and formalize new security parameters to message transmission protocols which we feel are missing and necessary in the literature. We also focus on 2-phase protocols. We present a protocol achieving perfectly secure message transmission of a single message with O(n2) communication complexity in polynomial time. This is an improvement on previous protocols which achieve perfectly secure message transmission of a single message with a communication complexity of O(n3).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::3e5eaccb1e953e4ed6f48b0ef7bd4580 https://doi.org/10.1007/978-3-642-12678-9_11 Zobrazit plný text záznamu