W. Stallings. Network and Internetwork Security. Prentice-Hall, Englewood Cliffs, N.J., 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is driven by an elaborate access control mechanism. 1 Introduction Information assurance (IA) refers to methodologies to protect and defend information and information systems by ensuring their availability, confidentiality, integrity, non repudiation, authentication, access control, etc. [24] In collaborative design, IA is mission critical. Suppose a team of designers working collaboratively on a 3D assembly model. Each designer has a different set of security privileges and no one on the team may have the need to know the details of the entire design. In collaboration, designers ....

William Stallings. Network and Internetwork Security. IEEE Press, 1995. 12

....example of security vulnerabilities and what can be done to eliminate them. An extension to DSR is proposed for this purpose. 1.1. Special Security Issues for Mobile Ad Hoc Networks In addition to authentication, integrity, confidentiality, availability, access control and non repudiation (see [16] for details) which have to be addressed differently in a mobile, wireless, battery powered and distributed environment, mobile ad hoc networks raise the following security issues: Cooperation and fairness: There is a trade off between good citizenship, i.e. cooperation, and resource ....

W. Stallings. Network and Internetwork Security. IEEE Press, 2 edition, 1995.

....to DSR in Section 6. The rest of this paper consists of an outline of future work in Section 7 and the concluding Section 8. 2. Special Security Issues for Mobile Ad Hoc Networks In addition to authentication, integrity, confidentiality, availablity, access control and non repudiation (see [16] for details) which have to be addressed differently in a mobile, wireless, battery powered and distributed environment, mobile ad hoc networks raise the following security issues: Cooperation and fairness: There is a trade off between good citizenship, i.e. cooperation, and resource ....

W. Stallings. Network and Internetwork Security. IEEE Press, 2 edition, 1995.

....s be a generator of Z p (i:e: gcd(s; p) 1; s 6= 1) Let g j p s (p Gamma1) q . In a distributed environment, U i can choose his secret key d i and publish the corresponding public key e i . Anyone can get e i via some authentication service (e.g. the X. 509 directory authentication service [17]) Using a secure public key signature scheme, U i can produce signatures (certificates) of messages by d i : Anyone can verify these signatures by the corresponding e i . 2.1 The shadow distribution phase Before a requester can request a threshold signature from the signers, all signers must ....

W. Stallings, "Network and internetwork security," Prentice Hall International, pp. 333-340, 1995.

....[25] to preserve the fairness of the candidate s campaign and the function that any voter can make an open objection to the tally if his vote has not been published. In our proposed protocol, the public key authentication can be easily achieved by the X:509 directory authentication service [26]. The message authentication in our protocol is achieved by the RSA signature system in which the signed message m is attached with its signature S(h(m Delta RD) where S is the RSA signing function, h is a secure one way hash function [26] 27] and RD is a redundancy string of the voting, ....

.... achieved by the X:509 directory authentication service [26] The message authentication in our protocol is achieved by the RSA signature system in which the signed message m is attached with its signature S(h(m Delta RD) where S is the RSA signing function, h is a secure one way hash function [26], 27] and RD is a redundancy string of the voting, against the multiplicative attack. The verification of the RSA signature can be achieved by the comparison method [28] Assume that there are one administrator, n eligible voters and m scrutineers in this voting. Let e adm ; dadm ; nadm be the ....

W. Stallings, "Network and internetwork security," Prentice hall international, pp. 267-282 & 333-340, 1995.

....denote x = y mod p: Let g j p (p Gamma1) q and h j p 0(p Gamma1) q . Let d i be the secret key chosen by U i . In a distributed environment, U i can publish the corresponding public key e i . Anyone can get e i via some authentication service (e.g. the X. 509 directory authentication service [30]) Using a secure public key signature scheme [6, 27] U i can produce signatures of messages by his own secret key d i : Anyone can verify these signatures by the corresponding public key e i . Let C(m; fl) denote a commitment to m 2 Z p using the random string fl and CertU i (h(c) denote the ....

W. Stallings, "Network and internetwork security, " Prentice Hall International, 1995, pp. 333-340.

....can be licensed if found useful for commercial purposes. Email Security and Registration Method. Optionally, our virtual server transfers job results via email. The simplest solution to secure the email is to encrypt the data only. A more advanced solution is to use Pretty Good Privacy (PGP) [23], 15] A secure registration method is required to distribute private data, e.g. passwords or certificates. Security with Java Applets. The use of Java applets allows to encrypt the data on the user s local host. Additionally, the latest Web browsers provide a security model for Java applets. ....

....PGP, e.g. Netscape. If we want to establish a convenient solution where the browser can be used for every piece of work, the client should provide a mailtool independent service, which allows to read and decrypt the PGP data. 5) Authorisation for TCP IP with the Secure Sockets Layer: SSL ([23], 21] supports authorisation on the TCP IP communication level. The HTTPS protocol is also based on SSL. Thus, the Phase communication can be embedded in a SSL environment covering the Phase virtual server, the Phase clients and also the Web server and browsers. This is especially useful if the ....

W. Stallings. Network and Internetwork Security. Prentice Hall, 1995

.... Stinson s, Cryptography: Theory and Practice [41] Dorothy Denning s Cryptography and Data Security [13] Garfinkel and Spafford s Practical Unix Security [16] Kaufman, Perlman and Speciner s Network Security [24] and William Stalling s Network and Internetwork Security Principles and Practice [39]. The cryptography and computer security course was offered in the Courant Institute of Mathematical Sciences (http: cims.nyu.edu ) on Tuesday evenings from 5 7, and consisted entirely of graduate students. Some of them had full time jobs during the day, and were taking courses at night. There ....

