scholarly journals A Bigdata Process for Practical Privacy-Preserving Utilizing k-Means Clustering

Now a day’s privacy preservation is the big issue on growing big data in various field such as medical, engineering and physical with the fast growing network. One of the most important challenges in handling big data is security issues. To overcome such security issues cryptographic concepts have been used in this paper to provide high security of big data’s with the low consumption of time for both encryption and decryption process. In this paper the proposed method is Indexed RSA (IRSA) which is developed with modified scheme. We offered a method to index the keyword before encrypting the file and based on the indexed keyword the search has been done. Finally the security analysis was carried out and the analysis showed that our modified scheme can meet the security requirement against brute force attack and SQL injection attack.

2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim

The main objective of the study conducted in this article is to introduce a new algorithm of encryption and decryption of a sensitive message after transforming it into a binary message. Our proposed encryption algorithm is based on the study of a particular graph constructed algebraically from the quadratic residues. We have exploited the Paley graph to introduce an abstract way of encryption of such message bit according to the other message bits by the intermidiate study of the neighborhood of a graph vertex. The strong regularity of the Paley graphs and the unknown behavior of the quadratic residues will play a very important role in the cryptanalysis part which allows to say that the brute force attack remains for the moment the only way to obtain the set of possible messages.


2008 ◽  
pp. 3133-3141
Author(s):  
B. Dawn Medlin ◽  
Joseph A. Cazier ◽  
Dinesh S. Dave

With the exponential growth of the Internet and e-commerce, the need for secure transactions has become a necessity for both consumer and business. Even though there have been advances in security technology, one aspect remains constant: passwords still play a central role in system security. The difficulty with passwords is that all too often they are the easiest security mechanism to defeat. Kevin Mitnick, notably the most recognized computer hacker, made the following statement concerning humans and their passwords: …the human side of computer security is easily exploited and constantly overlooked. Companies spend millions of dollars on firewalls, encryption and secure access devices, and it’s money wasted, because none of these measures addresses the weakest link in the security chain. (Poulsen, 2000) Without secure passwords, e-commerce sites invite online criminals to attempt fraudulent schemes that mimic the goods and services that legitimate e-commerce merchants offer. With increasing numbers of users on an increasing array of e-commerce sites, often requiring the use of passwords, users often choose to reuse the same simplistic password, and do so on multiple sites (Campbell, Calvert, & Boswell, 2003). For most computerized systems, passwords are the first line of defense against hackers or intruders (Horowitz, 2001). There have been numerous published articles that have created guidelines on how to create better or safer passwords with the following recommendations: 1. passwords should be memorized and not written down; 2. passwords should be an eight- or nine-character word or phrase, and end users should randomly add 3. passwords should contain a mixture of letters (both upper- and lowercase), numbers, and punctuation characters; and 4. passwords should never be words that can be commonly found in a dictionary. But if an individual adheres to security experts’ suggestions about password authentication, it usually involves a trade-off. If a password is easy to create and remember, it is most likely that it is easy for others to guess or a hacker to crack. Eventually, any password can be cracked. Password crackers use a variety of methods and tools that can include guessing, dictionary lists, or brute force attacks. Dictionary lists are created by using an automated program that includes a text file of words that are common in a dictionary. The program repeatedly attempts to log on to the target system, using a different word from the text file on each attempt. A brute force attack is a variation of the dictionary attacks, but it is designed to determine passwords that may not be included in the text file. In a brute force attack, the attacker uses an automated program that generates hashes or encrypted values for all possible passwords and compares them to the values in the password file (Conklin, White, Cothren, Williams, & Davis, 2004). Unfortunately, many of the deficiencies of password authentication systems arise from the limitations of human cognitive ability (Pond, Podd, Bunnell, & Henderson, 2000). The requirements to remember long and complicated passwords are contrary to a well-known property of human memory. First, the capacity of human memory in its capacity to remember a sequence of items is temporally limited, with a short-term capacity of around seven items plus or minus two (Kanaley, 2001). Second, when humans remember a sequence of items, those items cannot be drawn from an arbitrary and unfamiliar range, but must be familiar “chunks” such as words or familiar symbols. Third, the human memory thrives on redundancy. In fact, studies have shown that individuals’ short-term memory will retain a password for approximately 30 seconds, thereby requiring individuals to attempt to memorize their passwords immediately (Atkinson & Shiffrin, 1968).


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Srinivas Koppu ◽  
V. Madhu Viswanatham

