Abstract
The paper considers methods and algorithms for stream pseudo-probabilistic encryption and introduces a novel design of such ciphers. In the known algorithms of such type two independent messages (fake and secret ones) are encrypted simultaneously (with using two different keys, fake and secret) and the produced ciphertext is computationally indistinguishable from the ciphertext produced by process of the probabilistic encryption of the fake message using the fake key. However in the known stream pseudo-probabilistic encryption schemes the algorithms for decrypting the fake and secret messages do not coincide completely. Therefore a potential attacker can use the last fact to distinguish the pseudo-probabilistic encryption from the probabilistic one. To provide resistance to such potential attacks in the paper there are proposed stream pseudo-probabilistic ciphers satisfying criterion of the sameness of the algorithms for decrypting the fake and secret messages. The introduced ciphers are sufficiently fast and represent interest for practical application to provide confidentiality of the communication protocols performed using public channels. The randomized pseudo-probabilistic stream ciphers have been also designed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Moldovyan, N.A., Nashwan, A.A.-M., Nguyen, D.T., Nguyen, N.H., Nguyen, H.M.: Deniability of symmetric encryption based on computational indistinguishability from probabilistic ciphering. In: Bhateja, V., Nguyen, B.L., Nguyen, N.G., Satapathy, S.C., Le, D.-N. (eds.) Information Systems Design and Intelligent Applications. AISC, vol. 672, pp. 209–218. Springer, Singapore (2018). https://doi.org/10.1007/978-981-10-7512-4_21
Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable encryption. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 90–104. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0052229
Barakat, M.T.: A new sender-side public-key deniable encryption scheme with fast decryption. KSII Trans. Internet Inf. Syst. 8(9), 3231–3249 (2014)
Dachman-Soled, D.: On minimal assumptions for sender-deniable public key encryption. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 574–591. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54631-0_33
Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 406–425. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20465-4_23
Moldovyan, N.A., Moldovyan, A.A., Tam, N.D., Hai, N.N., Minh, N.H.: Pseudo-probabilistic block ciphers and their randomization. J. Ambient Intell. Hum. Comput. (2018). https://doi.org/10.1007/1265201807916
Moldovyan, N.A., Moldovyan, A.A., Moldovyan, D.N., Shcherbacov, V.A.: Stream deniable-encryption algorithms. Comput. Sci. J. Moldova 24(1), 68–82 (2017)
Moldovyan, A.A., Moldovyan, N.A., Berezin, A.N., Shapovalov, P.I.: Randomized pseudo-probabilistic encryption algorithms. In: Proceedings of 2017 20th IEEE International Conference on Soft Computing and Measurements, SCM 2017, pp. 14–17 (2017)
Acknowledgements
The reported study was funded by Russian Foundation for Basic Research (project \(\#18-57-54002-Viet\_a\)) and by Vietnam Academy of Science and Technology (project \(\#QTRU01.08/18-19\)).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Moldovyan, N.A., Moldovyan, D.N., Le, Q.M., Nguyen, L.G., Ho, S.T., Nguyen, H.M. (2019). Stream Pseudo-probabilistic Ciphers. In: Cong Vinh, P., Alagar, V. (eds) Context-Aware Systems and Applications, and Nature of Computation and Communication. ICCASA ICTCC 2018 2018. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 266. Springer, Cham. https://doi.org/10.1007/978-3-030-06152-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-06152-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-06151-7
Online ISBN: 978-3-030-06152-4
eBook Packages: Computer ScienceComputer Science (R0)