An anonymous shared memory REG can be seen as an array of atomic registers such that there is no a priori agreement among the processes on the names of the registers. As an example a very same physical register can be...
详细信息
ISBN:
(纸本)9781450375825
An anonymous shared memory REG can be seen as an array of atomic registers such that there is no a priori agreement among the processes on the names of the registers. As an example a very same physical register can be known as REG[x] by a process p and as REG[y] (where y not equal x) by another process q. Moreover, the register known as REG[a] by a process p and the register known as REG[b] by a process q can be the same physical register. It is assumed that each process has a unique identifier that can only be compared for equality. This article is on solving the d-election problem, in which it is required to elect at least one and at most d leaders, in such an anonymous shared memory system. We notice that the 1-election problem is the familiar leader election problem. Let n be the number of processes and m the size of the anonymous memory (number of atomic registers). The article shows that the condition gcd(m, n) <= d is necessary and sufficient for solving the d-election problem, where communication is through read/write or read+modify+write registers. The algorithm used to prove the sufficient condition relies on Bezout's Identity - a Diophantine equation relating numbers according to their Greatest Common Divisor. Furthermore, in the process of proving the sufficient condition, it is shown that 1-leader election can be solved using only a single read/write register (which refutes a 1989 conjecture stating that three non-anonymous registers are necessary), and that the exact d-election problem, where exactly d leaders must be elected, can be solved if and only if gcd(m, n) divides d.
Using the same key for both encryption as well as decryption is the key principle in symmetric algorithm. This mechanism involves the existence of centralized Key Distribution Centre also known as KDC, responsible for...
详细信息
ISBN:
(纸本)9781467379113
Using the same key for both encryption as well as decryption is the key principle in symmetric algorithm. This mechanism involves the existence of centralized Key Distribution Centre also known as KDC, responsible for distributing and maintaining attributes and secret keys to its users. There also is a decentralized access control scheme used to make data storage in clouds more secure. The security in these security systems suffers a major drawback when one user requests for the sharing of data of some user. This procedure involves some loopholes that can allow the culprit to get access to personal information in the cloud storage.
In the current scenario,various forms of information are spread everywhere,especially through the Internet.A lot of valuable information is contained in the dissemination,so security issues have always attracted *** t...
详细信息
In the current scenario,various forms of information are spread everywhere,especially through the Internet.A lot of valuable information is contained in the dissemination,so security issues have always attracted *** the emergence of cryptographic algorithms,information security has been further ***,cryptography encryption is divided into symmetric encryption and asymmetric *** symmetric encryption has a very fast computation speed and is beneficial to encrypt a large amount of data,the security is not as high as asymmetric *** same pair of keys used in symmetric algorithms leads to security ***,if the key can be protected,the security could be *** an asymmetric algorithm to protect the key and encrypting the message with a symmetric algorithm would be a good *** paper will review security issues in the information transmission and the method of hybrid encryption algorithms that will be widely used in the ***,the various characteristics of algorithms in different systems and some typical cases of hybrid encryption will be reviewed and analyzed to showcase the reinforcement by combining *** encryption algorithms will improve the security of the transmission without causing more other ***,the way how the encryption algorithms combine to strength the security will be discussed with the aid of an example.
暂无评论