Rate Adaptation for Secure HARQ Protocols

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secrecy & Rate Adaptation for secure HARQ protocols

This paper is dedicated to the study of HARQ protocols under a secrecy constraint. An encoder sends information to a legitimate decoder while keeping it secret from the eavesdropper. Our objective is to provide a coding scheme that satisfies both reliability and confidentiality conditions. This problem has been investigated in the literature using a coding scheme that involves a unique secrecy ...

متن کامل

Rate Adaptation for Secure HARQ Protocols

This paper investigates secure transmission using HARQ protocol when the encoder only knows the statistics of the channel-state. We analyze the tradeoff between reliability and secrecy probabilistic guarantees. The conventional approach of ensuring the secrecy via introduction of dummy-message is followed. However, unlike the previous works on this subject, we design a coding strategy tailored ...

متن کامل

HARQ Adaptation by Transmission Scheduling

In wireless communication schemes packetized data is transmitted by utilizing a certain modulation and coding scheme (MCS). The granularity effects provoked by a limited number of available MCS results in an inefficient performance. A hybrid automatic repeat request (HARQ) scheme is proposed, in which the granularity loss is reduced by scheduled transmissions. The scheduler tries to find a tran...

متن کامل

Multiparty Unconditionally Secure Protocols

Assume n participants P 1,P 2, . . . , Pn share the knowledge of a multivariable function F and that they want to publicly compute z =F (x1,x2, . . . , xn ), where xi is a secret input provided by Pi . The difficulty is to simultaneously provide the secrecy of each xi and to guarantee the correctness of the common result z . Such a task has been accomplished in [GMW] under the assumption that t...

متن کامل

Secure Electronic Voting Protocols

This chapter gives a summary of cryptographic e-voting protocols. We start with a motivation and an overview of some aspects of traditional elections. We then outline the security requirements of e-voting and present in detail two approaches to cryptographic e-voting, based on homomorphic encryption and mix networks. We finish the chapter with a list of open problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Forensics and Security

سال: 2018

ISSN: 1556-6013,1556-6021

DOI: 10.1109/tifs.2018.2833799