For each enrolled challengex∈ U, she also runs Algorithm 1 to produce an associated challengex 1 and retains the corresponding ordered listJ

Alice queries the HLPUF inmode 0on enough challenges to obtain a database of challenge-response pairs DB={(x, f 1(x), f2(x)) :x∈ U }

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

quant-ph · 2026-08-11 · reject · novelty 6.0

A statistical bit-commitment and coin-flipping scheme is claimed from hybrid locked PUFs, but the binding proof has a load-bearing gap.

Showing 1 of 1 citing paper.

Statistically-Secure Bit Commitment and Coin Flipping Protocols Based on Quantum Hardware Assumptions quant-ph · 2026-08-11 · reject · none · ref 2
A statistical bit-commitment and coin-flipping scheme is claimed from hybrid locked PUFs, but the binding proof has a load-bearing gap.