TY - GEN
T1 - Partial Encryption after Encoding for Security and Reliability in Data Systems
AU - Cohen, Alejandro
AU - D'Oliveira, Rafael G.L.
AU - Duffy, Ken R.
AU - Médard, Muriel
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - We consider the problem of secure and reliable communication over a noisy multipath network. Previous work considering a noiseless version of our problem proposed a hybrid universal network coding cryptosystem (HUNCC). By combining an information-theoretically secure encoder together with partial encryption, HUNCC is able to obtain security guarantees, even in the presence of an all-observing eavesdropper. In this paper, we propose a version of HUNCC for noisy channels (N-HUNCC). This modification requires four main novelties. First, we present a network coding construction which is jointly, individually secure and error-correcting. Second, we introduce a new security definition which is a computational analogue of individual security, which we call individual indistinguishability under chosen ciphertext attack (individual IND-CCA1), and show that N-HUNCC satisfies it. Third, we present a noise based decoder for N-HUNCC, which permits the decoding of the encoded-then-encrypted data. Finally, we discuss how to select parameters for N-HUNCC and its error-correcting capabilities.
AB - We consider the problem of secure and reliable communication over a noisy multipath network. Previous work considering a noiseless version of our problem proposed a hybrid universal network coding cryptosystem (HUNCC). By combining an information-theoretically secure encoder together with partial encryption, HUNCC is able to obtain security guarantees, even in the presence of an all-observing eavesdropper. In this paper, we propose a version of HUNCC for noisy channels (N-HUNCC). This modification requires four main novelties. First, we present a network coding construction which is jointly, individually secure and error-correcting. Second, we introduce a new security definition which is a computational analogue of individual security, which we call individual indistinguishability under chosen ciphertext attack (individual IND-CCA1), and show that N-HUNCC satisfies it. Third, we present a noise based decoder for N-HUNCC, which permits the decoding of the encoded-then-encrypted data. Finally, we discuss how to select parameters for N-HUNCC and its error-correcting capabilities.
UR - https://www.scopus.com/pages/publications/85136293474
U2 - 10.1109/ISIT50566.2022.9834772
DO - 10.1109/ISIT50566.2022.9834772
M3 - Conference contribution
AN - SCOPUS:85136293474
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1779
EP - 1784
BT - 2022 IEEE International Symposium on Information Theory, ISIT 2022
PB - Institute of Electrical and Electronics Engineers
T2 - 2022 IEEE International Symposium on Information Theory, ISIT 2022
Y2 - 26 June 2022 through 1 July 2022
ER -