Jim Plusquellic

Dr. Jim Plusquellic

University of New Mexico, Albuquerque, New Mexico, USA
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 November 2016 in Cryptography
Verified
Journal Article
Open access
PDF file
WCWenjie Che
Wenjie Che
MMMitchell Martin
Mitchell Martin
GPGoutham Pocklassery
Goutham Pocklassery
VKVENKATA KISHORE KAJULURI
VENKATA KISHORE KAJULURI
FSFareena Saqib
Fareena Saqib
Jim PlusquellicJim Plusquellic
Jim Plusquellic
This paper describes an authentication protocol using a Hardware-Embedded Delay PUF called HELP. HELP derives randomness from within-die path delay variations that occur along the paths within a hardware implementation of a cryptographic primitive, such as AES or SHA-3. The digitized timing values which represent the path delays are stored in a database on a secure server (verifier) as an alternative to storing PUF response bitstrings. This enables the development of an efficient authentication protocol that provides both privacy and mutual authentication. The security properties of the protocol are analyzed using data collected from a set of Xilinx Zynq FPGAs.

21 September 2020 in IEEE Consumer Electronics Magazine
Verified
Journal Article
Closed access
GFGeorgios Fragkos
Georgios Fragkos
CMCyrus Minwalla
Cyrus Minwalla
Jim PlusquellicJim Plusquellic
Jim Plusquellic
Eirini Eleni Eleni TsiropoulouEirini Eleni Eleni Tsiropoulou
Eirini Eleni Eleni Tsiropoulou
Electronic money or e-Cash is becoming increasingly popular as the preferred strategy for making purchases, both on- and off-line. Several unique attributes of e-Cash are appealing to customers, including the convenience of always having "cash-on-hand" without the need to periodically visit the ATM, the ability to perform peer-to-peer transactions without an intermediary, and the peace of mind associated in conducting those transactions privately. Equally important is that paper money provides customers with an anonymous method of payment, which is highly valued by many individuals. Although anonymity is implicit with fiat money, it is a difficult property to preserve within e-Cash schemes. In this paper, we investigate several artificial intelligence (AI) approaches for improving performance and privacy within a previously proposed e-Cash scheme called PUF-Cash. PUF-Cash utilizes physical unclonable functions (PUFs) for authentication and encryption operations between Alice, the Bank and multiple trusted third parties (mTTPs). The AI methods select a subset of the TTPs and distribute withdrawal amounts to maximize the performance and privacy associated with Alice's e-Cash tokens. Simulation results show the effectiveness of the various AI approaches using a large test-bed architecture.

7 June 2017 in Cryptography
Verified
Journal Article
Open access
PDF file
WCWenjie Che
Wenjie Che
VKVENKATA KISHORE KAJULURI
VENKATA KISHORE KAJULURI
MMMitchell Martin
Mitchell Martin
FSFareena Saqib
Fareena Saqib
Jim PlusquellicJim Plusquellic
Jim Plusquellic
The magnitude of the information content associated with a particular implementation of a Physical Unclonable Function (PUF) is critically important for security and trust in emerging Internet of Things (IoT) applications. Authentication, in particular, requires the PUF to produce a very large number of challenge-response-pairs (CRPs) and, of even greater importance, requires the PUF to be resistant to adversarial attacks that attempt to model and clone the PUF (model-building attacks). Entropy is critically important to the model-building resistance of the PUF. A variety of metrics have been proposed for reporting Entropy, each measuring the randomness of information embedded within PUF-generated bitstrings. In this paper, we report the Entropy, MinEntropy, conditional MinEntropy, Interchip hamming distance and National Institute of Standards and Technology (NIST) statistical test results using bitstrings generated by a Hardware-Embedded Delay PUF called HELP. The bitstrings are generated from data collected in hardware experiments on 500 copies of HELP implemented on a set of Xilinx Zynq 7020 SoC Field Programmable Gate Arrays (FPGAs) subjected to industrial-level temperature and voltage conditions. Special test cases are constructed which purposely create worst case correlations for bitstring generation. Our results show that the processes proposed within HELP to generate bitstrings add significantly to their Entropy, and show that classical re-use of PUF components, e.g., path delays, does not result in large Entropy losses commonly reported for other PUF architectures.

