Libing Wu, Jing Wang, Kim-Kwang Raymond Choo, Senior Member, IEEE, Debiao HeSecure Key Agreement • August 31st, 2022
Abstract—As mobile devices ownership becomes more preva- lent (e.g. a user owns multiple mobile devices), the capability to offer secure and user friendly authentication becomes increas- ingly important. While a large number of identity-based user authentication mechanisms for wireless mobile environment have been proposed. However, they are not generally designed for situations where a user’s private key and some other sensitive data can be exposed if his/her mobile device is remotely or physically controlled by an attacker. Threshold secret sharing is one of the solutions to this problem, but it is limited in the requirement that there should exist an honest third-party to hold the complete key after secret reconstruction process. Therefore, in this paper, we consider the special case that only two devices (i.e. no honest party) at the user’s side jointly perform user authentication with a server, and neither device can successfully complete the authentication process alone. Moreover
Dilara Akdog˘anSecure Key Agreement • July 13th, 2015
As in the sample set, we use 300 keys (30 subjects, 10 keys per subject). The entropy values of these keys are given in Figure 6. The more the entropy value approaches to 1, the more random the key is. As can be seen in this figure, 83.67% of the keys have entropy values that are greater than 0.994, and also all of the keys have entropy values that are greater than 0.98, which implies very good randomness. It is important to note that these keys are generated by hashing the common minutiae. It can be normal to have high entropy for the hash results, because the hash functions kind of randomize the input string. Therefore, the entropy values of the concatenation of common minutiae are calculated as well. The concatenation is as follows, x y type. The entropy values of these concatenations are given in Figure 7. Although the
A Secure Key Agreement Scheme in Low-energy Wireless Sensor NetworksSecure Key Agreement • May 13th, 2006
A Secure Key Agreement Protocol for Dynamic GroupSecure Key Agreement • April 10th, 2017
Abstract— To accomplish secure group communication, it is essential to share a unique cryptographic key among group members. The underlying challenges to group key agreement are scalability, efficiency, and security. In a dynamic group environment, the rekeying process is more frequent; therefore, it is more crucial to design an efficient group key agreement protocol. Moreover, with the emergence of various group-based services, it is becoming common for several multicast groups to coexist in the same network. These multicast groups may have several shared users; a join or leave request by a single user can trigger regeneration of multiple group keys. Under the given circumstances the rekeying process becomes a challenging task. In this work, we propose a novel methodology for group key agreement which exploits the state vectors of group members. The state vector is a set of randomly generated nonce instances which determine the logical link between group members and which empowers the
SECURE KEY AGREEMENT FOR SHARING GROUP DATA AND FIND DATA DEDUPLICATION IN CLOUD.Secure Key Agreement • September 19th, 2019
Abstract: safe alongside sound information deduplication can perceptibly reduce the communication and storage outlay in cloud cupboard space services, and has potential application in our Brobdingnagian data- driven society. Existing information deduplication schemes unit naturally meant to conjointly resist brute-force attacks or make sure the strength and information convenience. This subject will deliver the products the isolation protecting and cross domain Brobdingnagian information deduplication in cloud. Existing system has been suffer from key agreement downside. In projected System, to urge eliminate key agreement downside , we have a tendency to tend to implement block vogue primarily based key agreement protocol to share information in csp . It permits multiple partners to freely distribute info in cluster. within projected system, chunk base kind contract procedure to wires varied partners, which could supplely expand to quantity of partners within terribly csp setting per
SECURE KEY AGREEMENT FOR SHARING GROUP DATA AND FIND DATA DEDUPLICATION IN CLOUD.Secure Key Agreement • October 2nd, 2019
Abstract: Safe alongside sound information deduplication can perceptibly reduce the communication and storage outlay in cloud cupboard space services, and has potential application in our Brobdingnagian data-driven society. Existing information deduplication schemes unit naturally meant to conjointly resist brute-force attacks or make sure the strength and information convenience. This subject will deliver the products the isolation protecting and cross domain Brobdingnagian information deduplication in cloud. Existing system has been suffer from key agreement downside. In projected System, to urge eliminate key agreement downside , we have a tendency to tend to implement block vogue primarily based key agreement protocol to share information in csp . It permits multiple partners to freely distribute info in cluster. within projected system, chunk base kind contract procedure to wires varied partners, which could supplely expand to quantity of partners within terribly csp setting per t
