\n\n 16 modulus 8=0<\/p>\n<\/td>\n | \n So on\u00e2\u20ac\u00a6.<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n Table 1: Example of Arithmetic of modus<\/p>\n To do modular addition [14], two numbers are added normally, then divided by the modulus and get the remainder. Thus, (17+20) mod 7 = (37) mod 7 = 2. The next section illustrates, how these computations are employed for cryptographic key exchange with typical example of Alice, Bod and Eva as actors in a typical scenario of keys exchange for authentication.<\/p>\n Step1:<\/strong> Sender (first person) and receiver (second person) agree, publicly, on a prime number \u2018X\u2019, having base number \u2018Y\u2019. Hacker (third person) may get public number \u2018X\u2019 access to the public prime number.<\/p>\nStep 2: <\/strong>Sender (first person) commits to a number \u2018A\u2019, as his\/her \u201csecret number exponent\u201d. The sender keeps this secret. Receiver (second person), similarly, select his\/her \u201csecret exponent\u201d.<\/p>\nThen, the first person calculates \u2018Z\u2019 using equation no. 1<\/p>\n Z = YA (mod X) \u00e2\u20ac\u00a6\u00e2\u20ac\u00a6\u00e2\u20ac\u00a6.. (1)<\/p>\n And sends \u2018Z\u2019 to Receiver (second person). Likewise, Receiver becomes calculate the value \u2018C\u2019 using equation no. 2<\/p>\n Z= YB (mod X) \u00e2\u20ac\u00a6\u00e2\u20ac\u00a6\u00e2\u20ac\u00a6\u00e2\u20ac\u00a6 (2)<\/p>\n And sends C to Sender (first person). Note that Hacker (third person) might have both Y and C.<\/p>\n Step 3:<\/strong> Now, Sender takes the values of C, and calculate using equation no. 3<\/p>\nCA (mod X). \u00e2\u20ac\u00a6\u00e2\u20ac\u00a6\u00e2\u20ac\u00a6\u00e2\u20ac\u00a6.. (3)<\/p>\n Step 4:<\/strong> Similarly Receiver calculates using equation no. 4<\/p>\nZB (mod X). \u00e2\u20ac\u00a6\u00e2\u20ac\u00a6\u00e2\u20ac\u00a6\u00e2\u20ac\u00a6.. (4)<\/p>\n Step 5: <\/strong>The value they compute is same because K = YB (mod X) and sender computed CA (mod X) = (YB) A (mod X) = YBA (mod X). Secondly because Receiver used Z = YA (mod X), and computed ZB (mod X) = (YA) B (mod X) = YAB (mod X).<\/p>\nThus, without knowing Receiver\u2019s secret exponent, B, sender was able to calculate YAB (mod X). With this value as a key, Sender and Receiver can now start working together. But Hacker may break into the code of the communication channel by computing Y, X, Z & C just like Sender and Receiver. Experimental results in cryptography, show that it ultimately becomes a discrete algorithm problem and consequently Hacker fails to breaks the code.<\/p>\n The Hacker does not have any proper way to get value. This is because the value is huge, but the question is how did sender and receiver computed such a large value, it is because of modulus arithmetic. They were working on the modulus of \u2018P\u2019 and using a shortcut method called repeated squaring method. The problem of finding match to break the code for the hacker becomes a problem of discrete algorithm problem. [15]<\/p>\n From the above mention in this paper, it can be deduced that the athematic validity part of the security algorithm computations can also be improved by reducing number of computational steps. For this purpose Vedic mathematical methods such as [17], especially where the resources (memory to store and compute) keys are constrained.<\/p>\n Example: <\/strong><\/p>\n\n\n\n\n Base Type <\/strong><\/p>\n<\/td>\n\n Example on how compute exponents using Vedic Maths <\/strong><\/p>\n<\/td>\n<\/tr>\n\n\n If the base is taken less than 10 <\/strong><\/p>\n<\/td>\n\n 9^3= 9-1 \/ 1\u00c3-1 \/ \u2013 (1\u00c3-9) \/ 1\u00c3-1\u00c3-9<\/p>\n = 8 \/1 \/ -9 \/ 9<\/p>\n = 81 \/ -9 \/ 9<\/p>\n = 81 \u2013 9 \/ 9<\/p>\n = 72 \/ 9<\/p>\n = 729<\/p>\n<\/td>\n<\/tr>\n | \n\n If the base is taken greater than <\/strong><\/p>\n10 <\/strong><\/p>\n<\/td>\n\n 12^3= 12 + 2 \/ 2 \u00c3- 2 \/ + (2 \u00c3- 12) \/ 2\u00c3- 2 \u00c3- 12<\/p>\n = 14 \/ 4 \/ + 24 \/ 48<\/p>\n = 144 \/ +24 \/ 48<\/p>\n = 144 +24 \/ 48<\/p>\n = 168\/ 48<\/p>\n = 1728<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n Life Cycle of Data and Deduplication: <\/strong>The life cycle of digital material is normally prove to change from technological and business processes throughout their lifecycle. Reliable re-use of this digital material, is only possible. If the curation, archiving and storage systems are well-defined and functioning with minimum resource to maximum returns. Hence, control to these events in the Life Cycle is Deduplication process and securely of data.<\/p>\n<\/p>\n<\/div>\n \u00a0<\/p>\n \n Table: 1 recent works in key management applied in De duplication area<\/p>\n \n\n\n\n S. No.<\/p>\n<\/td>\n | \n Authors<\/p>\n<\/td>\n | \n Problem undertaken<\/p>\n<\/td>\n | \n Techniques used<\/p>\n<\/td>\n | \n Goal achieved<\/p>\n<\/td>\n<\/tr>\n | \n\n Junbeom Hur et al. [1]<\/p>\n<\/td>\n | \n Build a secure key ownership schema that work dynamically with guaranteed data integrity against tag inconsistency attack.<\/p>\n<\/td>\n | \n Used Re-encryption techniques that enables dynamic updates upon any ownership changes in the cloud storage.<\/p>\n<\/td>\n | \n Tag consistency becomes true and key management becomes more efficient in terms of computation cost as compare to RCE (Randomized convergent encryption). However the author did not focused their work on arithmetic validity of the keys. Although the lot of work has been done on ownership of keys.<\/p>\n<\/td>\n<\/tr>\n | \n\n Chia-Mu Yu et al. [18]<\/p>\n<\/td>\n | \n Improve cloud server and mobile device efficiency in terms of its storage capabilities and of POW scheme.<\/p>\n<\/td>\n | \n Used improved of flow of POW with bloom filter for managing memory without the need to access disk after storing.<\/p>\n<\/td>\n | \n Reduced server side latency and user side latency.<\/p>\n<\/td>\n<\/tr>\n | \n\n Jorge Blasco et al. [19]<\/p>\n<\/td>\n | \n Improve the efficiency of resources (space, bandwidth,<\/p>\n efficiency) and improve security during the DE duplication process.<\/p>\n<\/td>\n | \n Improved the working of bloom filter implementation for its usage in POW scheme and thwart a malicious client attack for colluding with the legitimate owner of the file.<\/p>\n<\/td>\n | \n Experimental resources suggest the execution time increase when size of file grows but in case of proposed scheme it helps in building a better trade off between space and bandwidth.<\/p>\n<\/td>\n<\/tr>\n | \n\n Jin Li et al. [20]<\/p>\n<\/td>\n | \n Build an improved key management schema that it more efficiency and secure when key distribution operation access.<\/p>\n<\/td>\n | \n The user holds an independent master key for encrypting the convergence keys and outsourcing them to could this creates lot of overhead. This is avoided by using ramp secret sharing (RSSS) and dividing the duplication phase into small phase (first and block level DE duplication).<\/p>\n<\/td>\n | \n The new key management scheme (Dekey) with help of ramp scheme reduces the overhead (encoding and decoding) better than the previous scheme.<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n \u00a0<\/p>\n \n \u00a0<\/p>\n \n\n\n\n Chao Yang et al.<\/p>\n [21]<\/p>\n<\/td>\n | \n Overcome the problem of the vulnerability of client side deduplication operation, especially when the attacker try\u2019s to access on authorized file stored on the server by just using file name and its hash value.<\/p>\n<\/td>\n | \n The concept spot checking in wheel the client only needs to access small functions of the original files dynamic do efficient and randomly chosen induces of the original file.<\/p>\n<\/td>\n | \n The proposed scheme creates better provable ownership file operation that maintains high degree of detection power in terms of probability of finding unauthorized access to files.<\/p>\n<\/td>\n<\/tr>\n | \n\n Xuexue Jin et al. [11]<\/p>\n<\/td>\n | \n Current methods use information<\/p>\n computed from shared file to achieve.<\/p>\n DE duplication of encrypted. Data or convergent<\/p>\n encryption into<\/p>\n method is Vulnerable<\/p>\n as it is based well known public algorithm.<\/p>\n<\/td>\n | \n DE duplication encryption algorithm are combined with proof of ownership algorithm to achieve higher degree of security during the<\/p>\n DE duplication process. The process is also argument with proxy re-encryption (PRE) and digitalize credentials checks.<\/p>\n<\/td>\n | \n The author achieved anonymous DE duplication encryption along with POW test, consequently the level of protection was increased and attacks were avoided.<\/p>\n<\/td>\n<\/tr>\n | \n\n Danny Harnik et al. [22]<\/p>\n<\/td>\n | \n Improve cross user (s) interaction securely with higher degree of privacy during DE duplication.<\/p>\n<\/td>\n | \n The authors have described multiple methods that include:- (a). Stop cross over user interaction.<\/p>\n (b). Allow user to use their own private keys to encrypt.<\/p>\n (c). Randomized algorithm.<\/p>\n<\/td>\n | \n Reduced the cost of operation to secure the duplication process. Reduced leakage of information during DE duplication process. Higher degree of fortification.<\/p>\n<\/td>\n<\/tr>\n | \n\n Jingwei Li et al. [23]<\/p>\n<\/td>\n | \n The authors have worked on the problem of integrity auditing and security of DE duplication.<\/p>\n<\/td>\n | \n The authors have proposed and implemented two methods via Sec Cloud and Sec<\/p>\n Cloud+, both systems improve auditing the maintain ace with help of map reduce architecture.<\/p>\n<\/td>\n | \n The Implementation provided performance of periodic integrity check and verification without the local copy of data files. Better degree of proof of ownership process integrated with auditing.<\/p>\n<\/td>\n<\/tr>\n | \n\n Kun He et al. [24]<\/p>\n<\/td>\n | \n Reduce complications due to structure diversity and private tag generation. Find better alternative to homomorphic authenticated tree. (HAT)<\/p>\n<\/td>\n | \n Use random oracle model to avoid occurrence of breach and constructs to do unlimited number of verifications and update operations. DeyPoS which means<\/p>\n DE duplicable dynamic proof of storage.<\/p>\n<\/td>\n | \n The theoretical and experimental results show that the algorithm<\/p>\n (DeyPoS) implementation is highly efficient in conditions where the file size grows exponentially and large number of blocks are there.<\/p>\n<\/td>\n<\/tr>\n | \n\n Jin Li et al. [25]<\/p>\n<\/td>\n | \n The provide better protected data, and reduce duplication copies in storage with help of encryption and alternate<\/p>\n Deduplication method.<\/p>\n<\/td>\n | \n Use hybrid cloud architecture for higher degree of security (taken based) , the token are used to maintain storage that does not have<\/p>\n Deduplication and it is more secure due to its dynamic behavior.<\/p>\n<\/td>\n | \n The results claimed in the paper shows that the implemented algorithm gives minimal overhead compared to the normal operations.<\/p>\n<\/td>\n<\/tr>\n | \n\n Zheng Yan et al.<\/p>\n [26]<\/p>\n<\/td>\n | \n Reduce the complexity of key management step during data<\/p>\n duplication process<\/p>\n<\/td>\n | \n But implement less complex encryption with same or better level of security. This is done with the help of Attribute Based Encryption algorithm.<\/p>\n<\/td>\n | \n Reduce complexity overhead and execution time when file size grows as compared to preview work.<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n \u00a0<\/p>\n \n Summary of Key Challenges Found<\/p>\n \n- The degree of issues related to implementation of Crypto Algorithms in terms of mathematics is not that difficult as compared to embracing and applying to current technological scenarios.<\/li>\n
- Decentralized Anonymous Credentials validity and arithmetic validity is need to the hour and human sensitivity to remain safe is critical.<\/li>\n
- In certain cases, the need to eliminate a trusted credential issuers can help to reduce the overhead without compromising the security level whole running deduplication process.<\/li>\n
- Many algorithms for exponentiation do not provide defense against side-channel attacks, when deduplication process is run over network. An attacker observing the sequence of squaring and multiplications can (partially) recover the exponent involved in the computation.<\/li>\n
- Many methods compute the secret key based on Recursive method, which have more overhead as compared methods that are vectorized. Some of the vectorized implementations of such algorithms can be improved by reducing the number of steps with one line computational methods, especially when the powers of exponent are smaller than 8.<\/li>\n
- There is a scope of improvement in reducing computational overhead in methods of computations of arithmetic validity methods by using methods such as Nikhilam Sutra, Karatsuba.<\/li>\n<\/ol>\n
CONCLUSION<\/p>\n In this paper, sections have been dedicated to the discussion on the values concepts that need to be understood to overcome the challenges in De-duplication algorithms implementations. It was found that at each level of duplication process (file and block) there is a needs for keys to be arithmetically valid and there ownership also need proved for proper working of a secure duplication system. The process becomes prone to attacks, when the process is applied in geo-distributed storage architecture. The complexity for cheating ownership verification is at least difficult as performing strong collision attack of the hash function due to these mathematical functions. Finding the discrete algorithm of a random elliptic curve element with respect to a publicly known base point is infeasible this is (ECDLP). The security of the elliptic curve cryptography depends on the ability to the compute a point multiplication and the mobility to compute the multiple given the original and product points. The size of the elliptic curve determines the difficulty of the problem.<\/p>\n FUTURE SCOPE<\/p>\n As discussed, in the section mathematical methods such as Nikhilam Sutra, Karatsuba Algorithm [27] may be used for doing computations related to arithmetic validity of the keys produced for security purpose as it involves easier steps and reduce the number of bits required for doing multiplication operations etc. Other than this, the future research work to apply to security network need of sensors that have low memory and computational power to run expensive cryptography operations such public key validation and key exchange thereafter.<\/p>\n \n\n\n\n [1]<\/p>\n<\/td>\n | \n J. Hur, D. Koo, Y. Shin and K. Kang, \u201cSecure data deduplication with dynamic ownership management in cloud storage,\u201d IEEE Transactions on Knowledge and Data Engineering, <\/em>vol. 28, pp. 3113\u20133125, 2016.<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n- A. Kumar and A. Kumar, \u201cA palmprint-based cryptosystem using double encryption,\u201d in SPIE Defense and Security Symposium<\/em>, 2008, pp. 69440D\u201369440D.<\/li>\n
- M. Portolani, M. Arregoces, D. W. Chang, N. A. Bagepalli and S. Testa, \u201cSystem for SSL re-encryption after load balance,\u201d 2010.<\/li>\n
- W. Xia, H. Jiang, D. Feng, F. Douglis, P. Shialane, Y. Hua, M. Fu, Y. Zhang and Y. Zhou, \u201cA comprehensive study of the past, present, and future of data deduplication,\u201d Proceedings of the IEEE, <\/em>vol. 104, pp. 1681-1710, 2016.<\/li>\n
- J. Ziv and A. Lempel, \u201cA universal algorithm for sequential data compression,\u201d IEEE Transactions on information theory, <\/em>vol. 23, pp. 337\u2013343, 1977.<\/li>\n
- P. Kumar, M.-L. Liu, R. Vijayshankar and P. Martin, \u201cSystems, methods, and computer program products for supporting multiple contactless applications using different security keys,\u201d 2011.<\/li>\n
- S. Gupta, A. Goyal and B. Bhushan, \u201cInformation hiding using least significant bit steganography and cryptography,\u201d International Journal of Modern Education and Computer Science, <\/em>vol. 4, p. 27, 2012.<\/li>\n
- K. V. K. and A. R. K. P. , \u201cTaxonomy of SSL\/TLS Attacks,\u201d International Journal of Computer Network and Information Security, <\/em>vol. 8, p. 15, 2016.<\/li>\n
- J. M. Sundet, D. G. Barlaug and T. M. Torjussen, \u201cThe end of the Flynn effect?: A study of secular trends in mean intelligence test scores of Norwegian conscripts during half a century,\u201d Intelligence, <\/em>vol. 32, pp. 349-362, 2004.<\/li>\n
- W. Lawrence and S. Sankaranarayanan, \u201cApplication of Biometric security in agent based hotel booking system-android environment,\u201d International Journal of Information Engineering and Electronic Business, <\/em>vol. 4, p. 64, 2012.<\/li>\n
- N. Asokan, V. Niemi and P. Laitinen, \u201cOn the usefulness of proof-of-possession,\u201d in Proceedings of the 2nd Annual PKI Research Workshop<\/em>, 2003, pp. 122\u2013127.<\/li>\n
- X. Jin, L. Wei, M. Yu, N. Yu and J. Sun, \u201cAnonymous deduplication of encrypted data with proof of ownership in cloud storage,\u201d in Communications in China (ICCC), 2013 IEEE\/CIC International Conference on<\/em>, 2013, pp. 224\u2013229.<\/li>\n
- D. Whitfield and M. E. Hellman, \u201cNew directions in cryptography,\u201d IEEE transactions on Information Theory, <\/em>vol. 22, pp. 644\u2013654, 1976.<\/li>\n
- H. Riesel, \u201cPrime numbers and computer methods for factorization,\u201d vol. 126, Springer Science & Business Media, 2012.<\/li>\n
- R. A. Patel, M. Benaissa, N. Powell and S. Boussakta, \u201cNovel power-delay-area-efficient approach to generic modular addition,\u201d IEEE Transactions on Circuits and Systems I: Regular Papers, <\/em>vol. 54, pp. 1279\u20131292, 2007.<\/li>\n
- \u201cRepeated Squaring,\u201d Wednesday March 2017. [Online]. Available:<\/li>\n<\/ol>\n
http:\/\/www.algorithmist.com\/index.php\/Repeated_Squaring. [Accessed Wednesday March 2017].<\/p>\n \n- \u201cTable of costs of operations in elliptic curves,\u201d Wednesday March 2017. [Online]. Available:<\/li>\n<\/ol>\n
https:\/\/en.wikipedia.org\/wiki\/Table_of_costs_of_operations_in_elliptic_curves. [Accessed Wednesday March 2017].<\/p>\n \n- \u201cCalculating Powers Near a Base Number,\u201d Wednesday March 2017. [Online]. Available:<\/li>\n<\/ol>\n
http:\/\/www.vedicmaths.com\/18-calculating-powers-near-a-base-number. [Accessed Wednesday March 2017].<\/p>\n \n- C.-M. Yu, C.-Y. Chen and H.-C. Chao, \u201cProof of ownership in deduplicated cloud storage with mobile device efficiency,\u201d IEEE Network, <\/em>vol. 29, pp. 51\u201355, 2015.<\/li>\n
- J. Blasco, R. D. Pietro, A. Orfila and A. Sorniotti, \u201cA tunable proof of ownership scheme for deduplication using bloom filters,\u201d in Communications and Network Security (CNS), 2014 IEEE Conference on<\/em>, 2014, pp. 481\u2013489.<\/li>\n
- J. Li, X. Chen, M. Li, J. Li, P. P. Lee and W. Lou, \u201cSecure deduplication with efficient and reliable convergent key management,\u201d IEEE transactions on parallel and distributed systems, <\/em>vol. 25, pp. 1615\u20131625, 2014.<\/li>\n
- C. Yang, J. Ren and J. Ma, \u201cProvable ownership of files in deduplication cloud storage,\u201d Security and Communication Networks, <\/em>vol. 8, pp. 2457\u20132468, 2015.<\/li>\n
- D. Harnik, B. Pinkas and A. Shulman-Peleg, \u201cSide channels in cloud services: Deduplication in cloud storage,\u201d IEEE Security & Privacy, <\/em>vol. 8, pp. 40\u201347, 2010.<\/li>\n
- J. Li, J. Li, D. Xie and Z. Cai, \u201cSecure auditing and deduplicating data in cloud,\u201d IEEE Transactions on Computers, <\/em>vol. 65, pp. 2386\u20132396, 2016.<\/li>\n
- K. He, J. Chen, R. Du, Q. Wu, G. Xue and X. Zhang, \u201cDeypos: deduplicatable dynamic proof of storage for multi-user environments,\u201d IEEE Transactions on Computers, <\/em>vol. 65, pp. 3631\u20133645, 2016.<\/li>\n
- J. Li, Y. K. Li, X. Chen, P. P. Lee and W. Lou, \u201cA hybrid cloud approach for secure authorized deduplication,\u201d IEEE Transactions on Parallel and Distributed Systems, <\/em>vol. 26, pp. 1206\u20131216, 2015.<\/li>\n
- Z. Yan, M. Wang, Y. Li and A. V. Vasilakos, \u201cEncrypted data management with deduplication in cloud computing,\u201d IEEE Cloud Computing, <\/em>vol. 3, pp. 28\u201335, 2016.<\/li>\n
- S. P. Dwivedi, \u201cAn efficient multiplication algorithm using Nikhilam method,\u201d 2013.<\/li>\n<\/ol><\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Mandeep Singh Abstract: -The cloud storage services are used to store intermediate and persistent data generated from various resources including servers and IoT based networks. The outcome of such developments is that the data gets duplicated and gets replicated rapidly especially when large numbers of cloud users are working in a collaborative environment to solve large scale problems in geo-distributed networks. The data gets prone […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[147],"tags":[57888],"class_list":["post-232838","post","type-post","status-publish","format-standard","hentry","category-information-technology","tag-review-of-data-duplication-methods"],"_links":{"self":[{"href":"https:\/\/glowriters.com\/wp-json\/wp\/v2\/posts\/232838"}],"collection":[{"href":"https:\/\/glowriters.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/glowriters.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/glowriters.com\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/glowriters.com\/wp-json\/wp\/v2\/comments?post=232838"}],"version-history":[{"count":0,"href":"https:\/\/glowriters.com\/wp-json\/wp\/v2\/posts\/232838\/revisions"}],"wp:attachment":[{"href":"https:\/\/glowriters.com\/wp-json\/wp\/v2\/media?parent=232838"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/glowriters.com\/wp-json\/wp\/v2\/categories?post=232838"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/glowriters.com\/wp-json\/wp\/v2\/tags?post=232838"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}} | | | | | | | | |