Sciweavers

2363 search results - page 268 / 473
» How Secure is RFID
Sort
View
SOUPS
2009
ACM
16 years 1 months ago
Games for extracting randomness
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
Ran Halprin, Moni Naor
HICSS
2008
IEEE
109views Biometrics» more  HICSS 2008»
16 years 1 months ago
Web-Based Service Exchange System for Agents and Humans Alike
Semantic Web research aims at bridging the gap between how humans and agents process information readily available on the Internet. One of the great challenges to this goal lies i...
Evens Jean, Machigar Ongtang, Ali R. Hurson
SADFE
2008
IEEE
16 years 1 months ago
Finding the Evidence in Tamper-Evident Logs
Secure logs are powerful tools for building systems that must resist forgery, prove temporal relationships, and stand up to forensic scrutiny. The proofs of order and integrity en...
Daniel Sandler, Kyle Derr, Scott A. Crosby, Dan S....
ACISP
2008
Springer
16 years 1 months ago
Collisions for Round-Reduced LAKE
LAKE is a family of cryptographic hash functions presented at FSE 2008. It is an iterated hash function and defines two main instances with a 256 bit and 512 bit hash value. In th...
Florian Mendel, Martin Schläffer
ACSAC
2007
IEEE
16 years 1 months ago
Quarantining Untrusted Entities: Dynamic Sandboxing Using LEAP
Jails, Sandboxes and other isolation mechanisms limit the damage from untrusted programs by reducing a process’s privileges to the minimum. Sandboxing is designed to thwart such...
Manigandan Radhakrishnan, Jon A. Solworth