TY - GEN
T1 - Network Coding-Based Post-Quantum Cryptography for Multi-Users with Different Security Permissions
AU - Cohen, Alejandro
AU - D'Oliveira, Rafael G.L.
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - We present a novel multi-legitimate-users hybrid universal network-coding cryptosystem which provides secure Post-Quantum (PQ) cryptography at high communication rates for users with varying levels of data access permission. In previous work, which considered only a single legitimate user network, it was shown how to combine an information-theoretically secure encoder together with partial encryption to obtain PQ security guarantees, even in the presence of an all-observing eavesdropper. This construction was called HUNCC. We provide a new hybrid PQ cryptosystem for broadcast setting, calling it B-HUNCC. Specifically, we consider a scenario in which there are two sets of messages: public messages, which must be available to all legitimate 'restricted and unrestricted' users in the noiseless network, and confidential messages, which must be available only to unrestricted users with appropriate access permission and hidden from other users in the multi-path noiseless network. Under this multi-legitimate-user setting, we provide an efficient hybrid solution: i) A capacity-achieving individually secure broadcast coding scheme that guarantees individual information-theoretic security for restricted users who can select to obtain any subset of the links and ii) a PQ cryptosystem that, by post-encrypting a small part of the transmitted data, guarantees individual indistinguishability under chosen ciphertext attack (individual IND-CCA1) against restricted users who may obtain the entirety network's links but without appropriate access permission, at high information rates.
AB - We present a novel multi-legitimate-users hybrid universal network-coding cryptosystem which provides secure Post-Quantum (PQ) cryptography at high communication rates for users with varying levels of data access permission. In previous work, which considered only a single legitimate user network, it was shown how to combine an information-theoretically secure encoder together with partial encryption to obtain PQ security guarantees, even in the presence of an all-observing eavesdropper. This construction was called HUNCC. We provide a new hybrid PQ cryptosystem for broadcast setting, calling it B-HUNCC. Specifically, we consider a scenario in which there are two sets of messages: public messages, which must be available to all legitimate 'restricted and unrestricted' users in the noiseless network, and confidential messages, which must be available only to unrestricted users with appropriate access permission and hidden from other users in the multi-path noiseless network. Under this multi-legitimate-user setting, we provide an efficient hybrid solution: i) A capacity-achieving individually secure broadcast coding scheme that guarantees individual information-theoretic security for restricted users who can select to obtain any subset of the links and ii) a PQ cryptosystem that, by post-encrypting a small part of the transmitted data, guarantees individual indistinguishability under chosen ciphertext attack (individual IND-CCA1) against restricted users who may obtain the entirety network's links but without appropriate access permission, at high information rates.
UR - http://www.scopus.com/inward/record.url?scp=85202842691&partnerID=8YFLogxK
U2 - 10.1109/ISIT57864.2024.10619165
DO - 10.1109/ISIT57864.2024.10619165
M3 - Conference contribution
AN - SCOPUS:85202842691
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2892
EP - 2897
BT - 2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
PB - Institute of Electrical and Electronics Engineers
T2 - 2024 IEEE International Symposium on Information Theory, ISIT 2024
Y2 - 7 July 2024 through 12 July 2024
ER -