جستجوی مقالات مرتبط با کلیدواژه « امنیت شبکه » در نشریات گروه « فناوری اطلاعات »

Recently, the distributed internet applications under the scalable networks are growing rapidly, so the need to protect and secure such applications has also increased. Encryption algorithms are vital in today's cyber world, where there is always the risk of unauthorized access to all types of data. The most sensitive and vulnerable data is financial and payment system data, which can compromise personal identification information or customer payment card details and other personal information. Cryptographic algorithms are critical to protecting this information and reducing the risks that business face in conducting payment transactions. In fact, cryptographic algorithms play a major role in the information security of systems and the production of digital signatures. Existing digital signatures are often based on cryptographic algorithms and lead to the recognition of electronic information so that the identity of the author of the document and the comprehensiveness of its information can be reviewed and controlled. In this article, in addition to defining and classifying common cryptographic algorithms, we try to make a comparison on power and effectiveness of applicable algorithms in this area. This review and comparison can lead to improved functions and improved approaches to using these algorithms.

ASmart Cities Smart Cities and Smart Objects The concept of the Internet of Things (IoT) has emerged as an area of incredible potential growth and growth, with Cisco predicting that nearly 50 billion devices will be connected by 2020. Hacking these Internet devices is easy, and these devices are compromised. Typically, these IoT devices have limited storage computing capabilities and network capacity, so they are superior to other end devices such as smartphones. Tablets or computers are more vulnerable to attacks. The mother of this article examines and reviews the major security. issues on the Internet of Things

With the pervasiveness of social networks and the growing information shared on them, users of these networks are exposed to potential threats to data security and privacy. The privacy settings included in these networks do not give users complete control over the management and privatization of access to their shared information by other users. In this article, using the concept of social graph, a new model of user access control was proposed to the user, which allows the expression of privacy policies and more accurate and professional access control in terms of pattern and depth of relationships between users in social networks. In this article, by using the regular index method, indirect relationships among users are examined and analyzed, and more precise policies than previous models are presented. The evaluation of the results showed that for 10 neighbors for each user, the probability accumulation of a qualified path for the first three counter loops is 1, 10.5 and 67.3%, respectively, and finally for the fourth counter it reaches 100%. As the defined counting characteristic increases, the average execution time of the proposed algorithm and previously proposed algorithms increases. However, for the higher limits of the counting characteristic, the proposed algorithm performs better than the previous ones.