Partial Encryption after Encoding for Security and Reliability in Data Systems
Pages 1779 - 1784
Abstract
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.
References
[1]
M. Bloch and J. Barros, Physical-Layer Security: From Information Theory to Security Engineering. Cambridge University Press, 2011.
[2]
A. Cohen, R. G. L. D’Oliveira, S. Salamatian, and M. Médard, “Network coding-based post-quantum cryptography,” IEEE Journal on Selected Areas in Information Theory, 2021.
[3]
A. Kumar, C. Ottaviani, S. S. Gill, and R. Buyya, “Securing the future internet of things with post-quantum cryptography,” Security and Privacy, p. e200, 2021.
[4]
S. S. Gill, A. Kumar, H. Singh, M. Singh, K. Kaur, M. Usman, and R. Buyya, “Quantum computing: A taxonomy, systematic review and future directions,” Software: Practice and Experience, vol. 52, no. 1, pp. 66–114, 2022.
[5]
A. Cohen, A. Cohen, M. Médard, and O. Gurewitz, “Secure multi-source multicast,” IEEE Transactions on Communications, vol. 67, no. 1, pp. 708–723, 2018.
[6]
R. G. L. D’Oliveira, A. Cohen, J. Robinson, T. Stahlbuhk, and M. Médard, “Post-quantum security for ultra-reliable low-latency heterogeneous networks,” in MILCOM 2021-2021 IEEE Military Communications Conference (MILCOM). IEEE, 2021, pp. 933–938.
[7]
K. R. Duffy, J. Li, and M. Médard, “Capacity-achieving guessing random additive noise decoding,” IEEE Trans. Inf. Theory, vol. 65, no. 7, pp. 4023–4040, 2019.
[8]
D. Kobayashi, H. Yamamoto, and T. Ogawa, “Secure multiplex coding attaining channel capacity in wiretap channels,” IEEE transactions on information theory, vol. 59, no. 12, pp. 8131–8143, 2013.
[9]
K. Bhattad and K. R. Narayanan, “Weakly secure network coding,” NetCod, Apr, vol. 104, 2005.
[10]
D. Silva and F. R. Kschischang, “Universal weakly secure network coding,” in Networking and Information Theory, 2009. ITW 2009. IEEE Information Theory Workshop on. IEEE, 2009, pp. 281–285.
[11]
A. S. Mansour, R. F. Schaefer, and H. Boche, “Secrecy measures for broadcast channels with receiver side information: Joint vs individual,” in Information Theory Workshop (ITW), 2014 IEEE. IEEE, 2014, pp. 426–430.
[12]
A. S. Mansour, R. F. Schaefer, and H. Boche, “The individual secrecy capacity of degraded multi-receiver wiretap broadcast channels,” in 2015 IEEE International Conference on Communications (ICC). IEEE, 2015, pp. 4181–4186.
[13]
A. S. Mansour, R. F. Schaefer, and H. Boche, “On the individual secrecy capacity regions of the general, degraded and gaussian multi-receiver wiretap broadcast channel,” IEEE Transactions on Information and Security, 2016, vol. 11, no. 9, pp. 2107–2122, 2016.
[14]
Y. Chen, O. O. Koyluoglu, and A. Sezgin, “On the individual secrecy rate region for the broadcast channel with an external eavesdropper,” in 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015, pp. 1347–1351.
[15]
K. Jiang, T. Jing, F. Zhang, Y. Huo, and Z. Li, “Zf-sic based individual secrecy in simo multiple access wiretap channel,” IEEE Access, vol. 5, pp. 7244–7253, 2017.
[16]
A. Cohen, R. G. L. D’Oliveira, K. R. Duffy, and M. Médard, “Partial encryption after encoding for security and reliability in data systems,” arXiv preprint, 2022.
[17]
B. Möller, “A public-key encryption scheme with pseudo-random ciphertexts,” in European Symposium on Research in Computer Security. Springer, 2004, pp. 335–351.
[18]
D. J. Bernstein, “Introduction to post-quantum cryptography,” in Post-quantum cryptography. Springer, 2009, pp. 1–14.
[19]
P. Hellekalek and S. Wegenkittl, “Empirical evidence concerning AES,” ACM Transactions on Modeling and Computer Simulation (TOMACS), vol. 13, no. 4, pp. 322–333, 2003.
[20]
P. L’ecuyer and R. Simard, “TestU01: AC library for empirical testing of random number generators,” ACM Transactions on Mathematical Software (TOMS), vol. 33, no. 4, pp. 1–40, 2007.
[21]
A. Solomon, K. R. Duffy, and M. Médard, “Soft maximum likelihood decoding using GRAND,” in IEEE ICC, 2020.
[22]
K. R. Duffy, “Ordered reliability bits guessing random additive noise decoding,” in IEEE ICASSP, 2021, pp. 8268–8272.
[23]
K. R. Duffy, M. Médard, and W. An, “Guessing random additive noise decoding with symbol reliability information (SRGRAND),” IEEE Trans. Commun., vol. 70, no. 1, pp. 3–18, 2022.
[24]
T. M. Cover and J. A. Thomas, Elements of information theory. John Wiley & Sons, 2012.
Index Terms
- Partial Encryption after Encoding for Security and Reliability in Data Systems
Index terms have been assigned to the content through auto-classification.
Recommendations
Improved convertible authenticated encryption scheme with provable security
Convertible authenticated encryption (CAE) schemes allow a signer to produce an authenticated ciphertext such that only a designated recipient can decrypt it and verify the recovered signature. The conversion property further enables the designated ...
Proxy re-encryption systems for identity-based encryption
Pairing'07: Proceedings of the First international conference on Pairing-Based CryptographyA proxy re-encryption system allows the proxy to transform ciphertexts encrypted under Alice's public key into the different ciphertexts that can be decrypted by Bob's secret key. In this paper, we propose new proxy re-encryption systems; one for the ...
KDM security for identity-based encryption: Constructions and separations
AbstractFor encryption schemes, key dependent message (KDM) security requires that ciphertexts preserve secrecy even when the messages to be encrypted depend on the secret keys. While KDM security has been extensively studied for public-key ...
Comments
Information & Contributors
Information
Published In
Jun 2022
2876 pages
Copyright © 2022.
Publisher
IEEE Press
Publication History
Published: 26 June 2022
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Feb 2025