An enhanced secure image chaotic cryptosystem has been proposed based on hybrid CMT-Lanczos algorithm. We have achieved fast encryption and decryption along with privacy of images. The pseudorandom generator has been used along with Lanczos algorithm to generate root characteristics and eigenvectors. Using hybrid CMT image, pixels are shuffled to accomplish excellent randomness. Compared with existing methods, the proposed method had more robustness to various attacks: brute-force attack, known cipher plaintext, chosen-plaintext, security key space, key sensitivity, correlation analysis and information entropy, and differential attacks. Simulation results show that the proposed methods give better result in protecting images with low-time complexity.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Xuan Wang ◽  
Jingjing Xu ◽  
Jiaxin Wang ◽  
Wei Ou ◽  
Jung Yoon Kim ◽  
...  

With the continuous development and application of monitoring technology, which involves increasingly more sensitive information, the global demand for video monitoring systems has surged. As a result, video monitoring technology has received widespread attention both at home and abroad. Traditional video monitoring systems experience security threats, with differing levels of severity, in terms of attack, storage, transmission, etc., which results in different degrees of damage to users’ rights. Therefore, we propose a blockchain-SM-based video monitoring system called BSVMS. For the front-end device invasion risk, internal attack risk, and security storage problem of the monitoring system, we use commercial cryptography algorithms to complete the encryption processing of images through a visual change network in the imaging process, thereby ensuring the security of the video data from the source. To address the problem that the video monitoring application software and data are vulnerable to damage, we use blockchain technologies that are tamper-proof and traceable to build a trustworthy video monitoring system. In the system, no member can query the original monitoring data. To address the security issues in network transmission, we use a commercial cryptography algorithm for multilayer encryption to ensure the security of data during transmission, guarantee the confidentiality of the system, and realize domestic autonomous control. We then conduct tests and security analysis of the encryption and decryption efficiency of the SM4 algorithm used in the system, the blockchain performance, and the overall performance. The experimental results show that in this system environment, the SM4 algorithm encryption and decryption efficiency is better than other algorithms and that the blockchain used meets industry standards.


2014 ◽  
Vol 701-702 ◽  
pp. 437-441
Author(s):  
J.G. Jin ◽  
Gang Ma ◽  
Ming Jun Wei

Low-dimensional chaotic encryption has a good operational efficiency but there is a problem of security flaws, therefore this paper proposes a composite chaos encryption system based on double mapping. Double mapping with mutual disturbance were used to generate the key sequence, and respectively with odd and even number of image pixels to realize the image encryption. The simulation results show that, the effect is very good; Correlation and so on security analysis shows that meet the requirements of the security; System overall evaluation results show that the proposed algorithm has better security and ease of implementation, can effectively resist brute force attack, statistic attack etc.


2019 ◽  
Vol 8 (2) ◽  
pp. 3813-3817

Our examination work is the most slanting since it relates to the security issues which increase, well ordered in view of the casual association inclines in society. In this paper we address the issue of uncovering an individual's information; the philosophy depends for the most part on the K-anonymity with the possibility of unimportant theory, which gets the property of the release strategy not to ravage the data more than anticipated to achieve K-lack of definition. We talk about the colossal data in detail how it is useful to guarantee an immense volume of information without change the arrangement of one of a kind data. Data stored in different forms is anonymise efficiently without affecting the integrity if data by using K-Anonymity and Artificial Bee Colony algorithm respectively. We similarly give base on security and insurance strategies and to avoid the interference. We use the phony bumble bee settlement (ABC) count to propel the tremendous enlightening accumulation. We exhibit the result in graphically the sum we improve the insurance from the as of proposed system. Here both K-Anonymity and ABC Algorithm is used (mixed) which never took care by executing parallel.


Author(s):  
Santhosh Kumar B.J. ◽  
Kruthika Vijay

Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This application makes use of all ASCII characters which makes brute force attack impossible.


Compiler ◽  
2013 ◽  
Vol 2 (2) ◽  
Author(s):  
Yoris Setiawan ◽  
Haruno Sajati ◽  
Bambang Sudibya

Many colleges already apply web based academic information system use internet connection, so it is need a system security to protect from attacks such as SQL Injection and Brute Force. Honeypot is a system security which devide two system that are original and fake system. Original system used by user to access academic information system that source from correct database. While fake system used to separate hacker and user. Hackers who try to enter with SQL Injection is send to fake system directly which has wrong data. This fake system seems correct and all action that was happened in will be noted on log history. When hacker try some password ese Brute Force, system will reset user password automatically. This system already test with 79 times SQL Injection and 29 times Brute Force attack. All attacks can handle nicely with honeypot algorithm.


