Sciweavers

5476 search results - page 177 / 1096
» Resettably Secure Computation
Sort
View
135
Voted
ISSTA
2010
ACM
15 years 8 months ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 8 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
SCN
2010
Springer
144views Communications» more  SCN 2010»
15 years 3 months ago
Generic Constructions of Parallel Key-Insulated Encryption
Exposure of a secret key is a significant threat in practice. As a notion of security against key exposure, Dodis et al. advocated key-insulated security, and proposed concrete k...
Goichiro Hanaoka, Jian Weng
TISSEC
2010
142views more  TISSEC 2010»
14 years 11 months ago
A logical specification and analysis for SELinux MLS policy
The SELinux mandatory access control (MAC) policy has recently added a multi-level security (MLS) model which is able to express a fine granularity of control over a subject'...
Boniface Hicks, Sandra Rueda, Luke St. Clair, Tren...
125
Voted
CHI
2010
ACM
15 years 11 months ago
Usability and strength in click-based graphical passwords
Click-based graphical passwords have attractive usability properties, such as cueing and good memorability. However, image size and number of click-points in each password signifi...
Elizabeth Stobert