2014/03/22 by Pengwei Wang, Wang, Pengwei, Reihaneh Safavi–Naini +2
Computer Science · Engineering · #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Physical Unclonable Functions (PUFs) and Hardware Security #Wireless Communication Security Techniques #cs.CR
paper · pdf · doi:10.48550/arxiv.1403.5598
openalex publication_date 2014/03/22 · arxiv created 2015/04/21 · arxiv updated 2015/04/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Wyner's elegant model of wiretap channel exploits noise in the communication channel to provide perfect secrecy against a computationally unlimited eavesdropper without requiring a shared key. We consider an adversarial model of wiretap channel proposed in [18,19] where the adversary is active: it selects a fraction ρr of the transmitted codeword to eavesdrop and a fraction ρw of the codeword to corrupt by "adding" adversarial error. It was shown that this model also captures network adversaries in the setting of 1-round Secure Message Transmission [8]. It was proved that secure communication (1-round) is possible if and only if ρr + ρw <1. In this paper we show that by allowing communicants to have access to a public discussion channel (authentic communication without secrecy) secure communication becomes possible even if ρr + ρw >1. We formalize the model of \awtppd protocol and for two efficiency measures, \em information rate and \em message round complexity derive tight bounds. We also construct a rate optimal protocol family with minimum number of message rounds. We show application of these results to Secure Message Transmission with Public Discussion (SMT-PD), and in particular show a new lower bound on transmission rate of these protocols together with a new construction of an optimal SMT-PD protocol.