Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes.
Presented at: 3rd International Conference on Cryptology in Africa, Stellenbosch, SOUTH AFRICA.
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(n(2)) 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(n(3)).
|Type:||Conference item (UNSPECIFIED)|
|Title:||Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes|
|Event:||3rd International Conference on Cryptology in Africa|
|Location:||Stellenbosch, SOUTH AFRICA|
|Dates:||03 May 2010 - 06 May 2010|
|Keywords:||Information-theoretic cryptography, Perfectly secure message transmission, Almost secure message transmission, Cryptographic protocols, Privacy, Reliability, Coding theory, Secret sharing, ADVERSARIES, NETWORKS|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science
UCL > School of BEAMS > Faculty of Engineering Science > Computer Science
Archive Staff Only