Markley, R.W. 1990: Data Communications and Interoperability, Prentice-Hall International.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....signature is valid. Let U i be the identification of signer i, n be the number of signers, t be the threshold value of the fair blind threshold signature scheme, so that at least (n Gamma t 1) signers are 8 honest, m be the blind message to be signed, h be a secure one way hashing function [23], p and q be two large strong prime numbers such that q divides (p Gamma 1) and ae be a generator of Z p (i:e: gcd(ae; p) 1; ae 6= 1) Let x j p y denote x = y mod p. Let g j p ae (p Gamma1) q and Delta denote the ordinal string concatenation. Let d i be the secret key chosen by U i ....

....d i be the secret key chosen by U i and d J be the secret key chosen by the judge. In a distributed environment, U i and the judge can publish their corresponding public keys e i and e J . Anyone can get e i and e J via some authentication service (e.g. the X. 509 directory authentication service [23]) Using a secure public key signature scheme [11, 12] U i and the judge can produce signatures of messages by their own secret keys d i and d J : Anyone can verify these signatures by the corresponding public keys e i and e J . Let CertU i (m) be the signature on the message m produced by U i ....

Stallings, W Network and internetwork security, Prentice Hall International (1995).

....the blind threshold signature scheme, so that, at least (n Gamma 1) administrators are honest. Let be the threshold value of the threshold cryptosystem, so that, at least ( Gamma 1) scrutineers are honest. Let be a public one way permutation function, h be a public one way hash function [17, 28] and tag be a voting tag indicating the current voting. Let U i denote the identification of administrator i and S i denote the identification of scrutineer i: Let d v i be the secret key chosen by voter i, d u i be the secret key chosen by U i , d s i be the secret key chosen by S i and d c be ....

....key chosen by the counter. In a distributed environment, voter i; U i , S i and the counter can publish their corresponding public keys e v i , e u i , e s i and e c . Anyone can get e v i , e u i , e s i and e c via some authentication service (e.g. the X. 509 directory authentication service [28]) Using secure public key signature schemes [8, 25] voter i; U i , S i and the 6 counter can produce signatures of messages by their own secret keys d v i ; d u i , d s i and d c : Anyone can verify these signatures by the corresponding public keys e v i , e u i , e s i and e c . Let CertU i ....

W. Stallings, Network and internetwork security, Prentice hall international, 1995.

....via parallel processing, and allow system organization via decentralized agents. This will be the prevailing way to organize technical systems in the future. We can distinguish two main networking levels: Non real time This layer is typically based on standards such as TCP IP or UDP IP [67] [22] It is non real time since short term time bounds cannot be guaranteed. Therefore it is not 9 Figure 5: Network graph of the GMD robot team. useful to handle short term reaction in this layer. Rather, the long term strategies are worked out. The non real time level contains information ....

W. Stallings. Data and Computer Communications. Prentice-Hall International, fifth edition edition, 1997. ISBN 0-13-571274-2.

....compilation. 2.4 Memory organization Memory has become the major performance bottleneck for many applications. The growth of processor speed has been rapid, but the speed of memories has not developed at the same rate. There is a signicant performance mismatch between processors and memories [67]. For example, a fairly complex recomputation can be faster than fetching an already computed result from memory. Small memories are signicantly faster than large ones. Because of this, the memory of computers has become layered. A typical memory hierarchy with four layers is illustrated in ....

....in Figure 3. The topmost layer is the set of registers of the processor. Programs refer to data in registers by using the register address space. Data in other layers are referred to by using the virtual address space of the processor 3 . Virtual address space makes multitasking simple [67]. Before any datum in memory is accessed, its virtual address is translated to a physical address. In multitasking, all processes use the same virtual addresses, but the address translation to physical addresses is process specic. Thus, a process can have both shared and private memory for ....

W. Stallings. Computer Organization and Architecture. Prentice-Hall International, Inc., 1996.

....of their network ownership. Since these parties cannot agree each traffic policy decision individually, conflicting incentives must be reconciled outside the traffic management domain. Typically this is achieved by allowing sub network owners to set policy within the remit of their own resources [Stallings97] However, the static nature of these policies and the conflict between them at sub network interfaces often causes institutionalised under use of the network as a whole. Both of these trends suggest that telecommunications network management, once a centralised and monolithic undertaking, will ....

W. Stallings, Data and Computer Communications, Prentice Hall International , Inc. (1997)

....of 0 to 1 Mbps. It is possible to transmit at a much higher bursty rate, dependent on the network load. There are no data loss European ITU T American E1 2 DS1 or T1 1.5 E2 8 DS2 or T2 6 E3 34 DS3 or T3 45 Table 1: Approximate network access rates in Mbps. Figure 1: Frame relay CIR (source: [2]) or delay guarantees, as these are conflicting with the offered availability and average data rate guarantees. Therefore, QoS awareness is definitely not a merit of frame relay. Frame relay offers a backward compatibility X.25 emulation mode, and forward ATM interworking will be provided in the ....

W. Stallings, Data and Computer Communications, Fifth Edition, Prentice Hall International, 1997.

No context found.

Markley, R.W. 1990: Data Communications and Interoperability, Prentice-Hall International.

No context found.

William Stallings, \Cryptography and Network Security " , Prentice Hall International, 1999.

No context found.

W. Stallings, Data and Computer Communications, Prentice Hall International , Inc. (1997)

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