The Experts below are selected from a list of 804 Experts worldwide ranked by ideXlab platform

Matthew J.b. Robshaw - One of the best experts on this subject based on the ideXlab platform.

  • Improved (and Practical) Public-Key Authentication for UHF RFID Tags
    Smart Card Research and Advanced Applications, 2013
    Co-Authors: Sébastien Canard, Loïc Ferreira, Matthew J.b. Robshaw
    Abstract:

    cryptoGPS has been promoted as a Public-Key technology suitable for UHF RFID tag Authentication. Since it is a classical commitment-challenge-response (CCR) scheme, it can be converted into a signature scheme using the transformation proposed by Fiat and Shamir. Previously this signature variant has not been considered for RFID, but in this paper we show how to achieve this transformation in a way that yields a compact and efficient scheme. Further, the three-pass CCR scheme is turned into a regular challenge-response scheme with the attendant protocol and implementation improvements. Since we use a block cipher rather than a hash function for the transformation, we justify our approach using results in the ideal cipher model and the net result is a variant of cryptoGPS that offers asymmetric UHF tag Authentication with reduced communication and protocol complexity.

  • CARDIS - Improved (and practical) Public-Key Authentication for UHF RFID tags
    Smart Card Research and Advanced Applications, 2012
    Co-Authors: Sébastien Canard, Loïc Ferreira, Matthew J.b. Robshaw
    Abstract:

    cryptoGPS has been promoted as a Public-Key technology suitable for UHF RFID tag Authentication. Since it is a classical commitment-challenge-response (CCR) scheme, it can be converted into a signature scheme using the transformation proposed by Fiat and Shamir. Previously this signature variant has not been considered for RFID, but in this paper we show how to achieve this transformation in a way that yields a compact and efficient scheme. Further, the three-pass CCR scheme is turned into a regular challenge-response scheme with the attendant protocol and implementation improvements. Since we use a block cipher rather than a hash function for the transformation, we justify our approach using results in the ideal cipher model and the net result is a variant of cryptoGPS that offers asymmetric UHF tag Authentication with reduced communication and protocol complexity.

Sébastien Canard - One of the best experts on this subject based on the ideXlab platform.

  • Improved (and Practical) Public-Key Authentication for UHF RFID Tags
    Smart Card Research and Advanced Applications, 2013
    Co-Authors: Sébastien Canard, Loïc Ferreira, Matthew J.b. Robshaw
    Abstract:

    cryptoGPS has been promoted as a Public-Key technology suitable for UHF RFID tag Authentication. Since it is a classical commitment-challenge-response (CCR) scheme, it can be converted into a signature scheme using the transformation proposed by Fiat and Shamir. Previously this signature variant has not been considered for RFID, but in this paper we show how to achieve this transformation in a way that yields a compact and efficient scheme. Further, the three-pass CCR scheme is turned into a regular challenge-response scheme with the attendant protocol and implementation improvements. Since we use a block cipher rather than a hash function for the transformation, we justify our approach using results in the ideal cipher model and the net result is a variant of cryptoGPS that offers asymmetric UHF tag Authentication with reduced communication and protocol complexity.

  • CARDIS - Improved (and practical) Public-Key Authentication for UHF RFID tags
    Smart Card Research and Advanced Applications, 2012
    Co-Authors: Sébastien Canard, Loïc Ferreira, Matthew J.b. Robshaw
    Abstract:

    cryptoGPS has been promoted as a Public-Key technology suitable for UHF RFID tag Authentication. Since it is a classical commitment-challenge-response (CCR) scheme, it can be converted into a signature scheme using the transformation proposed by Fiat and Shamir. Previously this signature variant has not been considered for RFID, but in this paper we show how to achieve this transformation in a way that yields a compact and efficient scheme. Further, the three-pass CCR scheme is turned into a regular challenge-response scheme with the attendant protocol and implementation improvements. Since we use a block cipher rather than a hash function for the transformation, we justify our approach using results in the ideal cipher model and the net result is a variant of cryptoGPS that offers asymmetric UHF tag Authentication with reduced communication and protocol complexity.