30 March 2021 in Sensors
Verified
Journal Article
Open access
PDF file
DHDerek Heeger
Derek Heeger
MGMaeve Garigan
Maeve Garigan
Eirini Eleni Eleni TsiropoulouEirini Eleni Eleni Tsiropoulou
Eirini Eleni Eleni Tsiropoulou
Jim PlusquellicJim Plusquellic
Jim Plusquellic
Internet of Things (IoT) devices rely upon remote firmware updates to fix bugs, update embedded algorithms, and make security enhancements. Remote firmware updates are a significant burden to wireless IoT devices that operate using low-power wide-area network (LPWAN) technologies due to slow data rates. One LPWAN technology, Long Range (LoRa), has the ability to increase the data rate at the expense of range and noise immunity. The optimization of communications for maximum speed is known as adaptive data rate (ADR) techniques, which can be applied to accelerate the firmware update process for any LoRa-enabled IoT device. In this paper, we investigate ADR techniques in an application that provides remote monitoring of cattle using small, battery-powered devices that transmit data on cattle location and health using LoRa. In addition to issues related to firmware update speed, there are significant concerns regarding reliability and security when updating firmware on mobile, energy-constrained devices. A malicious actor could attempt to steal the firmware to gain access to embedded algorithms or enable faulty behavior by injecting their own code into the device. A firmware update could be subverted due to cattle moving out of the LPWAN range or the device battery not being sufficiently charged to complete the update process. To address these concerns, we propose a secure and reliable firmware update process using ADR techniques that is applicable to any mobile or energy-constrained LoRa device. The proposed system is simulated and then implemented to evaluate its performance and security properties.

18 July 2018 in Cryptography
Verified
Journal Article
Open access
PDF file
DJDon Owen Jr.
Don Owen Jr.
DHDerek Heeger
Derek Heeger
CCCalvin Chan
Calvin Chan
WCWenjie Che
Wenjie Che
Fareena saqibFareena saqib
Fareena saqib
Jim PlusquellicJim Plusquellic
Jim Plusquellic
Secure booting within a field-programmable gate array (FPGA) environment is traditionally implemented using hardwired embedded cryptographic primitives and non-volatile memory (NVM)-based keys, whereby an encrypted bitstream is decrypted as it is loaded from an external storage medium, e.g., Flash memory. A novel technique is proposed in this paper that self-authenticates an unencrypted FPGA configuration bitstream loaded into the FPGA during the start-up. The internal configuration access port (ICAP) interface is accessed to read out configuration information of the unencrypted bitstream, which is then used as input to a secure hash function SHA-3 to generate a digest. In contrast to conventional authentication, where the digest is computed and compared with a second pre-computed value, we use the digest as a challenge to a hardware-embedded delay physical unclonable function (PUF) called HELP. The delays of the paths sensitized by the challenges are used to generate a decryption key using the HELP algorithm. The decryption key is used in the second stage of the boot process to decrypt the operating system (OS) and applications. It follows that any type of malicious tampering with the unencrypted bitstream changes the challenges and the corresponding decryption key, resulting in key regeneration failure. A ring oscillator is used as a clock to make the process autonomous (and unstoppable), and a novel on-chip time-to-digital-converter is used to measure path delays, making the proposed boot process completely self-contained, i.e., implemented entirely within the re-configurable fabric and without utilizing any vendor-specific FPGA features.

20 July 2019 in Cryptography
Verified
Journal Article
Open access
PDF file
JCJeff Calhoun
Jeff Calhoun
CMCyrus Minwalla
Cyrus Minwalla
CHCharles Helmich
Charles Helmich
Fareena saqibFareena saqib
Fareena saqib
WCWenjie Che
Wenjie Che
Jim PlusquellicJim Plusquellic
Jim Plusquellic
Electronic money (e-money or e-Cash) is the digital representation of physical banknotes augmented by added use cases of online and remote payments. This paper presents a novel, anonymous e-money transaction protocol, built based on physical unclonable functions (PUFs), titled PUF-Cash. PUF-Cash preserves user anonymity while enabling both offline and online transaction capability. The PUF’s privacy-preserving property is leveraged to create blinded tokens for transaction anonymity while its hardware-based challenge–response pair authentication scheme provides a secure solution that is impervious to typical protocol attacks. The scheme is inspired from Chaum’s Digicash work in the 1980s and subsequent improvements. Unlike Chaum’s scheme, which relies on Rivest, Shamir and Adlemans’s (RSA’s) multiplicative homomorphic property to provide anonymity, the anonymity scheme proposed in this paper leverages the random and unique statistical properties of synthesized integrated circuits. PUF-Cash is implemented and demonstrated using a set of Xilinx Zynq Field Programmable Gate Arrays (FPGAs). Experimental results suggest that the hardware footprint of the solution is small, and the transaction rate is suitable for large-scale applications. An in-depth security analysis suggests that the solution possesses excellent statistical qualities in the generated authentication and encryption keys, and it is robust against a variety of attack vectors including model-building, impersonation, and side-channel variants.