Industrial Information Security, Safety, and Trust

Author(s):  
Sapna Tyagi ◽  
Preeti Sirohi ◽  
Mohammad Yahiya Khan ◽  
Ashraf Darwish

The presented chapter elaborates fundamentals issues in information security, safety, and trust in industrial settings. The chapter introduces basics of information security that includes confidentially, integrity, and availability (CIA), which are some of the essential ingredients of information security. The chapter also discusses various reasons for security loop-holes prevalent in industrial setting. A majority of the chapter focuses on security framework and control implementation, which includes various authorizations and authentication methods. The shared secret systems, passwords, token systems, public key infrastructure (PKI), and biometrics system are most common methods used for authentication.

2013 ◽  
Vol 748 ◽  
pp. 953-957
Author(s):  
Jing Song Tian ◽  
Xiao Qin Wu ◽  
Rong Hu

with the network intelligent development, the technique widely application brings huge convenient for peoples life and work. The network openness exist great hidden troubles along with the information security. Based on the security system of public key infrastructure, we can determine the users information security and completion through the method of providing secret keys and certificate managing by both sides. Through the research of public key infrastructure, we can design out the planning of electronic payment platform and apply it in the practical society. This is the most important point that network staff and electronic commerce works are searching.


2013 ◽  
Vol 671-674 ◽  
pp. 3223-3226 ◽  
Author(s):  
Ning Hong

This paper proposed a security framework for the internet of things based on Public Key Infrastructure (PKI) which aims to answer these questions that how to solve the security problem in the internet of things between the client operation and service operation. It illustrates the model by presenting a modified security framework for a variety of applications than traditional PKI framework. Our aim is to show the new security framework in the internet of things that the traditional internet network does not have.


10.37236/4019 ◽  
2014 ◽  
Vol 21 (3) ◽  
Author(s):  
Colleen M. Swanson ◽  
Douglas R. Stinson

In the generalized Russian cards problem, we have a card deck $X$ of $n$ cards and three participants, Alice, Bob, and Cathy, dealt $a$, $b$, and $c$ cards, respectively. Once the cards are dealt, Alice and Bob wish to privately communicate their hands to each other via public announcements, without the advantage of a shared secret or public key infrastructure. Cathy, for her part, should remain ignorant of all but her own cards after Alice and Bob have made their announcements. Notions for Cathy's ignorance in the literature range from Cathy not learning the fate of any individual card with certainty (weak $1$-security) to not gaining any probabilistic advantage in guessing the fate of some set of $\delta$ cards (perfect $\delta$-security). As we demonstrate in this work, the generalized Russian cards problem has close ties to the field of combinatorial designs, on which we rely heavily, particularly for perfect security notions. Our main result establishes an equivalence between perfectly $\delta$-secure strategies and $(c+\delta)$-designs on $n$ points with block size $a$, when announcements are chosen uniformly at random from the set of possible announcements. We also provide construction methods and example solutions, including a construction that yields perfect $1$-security against Cathy when $c=2$. Drawing on our equivalence results, we are able to use a known combinatorial design to construct a strategy with $a=8$, $b=13$, and $c=3$ that is perfectly $2$-secure. Finally, we consider a variant of the problem that yields solutions that are easy to construct and optimal with respect to both the number of announcements and level of security achieved. Moreover, this is the first method obtaining weak $\delta$-security that allows Alice to hold an arbitrary number of cards and Cathy to hold a set of $c = \lfloor \frac{a-\delta}{2} \rfloor$ cards. Alternatively, the construction yields solutions for arbitrary $\delta$, $c$ and any $a \geq \delta + 2c$.


Author(s):  
Ali Saleh Al Najjar

Absolute protection is a difficult issue to maintain the confidentiality of images through their transmission over open channels such as internet or networks and is a major concern in the media, so image Cryptography becomes an area of attraction and interest of research in the field of information security. The paper will offer proposed system that provides a special kinds of image Encryption image security, Cryptography using RSA algorithm for encrypted images by HEX function to extract HEX Code and using RSA public key algorithm, to generate cipher image text. This approach provides high security and it will be suitable for secured transmission of images over the networks or Internet.


Sign in / Sign up

Export Citation Format

Share Document