Sciweavers

71 search results - page 5 / 15
» DNA-based random number generation in security circuitry
Sort
View
JCS
2011
156views more  JCS 2011»
13 years 2 months ago
Securing low-cost RFID systems: An unconditionally secure approach
We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authenticat...
Basel Alomair, Loukas Lazos, Radha Poovendran
DSD
2005
IEEE
96views Hardware» more  DSD 2005»
13 years 9 months ago
Improvement of the Fault Coverage of the Pseudo-Random Phase in Column-Matching BIST
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
Peter Filter, Hana Kubatova
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
CHES
2005
Springer
170views Cryptology» more  CHES 2005»
14 years 1 months ago
Design of Testable Random Bit Generators
Abstract. In this paper, the evaluation of random bit generators for security applications is discussed and the concept of stateless generator is introduced. It is shown how, for t...
Marco Bucci, Raimondo Luzzi