Abstract
In the paper, we present enhancements of the encryption method for secure data transmission used in Secure Data Exchange method (SDEx) [1,2,3]. Potential weaknesses and possible attacks have been previously described in [4]. The new version of the encryption method is immune to indicated in [4] vulnerabilities connected with the potential knowledge of the part of the original message and uneven distribution of bits in the message blocks. In the new solution, we use also Davies-Meyer scheme in order to enhance immunity to meet-in-the-middle attacks.
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
Similar content being viewed by others
References
Hłobaż, A., Podlaski, K., Milczarski, P.: Applications of QR codes in secure mobile data exchange. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2014. CCIS, vol. 431, pp. 277–286. Springer, Cham (2014). doi:10.1007/978-3-319-07941-7_28
Milczarski, P., Podlaski, K., Hłobaż, A.: Applications of secure data exchange method using social media to distribute public keys. In: Gaj, P., Kwiecień, A., Stera, P. (eds.) CN 2015. CCIS, vol. 522, pp. 389–399. Springer, Cham (2015). doi:10.1007/978-3-319-19419-6_37
Podlaski, K., Hłobaż, A., Milczarski, P.: Secure data exchange based on social networks public key distribution. In: Internet of Things. IoT Infrastructures - Second International Summit, IoT \(360^\circ \) 2015, Rome, Italy, 27–29 October 2015, Revised Selected Papers, Part I, pp. 52–63 (2015)
Rzońca, D.: Cryptoanalysis of HPM14 encryption algorithm. Studia Informatica 36(3), 5–10 (2015)
Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. Chapman & Hall/CRC, Boca Raton (2014)
Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 1–15. Springer, Heidelberg (1996). doi:10.1007/3-540-68697-5_1
Bezzi, M., Capitani, D., di Vimercati, S., Foresti, S., Livraga, G., Paraboschi, S., Samarati, P.: Data Privacy, pp. 157–179. Springer, Berlin (2011)
Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792–807 (1986)
Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions, pp. 19–35. Springer, Berlin (2005)
National Institute of Standards and Technology: Secure Hash Standard (SHS). Technical report, NIST (2008)
Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1, pp. 17–36. Springer, Berlin (2005)
Szydlo, M., Yin, Y.L.: Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing, pp. 99–114. Springer, Berlin (2006)
Rijmen, V., Oswald, E.: Update on SHA-1, pp. 58–71. Springer, Berlin (2005)
Black, J., Rogaway, P., Shrimpton, T., Stam, M.: An analysis of the blockcipher-based hash functions from PGV. J. Cryptology 23, 519–545 (2010)
Hłobaż, A.: Security of measurement data transmission - message encryption method with concurrent hash counting. SEP 1, 13–15 (2007)
Hłobaż, A.: Security of measurement data transmission - modifications of the message encryption method along with concurrent hash counting. FSNT NOT 1, 39–42 (2008)
Preneel, B.: Davies-meyer hash function. In: van Tilborg, H.C.A. (ed.) Encyclopedia of Cryptography and Security, p. 136. Springer, Boston (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Hłobaż, A., Podlaski, K., Milczarski, P. (2017). Enhancements of Encryption Method Used in SDEx. In: Gaj, P., Kwiecień, A., Sawicki, M. (eds) Computer Networks. CN 2017. Communications in Computer and Information Science, vol 718. Springer, Cham. https://doi.org/10.1007/978-3-319-59767-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-59767-6_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59766-9
Online ISBN: 978-3-319-59767-6
eBook Packages: Computer ScienceComputer Science (R0)