Sciweavers

121 search results - page 10 / 25
» Breaking Fully-Homomorphic-Encryption Challenges
Sort
View
WS
2006
ACM
14 years 3 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla
CHI
2005
ACM
13 years 11 months ago
Designing human friendly human interaction proofs (HIPs)
HIPs, or Human Interactive Proofs, are challenges meant to be easily solved by humans, while remaining too hard to be economically solved by computers. HIPs are increasingly used ...
Kumar Chellapilla, Kevin Larson, Patrice Y. Simard...
FSE
2008
Springer
143views Cryptology» more  FSE 2008»
13 years 11 months ago
Algebraic and Slide Attacks on KeeLoq
KeeLoq is a block cipher used in wireless devices that unlock the doors and alarms in cars manufactured by Chrysler, Daewoo, Fiat, GM, Honda, Jaguar, Toyota, Volvo, Volkswagen, etc...
Nicolas Courtois, Gregory V. Bard, David Wagner
MMS
2010
13 years 8 months ago
Asynchronous reflections: theory and practice in the design of multimedia mirror systems
-- In this paper, we present a theoretical framing of the functions of a mirror by breaking the synchrony between the state of a reference object and its reflection. This framing p...
Wei Zhang, Bo Begole, Maurice Chu
KDD
2004
ACM
106views Data Mining» more  KDD 2004»
14 years 10 months ago
Early detection of insider trading in option markets
"Inside information" comes in many forms: knowledge of a corporate takeover, a terrorist attack, unexpectedly poor earnings, the FDA's acceptance of a new drug, etc...
Steve Donoho