Physical Unclonable Function (PUF)-Based e-Cash Transaction Protocol (PUF-Cash)

Calhoun, Jeff; Minwalla, Cyrus; Helmich, Charles; Saqib, Fareena; Che, Wenjie; Plusquellic, Jim

doi:10.3390/cryptography3030018

Cited by 15 publications

(4 citation statements)

References 30 publications

(52 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A few of these architectures are as follows: arbiter PUF [30], ring oscillator PUF [17], transient effect ring oscillator PUF [31], static random access memory PUF [32], hardware-embedded delay PUF [33], and more [34]. Utilizing these basic properties, many PUF-based authentication protocols have been proposed, both for unilateral authentication [35,36] and mutual authentication [29,[36][37][38]. A comprehensive survey on lightweight PUF authentication schemes is presented by Delvaux et al [39].…”

Section: Related Workmentioning

confidence: 99%

Authenticated secret key generation in delay-constrained wireless systems

Mitev

Chorti

Reed

et al. 2020

J Wireless Com Network

View full text Add to dashboard Cite

With the emergence of 5G low-latency applications, such as haptics and V2X, low-complexity and low-latency security mechanisms are needed. Promising lightweight mechanisms include physical unclonable functions (PUF) and secret key generation (SKG) at the physical layer, as considered in this paper. In this framework, we propose (i) a zero round trip time (0-RTT) resumption authentication protocol combining PUF and SKG processes, (ii) a novel authenticated encryption (AE) using SKG, and (iii) pipelining of the AE SKG and the encrypted data transfer in order to reduce latency. Implementing the pipelining at PHY, we investigate a parallel SKG approach for multi-carrier systems, where a subset of the subcarriers are used for SKG and the rest for data transmission. The optimal solution to this PHY resource allocation problem is identified under security, power, and delay constraints, by formulating the subcarrier scheduling as a subset-sum 0 − 1 knapsack optimization. A heuristic algorithm of linear complexity is proposed and shown to incur negligible loss with respect to the optimal dynamic programming solution. All of the proposed mechanisms have the potential to pave the way for a new breed of latency aware security protocols.

show abstract

Section: Related Workmentioning

confidence: 99%

Authenticated secret key generation in delay-constrained wireless systems

Mitev

Chorti

Reed

et al. 2020

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Several PUF-based authentication protocols have been presented. For instance, a delay PUF was deployed as a key generator in an anonymous e-money transaction protocol [27]. In [28], PUF is proposed for a RFID-authentication protocol.…”

Section: Pufs Use-cases and Their Weaknessesmentioning

confidence: 99%

Low-Complexity Nonlinear Self-Inverse Permutation for Creating Physically Clone-Resistant Identities

2020

View full text Add to dashboard Cite

New large classes of permutations over ℤ 2 n based on T-Functions as Self-Inverting Permutation Functions (SIPFs) are presented. The presented classes exhibit negligible or low complexity when implemented in emerging FPGA technologies. The target use of such functions is in creating the so called Secret Unknown Ciphers (SUC) to serve as resilient Clone-Resistant structures in smart non-volatile Field Programmable Gate Arrays (FPGA) devices. SUCs concepts were proposed a decade ago as digital consistent alternatives to the conventional analog inconsistent Physical Unclonable Functions PUFs. The proposed permutation classes are designed and optimized particularly to use non-consumed Mathblock cores in programmable System-on-Chip (SoC) FPGA devices. Hardware and software complexities for realizing such structures are optimized and evaluated for a sample expected target FPGA technology. The attained security levels of the resulting SUCs are evaluated and shown to be scalable and usable even for post-quantum crypto systems.

show abstract

“…A few of these architectures are: arbiter PUF [30], ring oscillator PUF [17], transient effect ring oscillator PUF [31], static random-access memory PUF [32], hardware embedded delay PUF [33] and more [34]. Utilising these basic properties, many PUF-based authentication protocols have been proposed, both for unilateral authentication [35,36] and mutual authentication [29,[36][37][38]. A comprehensive survey on lightweight PUF authentication schemes is presented by Delvaux et al [39].…”

Section: Related Workmentioning

confidence: 99%

Authenticated Secret Key Generation in Delay Constrained Wireless Systems

Mitev¹,

Chorti²,

Reed³

et al. 2020

Preprint

View full text Add to dashboard Cite

With the emergence of 5G low latency applications, such as haptics and V2X, low complexity and low latency security mechanisms are needed. Promising lightweight mechanisms include physical unclonable functions (PUF) and secret key generation (SKG) at the physical layer, as considered in this paper. In this framework we propose i) a zero-round-trip-time (0-RTT) resumption authentication protocol combining PUF and SKG processes; ii) a novel authenticated encryption (AE) using SKG; iii) pipelining of the AE SKG and the encrypted data transfer in order to reduce latency. Implementing the pipelining at PHY, we investigate a parallel SKG approach for multi-carrier systems, where a subset of the subcarriers are used for SKG and the rest for data transmission. The optimal solution to this PHY resource allocation problem is identified under security, power and delay constraints, by formulating the subcarrier scheduling as a subset-sum 0 − 1 knapsack optimization. A heuristic algorithm of linear complexity is proposed and shown to incur negligible loss with respect to the optimal dynamic programming solution. All of the proposed mechanisms, have the potential to

show abstract

Physical Unclonable Function (PUF)-Based e-Cash Transaction Protocol (PUF-Cash)

Cited by 15 publications

References 30 publications

Authenticated secret key generation in delay-constrained wireless systems

Authenticated secret key generation in delay-constrained wireless systems

Low-Complexity Nonlinear Self-Inverse Permutation for Creating Physically Clone-Resistant Identities

Authenticated Secret Key Generation in Delay Constrained Wireless Systems

Contact Info

Product

Resources

About