Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information (2402.08407v1)

Published 13 Feb 2024 in cs.CR

Abstract: We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) in the finite blocklength regime that provides Post-Quantum (PQ) security at high communication rates. Recently, hybrid cryptosystems offered PQ security by premixing the data using secure coding schemes and encrypting only a small portion of it, assuming the data is uniformly distributed. An assumption that is often challenging to enforce. Standard fixed-length lossless source coding and compression schemes guarantee a uniform output in normalized divergence. Yet, his is not sufficient to guarantee security. We consider an efficient almost uniform compression scheme in non-normalized variational distance for the proposed hybrid cryptosystem, that by utilizing uniform sub-linear shared seed, guarantees PQ security. Specifically, for the proposed PQ cryptosystem, first, we provide an end-to-end coding scheme, NU-HUNCC, for non-uniform messages. Second, we show that NU-HUNCC is information-theoretic individually secured (IS) against an eavesdropper with access to any subset of the links. Third, we introduce a modified security definition, individually semantically secure under a chosen ciphertext attack (ISS-CCA1), and show that against an all-observing eavesdropper, NU-HUNCC satisfies its conditions. Finally, we provide an analysis that shows the high communication rate of NU-HUNCC and the negligibility of the shared seed size.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (49)
  1. S. Goldwasser and S. Micali, “Probabilistic encryption & how to play mental poker keeping secret all partial information,” in Providing sound foundations for cryptography: on the work of Shafi Goldwasser and Silvio Micali, 2019, pp. 173–201.
  2. D. J. Bernstein and T. Lange, “Post-quantum cryptography,” Nature, vol. 549, no. 7671, pp. 188–194, 2017.
  3. C. E. Shannon, “Communication theory of secrecy systems,” The Bell System Technical Journal, vol. 28, no. 4, pp. 656–715, 1949.
  4. A. D. Wyner, “The wire-tap channel,” The Bell System Technical Journal, vol. 54, no. 8, pp. 1355–1387, 1975.
  5. Y. Liang, H. V. Poor, and S. Shamai, “Physical layer security in broadcast networks,” Sec. and Comm. Net., vol. 2, no. 3, pp. 227–238, 2009.
  6. ——, “Information theoretic security,” Foundations and Trends® in Comm and Inf. Theory, vol. 5, no. 4–5, pp. 355–580, 2009.
  7. A. Carleial and M. Hellman, “A note on wyner’s wiretap channel (corresp.),” IEEE Trans. on Inf. Theory, vol. 23, no. 3, pp. 387–390, 1977.
  8. A. S. Mansour, R. F. Schaefer, and H. Boche, “Joint and individual secrecy in broadcast channels with receiver side information,” in 2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2014, pp. 369–373.
  9. ——, “The individual secrecy capacity of degraded multi-receiver wiretap broadcast channels,” in 2015 IEEE Int. Conf. on Comm. (ICC), 2015, pp. 4181–4186.
  10. Y. Chen, O. O. Koyluoglu, and A. Sezgin, “Individual secrecy for the broadcast channel,” IEEE Trans. on Inf. Theory, vol. 63, no. 9, pp. 5981–5999, 2017.
  11. J. Y. Tan, L. Ong, and B. Asadi, “Can marton coding alone ensure individual secrecy?” in 2019 IEEE Information Theory Workshop (ITW).   IEEE, 2019, pp. 1–5.
  12. A. Cohen, R. G. D’Oliveira, C.-Y. Yeh, H. Guerboukha, R. Shrestha, Z. Fang, E. Knightly, M. Médard, and D. M. Mittleman, “Absolute security in terahertz wireless links,” IEEE Journal of Selected Topics in Signal Processing, 2023.
  13. C.-Y. Yeh, A. Cohen, R. G. D’Oliveira, M. Médard, D. M. Mittleman, and E. W. Knightly, “Securing angularly dispersive terahertz links with coding,” IEEE Trans. on Inf. Forensics and Security, 2023.
  14. P. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 124–134.
  15. R. J. McEliece, “A public-key cryptosystem based on algebraic,” Coding Thv, vol. 4244, pp. 114–116, 1978.
  16. R. Nojima, H. Imai, K. Kobara, and K. Morozov, “Semantic security for the McEliece cryptosystem without random oracles,” Designs, Codes and Cryptography, vol. 49, pp. 289–305, 2008.
  17. N. Dottling, R. Dowsley, J. Muller-Quade, and A. C. Nascimento, “A CCA2 secure variant of the McEliece cryptosystem,” IEEE Trans. on Inf. Theory, vol. 58, no. 10, pp. 6672–6680, 2012.
  18. F. Aguirre Farro and K. Morozov, “On IND-CCA1 Security of Randomized McEliece Encryption in the Standard Model,” in Code-Based Cryptography: 7th International Workshop, CBC 2019, Darmstadt, Germany, May 18–19, 2019, Revised Selected Papers 7.   Springer, 2019, pp. 137–148.
  19. E. Berlekamp, “Goppa codes,” IEEE Trans. on Inf. Theory, vol. 19, no. 5, pp. 590–592, 1973.
  20. N. Patterson, “The algebraic decoding of goppa codes,” IEEE Trans. on Inf. Theory, vol. 21, no. 2, pp. 203–207, 1975.
  21. J.-C. Faugere, V. Gauthier-Umana, A. Otmani, L. Perret, and J.-P. Tillich, “A distinguisher for high-rate McEliece cryptosystems,” IEEE Trans. on Inf. Theory, vol. 59, no. 10, pp. 6830–6844, 2013.
  22. 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, vol. 2, no. 1, pp. 49–64, 2021.
  23. A. Cohen, A. Cohen, M. Médard, and O. Gurewitz, “Secure multi-source multicast,” IEEE Trans. on Comm., vol. 67, no. 1, pp. 708–723, 2019.
  24. A. Cohen, R. G. D’Oliveira, K. R. Duffy, and M. Médard, “Partial encryption after encoding for security and reliability in data systems,” in 2022 IEEE Int. Sym. on Inf. Theory (ISIT).   IEEE, 2022, pp. 1779–1784.
  25. R. G. 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.
  26. T. S. Han, “Folklore in source coding: Information-spectrum approach,” IEEE Trans. on Inf. Theory, vol. 51, no. 2, pp. 747–753, 2005.
  27. R. A. Chou and M. R. Bloch, “Data compression with nearly uniform output,” in 2013 IEEE Int. Sym. on Inf. Theory.   IEEE, 2013, pp. 1979–1983.
  28. R. A. Chou, M. R. Bloch, and E. Abbe, “Polar coding for secret-key generation,” IEEE Trans. on Inf. Theory, vol. 61, no. 11, pp. 6213–6237, 2015.
  29. R. A. Chou, B. N. Vellambi, M. R. Bloch, and J. Kliewer, “Coding schemes for achieving strong secrecy at negligible cost,” IEEE Trans. on Inf. Theory, vol. 63, no. 3, pp. 1858–1873, 2017.
  30. D. Slepian and J. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. on Inf. Theory, vol. 19, no. 4, pp. 471–480, 1973.
  31. D. Kobayashi, H. Yamamoto, and T. Ogawa, “Secure multiplex coding attaining channel capacity in wiretap channels,” IEEE Trans. on Inf. Theory, vol. 59, no. 12, pp. 8131–8143, 2013.
  32. K. Bhattad, K. R. Narayanan et al., “Weakly secure network coding,” NetCod, Apr, vol. 104, pp. 8–20, 2005.
  33. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, “Relations among notions of security for public-key encryption schemes,” in Advances in Cryptology—CRYPTO’98: 18th Annual International Cryptology Conference Santa Barbara, California, USA August 23–27, 1998 Proceedings 18.   Springer, 1998, pp. 26–45.
  34. R. Dowsley, J. Müller-Quade, and A. C. Nascimento, “A CCA2 secure public key encryption scheme based on the McEliece assumptions in the standard model,” in Cryptographers’ Track at the RSA Conference.   Springer, 2009, pp. 240–251.
  35. E. Arikan, “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Trans. on Inf. Theory, vol. 55, no. 7, pp. 3051–3073, 2009.
  36. H. S. Cronie and S. B. Korada, “Lossless source coding with polar codes,” in 2010 IEEE Int. Sym. on Inf. Theory.   IEEE, 2010, pp. 904–908.
  37. D. Aldous, “Random walks on finite groups and rapidly mixing markov chains,” in Séminaire de Probabilités XVII 1981/82: Proceedings.   Springer, 1983, pp. 243–297.
  38. S. B. Korada and R. L. Urbanke, “Polar codes are optimal for lossy source coding,” IEEE Transactions on Information Theory, vol. 56, no. 4, pp. 1751–1768, 2010.
  39. S. Kullback, “A lower bound for discrimination information in terms of variation (corresp.),” IEEE Trans. on Inf. Theory, vol. 13, no. 1, pp. 126–127, 1967.
  40. F. Topsøe, “Bounds for entropy and divergence for distributions over a two-element set,” J. Ineq. Pure Appl. Math, vol. 2, no. 2, 2001.
  41. D. Silva and F. R. Kschischang, “Universal weakly secure network coding,” in 2009 IEEE Information Theory Workshop on Networking and Information Theory.   IEEE, 2009, pp. 281–285.
  42. ——, “Fast encoding and decoding of gabidulin codes,” in 2009 IEEE Int. Sym. on Inf. Theory.   IEEE, 2009, pp. 2858–2862.
  43. R. Koetter and F. R. Kschischang, “Coding for errors and erasures in random network coding,” IEEE Trans. on Inf. Theory, vol. 54, no. 8, pp. 3579–3591, 2008.
  44. D. Silva, F. R. Kschischang, and R. Koetter, “A rank-metric approach to error control in random network coding,” IEEE Trans. on Inf. Theory, vol. 54, no. 9, pp. 3951–3967, 2008.
  45. D. Silva and F. R. Kschischang, “Universal secure network coding via rank-metric codes,” IEEE Trans. on Inf. Theory, vol. 57, no. 2, pp. 1124–1135, 2011.
  46. E. Arikan and E. Telatar, “On the rate of channel polarization,” in 2009 IEEE Int. Sym. on Inf. Theory.   IEEE, 2009, pp. 1493–1495.
  47. S. H. Hassani, K. Alishahi, and R. Urbanke, “On the scaling of polar codes: II. The behavior of un-polarized channels,” in 2010 IEEE Int. Sym. on Inf. Theory.   IEEE, 2010, pp. 879–883.
  48. H.-P. Wang, T.-C. Lin, A. Vardy, and R. Gabrys, “Sub-4.7 scaling exponent of polar codes,” IEEE Trans. on Inf. Theory, 2023.
  49. H.-P. Wang, “Complexity and second moment of the mathematical theory of communication,” arXiv preprint arXiv:2107.06420, 2021.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now