Author(s):  
B. Dawn Medlin ◽  
Joseph A. Cazier ◽  
Dinesh S. Dave

With the exponential growth of the Internet and e-commerce, the need for secure transactions has become a necessity for both consumer and business. Even though there have been advances in security technology, one aspect remains constant: passwords still play a central role in system security. The difficulty with passwords is that all too often they are the easiest security mechanism to defeat. Kevin Mitnick, notably the most recognized computer hacker, made the following statement concerning humans and their passwords: …the human side of computer security is easily exploited and constantly overlooked. Companies spend millions of dollars on firewalls, encryption and secure access devices, and it’s money wasted, because none of these measures addresses the weakest link in the security chain. (Poulsen, 2000) Without secure passwords, e-commerce sites invite online criminals to attempt fraudulent schemes that mimic the goods and services that legitimate e-commerce merchants offer. With increasing numbers of users on an increasing array of e-commerce sites, often requiring the use of passwords, users often choose to reuse the same simplistic password, and do so on multiple sites (Campbell, Calvert, & Boswell, 2003). For most computerized systems, passwords are the first line of defense against hackers or intruders (Horowitz, 2001). There have been numerous published articles that have created guidelines on how to create better or safer passwords with the following recommendations: 1. passwords should be memorized and not written down; 2. passwords should be an eight- or nine-character word or phrase, and end users should randomly add 3. passwords should contain a mixture of letters (both upper- and lowercase), numbers, and punctuation characters; and 4. passwords should never be words that can be commonly found in a dictionary. But if an individual adheres to security experts’ suggestions about password authentication, it usually involves a trade-off. If a password is easy to create and remember, it is most likely that it is easy for others to guess or a hacker to crack. Eventually, any password can be cracked. Password crackers use a variety of methods and tools that can include guessing, dictionary lists, or brute force attacks. Dictionary lists are created by using an automated program that includes a text file of words that are common in a dictionary. The program repeatedly attempts to log on to the target system, using a different word from the text file on each attempt. A brute force attack is a variation of the dictionary attacks, but it is designed to determine passwords that may not be included in the text file. In a brute force attack, the attacker uses an automated program that generates hashes or encrypted values for all possible passwords and compares them to the values in the password file (Conklin, White, Cothren, Williams, & Davis, 2004). Unfortunately, many of the deficiencies of password authentication systems arise from the limitations of human cognitive ability (Pond, Podd, Bunnell, & Henderson, 2000). The requirements to remember long and complicated passwords are contrary to a well-known property of human memory. First, the capacity of human memory in its capacity to remember a sequence of items is temporally limited, with a short-term capacity of around seven items plus or minus two (Kanaley, 2001). Second, when humans remember a sequence of items, those items cannot be drawn from an arbitrary and unfamiliar range, but must be familiar “chunks” such as words or familiar symbols. Third, the human memory thrives on redundancy. In fact, studies have shown that individuals’ short-term memory will retain a password for approximately 30 seconds, thereby requiring individuals to attempt to memorize their passwords immediately (Atkinson & Shiffrin, 1968).


Author(s):  
Shalin Eliabeth S. ◽  
Sarju S.

Big data privacy preservation is one of the most disturbed issues in current industry. Sometimes the data privacy problems never identified when input data is published on cloud environment. Data privacy preservation in hadoop deals in hiding and publishing input dataset to the distributed environment. In this paper investigate the problem of big data anonymization for privacy preservation from the perspectives of scalability and time factor etc. At present, many cloud applications with big data anonymization faces the same kind of problems. For recovering this kind of problems, here introduced a data anonymization algorithm called Two Phase Top-Down Specialization (TPTDS) algorithm that is implemented in hadoop. For the data anonymization-45,222 records of adults information with 15 attribute values was taken as the input big data. With the help of multidimensional anonymization in map reduce framework, here implemented proposed Two-Phase Top-Down Specialization anonymization algorithm in hadoop and it will increases the efficiency on the big data processing system. By conducting experiment in both one dimensional and multidimensional map reduce framework with Two Phase Top-Down Specialization algorithm on hadoop, the better result shown in multidimensional anonymization on input adult dataset. Data sets is generalized in a top-down manner and the better result was shown in multidimensional map reduce framework by the better IGPL values generated by the algorithm. The anonymization was performed with specialization operation on taxonomy tree. The experiment shows that the solutions improves the IGPL values, anonymity parameter and decreases the execution time of big data privacy preservation by compared to the existing algorithm. This experimental result will leads to great application to the distributed environment.


Sign in / Sign up

Export Citation Format

Share Document