Sciweavers

34 search results - page 6 / 7
» Strong Cryptography from Weak Secrets
Sort
View
FOCS
2002
IEEE
14 years 2 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
CASES
2009
ACM
14 years 2 months ago
Side channel analysis of AVR XMEGA crypto engine
AVR XMEGA is the recent general-purpose 8-bit microcontroller from Atmel featuring symmetric crypto engines. We analyze the resistance of XMEGA crypto engines to side channel atta...
Ilya Kizhvatov
WISEC
2009
ACM
14 years 4 months ago
Securing network access in wireless sensor networks
In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In t...
Kun Sun, An Liu, Roger Xu, Peng Ning, W. Douglas M...
EUROCRYPT
2005
Springer
14 years 3 months ago
Secure Remote Authentication Using Biometric Data
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafai...
CODASPY
2012
12 years 5 months ago
Identifying native applications with high assurance
Main stream operating system kernels lack a strong and reliable mechanism for identifying the running processes and binding them to the corresponding executable applications. In t...
Hussain M. J. Almohri, Danfeng (Daphne) Yao, Denni...