Sciweavers

130 search results - page 11 / 26
» How to Encrypt with a Malicious Random Number Generator
Sort
View
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 7 months ago
Distributed Source Coding in the Presence of Byzantine Sensors
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...
Oliver Kosut, Lang Tong
JDCTA
2010
250views more  JDCTA 2010»
13 years 2 months ago
A Novel Non-Expansion Visual Secret Sharing Scheme For Binary Image
In visual cryptography, the secret can be any written text, graphical representation, or picture. This technique, some time called visual secret sharing (VSS), allows visual infor...
Thekra Abbas, Zou Beiji
ACSAC
2009
IEEE
14 years 2 months ago
Symmetric Cryptography in Javascript
—We take a systematic approach to developing a symmetric cryptography library in Javascript. We study various strategies for optimizing the code for the Javascript interpreter, a...
Emily Stark, Michael Hamburg, Dan Boneh
ICSE
2008
IEEE-ACM
14 years 8 months ago
ARTOO: adaptive random testing for object-oriented software
Intuition is often not a good guide to know which testing strategies will work best. There is no substitute for experimental analysis based on objective criteria: how many bugs a ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
IJISEC
2010
121views more  IJISEC 2010»
13 years 6 months ago
Flowchart description of security primitives for controlled physical unclonable functions
Physical Unclonable Functions (PUFs) are physical objects that are unique, practically unclonable and that behave like a random function when subjected to a challenge. Their use h...
Boris Skoric, Marc X. Makkes