Sciweavers

849 search results - page 73 / 170
» Secure Applications of Low-Entropy Keys
Sort
View
CSFW
1998
IEEE
14 years 2 months ago
Proving Security Protocols with Model Checkers by Data Independence Techniques
Model checkers such as FDR have been extremely e ective in checking for, and nding, attacks on cryptographic protocols { see, for example 11, 12, 14] and many of the papers in 3]....
A. W. Roscoe
ACSAC
2005
IEEE
14 years 3 months ago
A Nitpicker's guide to a minimal-complexity secure GUI
Malware such as Trojan Horses and spyware remain to be persistent security threats that exploit the overly complex graphical user interfaces of today’s commodity operating syste...
Norman Feske, Christian Helmuth
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
14 years 3 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
CODES
2004
IEEE
14 years 1 months ago
Low energy security optimization in embedded cryptographic systems
Future embedded and wireless devices will be increasingly powerful supporting many applications including one of the most crucial, security. Although many wireless and embedded de...
Catherine H. Gebotys
JMLR
2010
198views more  JMLR 2010»
13 years 4 months ago
Online Anomaly Detection under Adversarial Impact
Security analysis of learning algorithms is gaining increasing importance, especially since they have become target of deliberate obstruction in certain applications. Some securit...
Marius Kloft, Pavel Laskov