Abedelaziz Mohaisen - One of the best experts on this subject based on the ideXlab platform.

  • Computationally Efficient Cooperative Public Key Authentication Protocols in Ubiquitous Sensor Network
    Advancements in Distributed Computing and Internet Technologies, 2020
    Co-Authors: Abedelaziz Mohaisen, Tamer Abuhmed, Daehun Nyang
    Abstract:

    The use of Public Key algorithms to sensor networks brings all merits of these algorithms to such networks: nodes do not need to encounter each other in advance in order to be able to communicate securely. However, this will not be possible unless “good” Key management primitives that guarantee the functionality of these algorithms in the wireless sensor networks are provided. Among these primitives is Public Key Authentication: before sensor nodes can use Public Keys of other nodes in the network to encrypt traffic to them, they need to make sure that the Key provided for a particular node is authentic. In the near past, several researchers have addressed the problem and proposed solutions for it as well. In this chapter we review these solutions. We further discuss a new scheme which uses collaboration among sensor nodes for Public Key Authentication. Unlike the existing solutions for Public Key Authentication in sensor network, which demand a fixed, yet high amount of resources, the discussed work is dynamic; it meets a desirable security requirement at a given overhead constraints that need to be provided. It is scalable where the accuracy of the Authentication and level of security are merely dependent upon the desirable level of resource consumption that the network operator wants to put into the Authentication operation.

  • Efficient Non-Cryptographic Protocols for Public Key Authentication in Wireless Sensor Network
    2020
    Co-Authors: Abedelaziz Mohaisen, Young-jae Maeng, Daehun Nyang
    Abstract:

    We follow the promising recent results of deploying the Public Key cryptography in sensor networks. Recent results have shown that the Public Key algorithms are computationally feasible on the typical sensor nodes. However, once the Public Key cryptography is brought to the sensor network, security services such like Key Authentication will be critically required. In this paper we investigate the Public Key Authentication problem in the sensor network and provide several Authentication protocols. Our protocols are mainly based on the non-solvable overhearing in the wireless environment and a distributed voting mechanism. To show the value of our protocols, we provide an extensive analysis of the used resources and the resulting security level. As well, we compare our work with other existing works. For further benefit of our protocols, we list several additional applications in the sensor network where our protocols provide a sufficient Authentication under the constrained resources.

  • UIC - Cooperative Public Key Authentication protocol in wireless sensor network
    Ubiquitous Intelligence and Computing, 2006
    Co-Authors: Daehun Nyang, Abedelaziz Mohaisen
    Abstract:

    Recent measurements for Public Key Cryptography (PKC) protocols on 8-bit wireless sensor nodes showed optimistic results. It has been shown that Elliptic Curve Cryptography (ECC) is quite applicable to WSN. Still, PKC is much expensive in terms of computation and memory compared by the Symmetric Key Cryptography (SKC). In addition, in PKC, each Public Key needs to be authenticated before it’s used. We believe that sooner or later, PKC will be widely deployed in WSN. Therefore, we present a cooperative distributed Public Key Authentication scheme that does not require any cryptographic overhead. In our scheme, each node is let to store a few number of hashed Keys for other nodes. When a Public Key Authentication is required, nodes who store this Key help in authenticating it in a distributed and cooperative way. We consider the constrained resources of the sensor node. Additionally, we extend our scheme to fit with small range of Authentication error.

  • cooperative Public Key Authentication protocol in wireless sensor network
    Lecture Notes in Computer Science, 2006
    Co-Authors: Daehun Nyang, Abedelaziz Mohaisen
    Abstract:

    Recent measurements for Public Key Cryptography (PKC) protocols on 8-bit wireless sensor nodes showed optimistic results. It has been shown that Elliptic Curve Cryptography (ECC) is quite applicable to WSN. Still, PKC is much expensive in terms of computation and memory compared by the Symmetric Key Cryptography (SKC). In addition, in PKC, each Public Key needs to be authenticated before it's used. We believe that sooner or later, PKC will be widely deployed in WSN. Therefore, we present a cooperative distributed Public Key Authentication scheme that does not require any cryptographic overhead. In our scheme, each node is let to store a few number of hashed Keys for other nodes. When a Public Key Authentication is required, nodes who store this Key help in authenticating it in a distributed and cooperative way. We consider the constrained resources of the sensor node. Additionally, we extend our scheme to fit with small range of Authentication error.