William Stallings. Network and Internetwork security. Prentice Hall, 1995.

....provides message confidentiality when the data is encrypted with the public key of the recipient and authentication when the data is encrypted with the private key of the sender. Signing provides authentication of the signer and message integrity. These operations are not mutually exclusive. (Stallings 1995) offers a good introduction to these topics. The collection of algorithms deployed in connection with the public key operations described above is called a public key cryptosystem. Examples for public key algorithms are Diffie Hellman or RSA, common one way hash functions are MD5 or SHA 1 and an ....

Stallings, W. (1995) Network and Internetwork Security, Prentice Hall, Englewood Cliffs.

.... A better place to start would be [Needham93] Then focus on authentication by means of [BAN90] including the appendix [Burrows94] Follow up with [Abadi94] and [Gong90] A survey of authentication in distributed systems can be found in [Liebl93] A tutorial in security at large is available in [Stallings95]. Channels and Encryption Encryption Channels There is more to key identifiers than meet the eye. The most important issue is that it is impossible to know whether a message has been correctly decrypted unless one knows the contents in advance. Decrypted correctly implies one of two: That the ....

W. Stallings. Network and Internetwork Security. Prentice-Hall, 1995.

....2 to Z 32 2 , or equivalently, a function from GF(2 32 ) to GF(2 32 ) Thus an analysis of transform domain properties of the feedback function of RC5 can be partially done by computation. We will discuss this in a separate paper. Other block ciphers widely used in Internet communications [22], such as IDEA [13] and SAFER K 64 [17] are different modes. They directly use a permutation function from Z n 2 toZ n 2 instead of feedback shift resister structures. But the transform spectrum analysis techniques used for DES also can be applied to them. 2 Preliminaries In this section, we ....

W. Stallings, Network and Internetwork Security, IEEE Press, Inc., New York, 1995.

....a trusted system component that decides if they should be allowed. The authority can, for example, be an operating system or a database manager. The reference monitor concept cannot easily be adapted [20, 7, 25] to the highly distributed systems built around today s data communications networks [16, 26]. In the network, a virtually unlimited number of local authorities can set up and administer access to their own resources. Furthermore, from each host s viewpoint, the network can be divided into areas of more or less trusted and untrusted hosts, e.g. separated by rewalls [12] The reference ....

William Stallings. Network and Internetwork Security. Prentice Hall, 1995.

....the bootstrapping of their hosts. 2. 1 Replicated Authentication Servers Authentication systems based on secret key cryptography use a trusted on line authentication service which is usually provided by replicated authentication servers to improve both performance and availability (e.g. Kerberos [Stallings 1995]) These servers hold identities and secret keys of users and servers so it is difficult to maintain security and consistency of this state information held by these replicas. In order to avoid these problems we have adopted a scheme similar to the one described in [Davis et al. 1990] which ....

W. Stallings, Network and Internetwork Security, Prentice Hall, 1995.

....by manual means that are outside the normal functioning of the system. This approach is not very scalable nor flexible and limits the use of secret key cryptosystems. Public key cryptography (see Section 2.1.2) offers an elegant solution to this problem. Schneier [Sch96] and Stallings [Sta95] survey a number of secret key cryptographic algorithms. The following sub sections deal with two of the most popular ones, DES and IDEA. 2.1.1.1 DES The best known example of a secret key cryptosystem is the U.S. Data Encryption Standard (DES) US 77] DES was designed by IBM in the early 1970s ....

....is the use of X.509 certificates, RSA digital signatures, and Secure DNS resource records to authenticate DH public keys. This would facilitate the secure use of Diffie Hellman. 2.3.4 X.509 X.509 [C.C88b] defines the authentication framework for the CCITT X.500 series of recommendations [C. C88a] Sta95] that define a directory service. In addition, X.509 also defines a generic set of security services that can be adopted by other applications. X.509 was initially issued in 1988 and was subsequently revised in 1993 to address some of the security concerns documented in [Col90] The X.500 ....

[Article contains additional citation context not shown here]

William Stallings. "Network and Internetwork Security" . Prentice Hall, 1995.

.... Stinson s, Cryptography: Theory and Practice [41] Dorothy Denning s Cryptography and Data Security [13] Garfinkel and Spafford s Practical Unix Security [16] Kaufman, Perlman and Speciner s Network Security [24] and William Stalling s Network and Internetwork Security Principles and Practice [39]. The cryptography and computer security course was offered in the Courant Institute of Mathematical Sciences (http: cims.nyu.edu ) on Tuesday evenings from 5 7, and consisted entirely of graduate students. Some of them had full time jobs during the day, and were taking courses at night. There ....

William Stallings. Network and Internetwork security. Prentice Hall, 1995.

....provides message confidentiality when the data is encrypted with the public key of the recipient and authentication when the data is encrypted with the private key of the sender. Signing provides authentication of the signer and message integrity. These operations are not mutual exclusive (consult [23] for a good introduction) Since public key operations are computationally very demanding, they are usually not applied on large amounts of data. The performance of the encryption process can be improved by using public key encryption only during the initial connection establishment phase in order ....

W. Stallings, Network and Internetwork Security, Prentice Hall, Englewood Cliffs 1995.

No context found.

W. Stallings. Network and Internetwork Security. Prentice-Hall, Englewood Cliffs, N.J., 1995.

No context found.

W. Stallings, Network and Internetwork Security, IEEE Press, 1995.

No context found.

W. Stallings. Network and Internetwork Security. Prentice-Hall, Englewood Cliffs, N.J., 1995.

No context found.

W. Stallings, "Network and InterNetwork Security", Prentice Hall, , 1995.

No context found.

W. Stallings. Network and Internetwork Security, Prentice Hall, 1995

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC