Sciweavers

222 search results - page 7 / 45
» How to Forget a Secret
Sort
View
CORR
2002
Springer
106views Education» more  CORR 2002»
14 years 9 months ago
On model selection and the disability of neural networks to decompose tasks
A neural network with fixed topology can be regarded as a parametrization of functions, which decides on the correlations between functional variations when parameters are adapted...
Marc Toussaint
DAC
2007
ACM
15 years 11 months ago
Physical Unclonable Functions for Device Authentication and Secret Key Generation
Physical Unclonable Functions (PUFs) are innovative circuit primitives that extract secrets from physical characteristics of integrated circuits (ICs). We present PUF designs that...
G. Edward Suh, Srinivas Devadas
PERCOM
2004
ACM
15 years 9 months ago
Untraceable Secret Credentials: Trust Establishment with Privacy
There is generally no a priori trust relationship among entities interacting in pervasive computing environments which makes it necessary to establish trust from scratch. This tas...
Laurent Bussard, Yves Roudier, Refik Molva
CMS
2003
101views Communications» more  CMS 2003»
14 years 11 months ago
Watermark Security via Secret Wavelet Packet Subband Structures
Abstract. Wavelet packet decompositions generalize the classical pyramidal wavelet structure. We use the vast amount of possible wavelet packet decomposition structures to create a...
Werner Dietl, Andreas Uhl
FSE
2011
Springer
268views Cryptology» more  FSE 2011»
14 years 1 months ago
Cryptanalysis of PRESENT-Like Ciphers with Secret S-Boxes
At Eurocrypt 2001, Biryukov and Shamir investigated the security of AES-like ciphers where the substitutions and affine transformations are all key-dependent and successfully crypt...
Julia Borghoff, Lars R. Knudsen, Gregor Leander, S...