Abstract
Cloud computing appeals to private individuals and particularly enterprises at a progressive rate, but a noticeable percentage of them refuse it due to mistrust or missing commitment to security. The cryptosystem SecureString 2.0 was designed to outweigh these deficits through the support of blind computations on character strings. Repetition pattern attacks count among the most hazardous enemies of SecureString 2.0 objects because reoccurring ciphergrams within them may reveal linguistic identifying features of the correspondent plaintext. This paper analyzes and compares the success probability of repetition pattern attacks on the following three sorts of SecureString 2.0 objects: single-word-containing ones, multi-word-containing ones with a known number of words plus unknown delimiter positions, and multi-word-containing ones with an unknown number of words plus unknown boundary locations. The latter type is expected to provide the highest privacy.
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
Preview
Unable to display preview. Download preview PDF.
References
Anderson, R.J.: Security engineering - a guide to building dependable distributed systems, 2nd edn. Wiley (2008)
Bauer, F.L.: Decrypted Secrets: Methods and Maxims of Cryptology, 4th edn. Springer Publishing Company, Incorporated (2010)
Bell, E.T.: Exponential polynomials. Annals of Mathematics 35(2), 258–277 (1934)
Bell, E.T.: The iterated exponential integers. Annals of Mathematics 39(3), 539–557 (1938)
Eckler, A.R.: Pangram variations. Word Ways 10(1), 17 (1977)
Fahrnberger, G.: Computing on encrypted character strings in clouds. In: Hota, C., Srimani, P.K. (eds.) ICDCIT 2013. LNCS, vol. 7753, pp. 244–254. Springer, Heidelberg (2013)
Fahrnberger, G.: Securestring 2.0 - a cryptosystem for computing on encrypted character strings in clouds. In: Eichler, G., Gumzej, R. (eds.) Networked Information Systems. Fortschritt-Berichte Reihe 10, vol. 826, pp. 226–240. VDI Düsseldorf (June 2013)
Fahrnberger, G.: A second view on securestring 2.0. In: Natarajan, R. (ed.) ICDCIT 2014. LNCS, vol. 8337, pp. 239–250. Springer, Heidelberg (2014)
Fahrnberger, G.: Sims: A comprehensive approach for a secure instant messaging sifter. In:2014 13th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) (September 2014)
Ferguson, N., Schneier, B.: Practical cryptography. Wiley (2003)
Hamming, R.W.: Error detecting and error correcting codes. Bell System Technical Journal 29(2), 147–160 (1950)
Pinkas, B., Sander, T.: Securing passwords against dictionary attacks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002, New York, NY, USA, pp. 161–170 (2002)
Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. Transactions of the IRE Professional Group on Information Theory 4(4), 38–49 (1954)
Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal 28(4), 656–715 (1949)
Soroka, E.V., Iracleous, D.P.: Social networks as a platform for distributed dictionary attack. In: Proceedings of the 5th WSEAS International Conference on Communications and Information Technology, CIT 2011, pp. 101–106. World Scientific and Engineering Academy and Society (WSEAS), Stevens Point (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fahrnberger, G. (2015). Repetition Pattern Attack on Multi-word-containing SecureString 2.0 Objects. In: Natarajan, R., Barua, G., Patra, M.R. (eds) Distributed Computing and Internet Technology. ICDCIT 2015. Lecture Notes in Computer Science, vol 8956. Springer, Cham. https://doi.org/10.1007/978-3-319-14977-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-14977-6_26
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14976-9
Online ISBN: 978-3-319-14977-6
eBook Packages: Computer ScienceComputer Science (R0)