Abstract: This paper considers the basic question of how strong of a probabilistic guarantee can a hash table, storing $n(1+\Theta(1))\log n$-bit key/value pairs ...
Abstract: In this work we provide numerical results concerning a silicon-on-insulator photonic neuromorphic circuit configured as a physical unclonable function. The proposed scheme is enhanced with ...
A Verifiable Random Function (VRF) is the public-key version of a keyed cryptographic hash, and are useful for preventing enumeration of hash-based data structures. Only the holder of the private key ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results