Daehun Nyang - One of the best experts on this subject based on the ideXlab platform.

  • Computationally Efficient Cooperative Public Key Authentication Protocols in Ubiquitous Sensor Network
    Advancements in Distributed Computing and Internet Technologies, 2020
    Co-Authors: Abedelaziz Mohaisen, Tamer Abuhmed, Daehun Nyang
    Abstract:

    The use of Public Key algorithms to sensor networks brings all merits of these algorithms to such networks: nodes do not need to encounter each other in advance in order to be able to communicate securely. However, this will not be possible unless “good” Key management primitives that guarantee the functionality of these algorithms in the wireless sensor networks are provided. Among these primitives is Public Key Authentication: before sensor nodes can use Public Keys of other nodes in the network to encrypt traffic to them, they need to make sure that the Key provided for a particular node is authentic. In the near past, several researchers have addressed the problem and proposed solutions for it as well. In this chapter we review these solutions. We further discuss a new scheme which uses collaboration among sensor nodes for Public Key Authentication. Unlike the existing solutions for Public Key Authentication in sensor network, which demand a fixed, yet high amount of resources, the discussed work is dynamic; it meets a desirable security requirement at a given overhead constraints that need to be provided. It is scalable where the accuracy of the Authentication and level of security are merely dependent upon the desirable level of resource consumption that the network operator wants to put into the Authentication operation.

  • Efficient Non-Cryptographic Protocols for Public Key Authentication in Wireless Sensor Network
    2020
    Co-Authors: Abedelaziz Mohaisen, Young-jae Maeng, Daehun Nyang
    Abstract:

    We follow the promising recent results of deploying the Public Key cryptography in sensor networks. Recent results have shown that the Public Key algorithms are computationally feasible on the typical sensor nodes. However, once the Public Key cryptography is brought to the sensor network, security services such like Key Authentication will be critically required. In this paper we investigate the Public Key Authentication problem in the sensor network and provide several Authentication protocols. Our protocols are mainly based on the non-solvable overhearing in the wireless environment and a distributed voting mechanism. To show the value of our protocols, we provide an extensive analysis of the used resources and the resulting security level. As well, we compare our work with other existing works. For further benefit of our protocols, we list several additional applications in the sensor network where our protocols provide a sufficient Authentication under the constrained resources.

  • UIC - Cooperative Public Key Authentication protocol in wireless sensor network
    Ubiquitous Intelligence and Computing, 2006
    Co-Authors: Daehun Nyang, Abedelaziz Mohaisen
    Abstract:

    Recent measurements for Public Key Cryptography (PKC) protocols on 8-bit wireless sensor nodes showed optimistic results. It has been shown that Elliptic Curve Cryptography (ECC) is quite applicable to WSN. Still, PKC is much expensive in terms of computation and memory compared by the Symmetric Key Cryptography (SKC). In addition, in PKC, each Public Key needs to be authenticated before it’s used. We believe that sooner or later, PKC will be widely deployed in WSN. Therefore, we present a cooperative distributed Public Key Authentication scheme that does not require any cryptographic overhead. In our scheme, each node is let to store a few number of hashed Keys for other nodes. When a Public Key Authentication is required, nodes who store this Key help in authenticating it in a distributed and cooperative way. We consider the constrained resources of the sensor node. Additionally, we extend our scheme to fit with small range of Authentication error.

  • cooperative Public Key Authentication protocol in wireless sensor network
    Lecture Notes in Computer Science, 2006
    Co-Authors: Daehun Nyang, Abedelaziz Mohaisen
    Abstract:

    Recent measurements for Public Key Cryptography (PKC) protocols on 8-bit wireless sensor nodes showed optimistic results. It has been shown that Elliptic Curve Cryptography (ECC) is quite applicable to WSN. Still, PKC is much expensive in terms of computation and memory compared by the Symmetric Key Cryptography (SKC). In addition, in PKC, each Public Key needs to be authenticated before it's used. We believe that sooner or later, PKC will be widely deployed in WSN. Therefore, we present a cooperative distributed Public Key Authentication scheme that does not require any cryptographic overhead. In our scheme, each node is let to store a few number of hashed Keys for other nodes. When a Public Key Authentication is required, nodes who store this Key help in authenticating it in a distributed and cooperative way. We consider the constrained resources of the sensor node. Additionally, we extend our scheme to fit with small range of Authentication error.

David Lefranc - One of the best experts on this subject based on the ideXlab platform.

  • CHES - Public Key Authentication with One (Online) Single Addition
    Lecture Notes in Computer Science, 2004
    Co-Authors: Marc Girault, David Lefranc
    Abstract:

    We focus on the GPS identification scheme implementation in low cost chips, i.e not equipped with a microprocessor (such as those embedded in some prepaid telephone cards or RFID tags). We present three solutions to decrease the overall number of manipulated bits during the computation of the answer by a factor two or three. All the solutions stand in the use of low Hamming weight parameters. The first one consists in building the private Key as the product of low Hamming weight sub-Keys. The second one suggests the choice of full size low Hamming weight private Keys. Finally, the third solution corresponds to a variant of the basic GPS scheme in which large challenges with low Hamming weight are used. Whereas the first solution does not withdraw the need for a multiplier in the chip, the two other ones are ideally suited to low cost chips as they can be implemented with only one serial addition. Therefore, as a surprising result, one entity can be Public Key authenticated by doing one on-line addition only at the time of Authentication!

  • Public Key Authentication with one online single addition
    Lecture Notes in Computer Science, 2004
    Co-Authors: Marc Girault, David Lefranc
    Abstract:

    We focus on the GPS identification scheme implementation in low cost chips, i.e not equipped with a microprocessor (such as those embedded in some prepaid telephone cards or RFID tags). We present three solutions to decrease the overall number of manipulated bits during the computation of the answer by a factor two or three. All the solutions stand in the use of low Hamming weight parameters. The first one consists in building the private Key as the product of low Hamming weight sub-Keys. The second one suggests the choice of full size low Hamming weight private Keys. Finally, the third solution corresponds to a variant of the basic GPS scheme in which large challenges with low Hamming weight are used. Whereas the first solution does not withdraw the need for a multiplier in the chip, the two other ones are ideally suited to low cost chips as they can be implemented with only one serial addition. Therefore, as a surprising result, one entity can be Public Key authenticated by doing one on-line addition only at the time of Authentication!.