Sciweavers

3299 search results - page 477 / 660
» Privacy and Trusted Computing
Sort
View
IEEEARES
2010
IEEE
16 years 26 days ago
A Complexity Based Model for Quantifying Forensic Evidential Probabilities
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
Richard E. Overill, Jantje A. M. Silomon, Kam-Pui ...
IEEEARES
2010
IEEE
16 years 26 days ago
Secure Monitoring of Service Level Agreements
—Service Level Agreements (SLA) are commonly used to define terms and conditions of service provisioning. WS-Agreement1 is an SLA specification that addresses the need of both ...
K. P. Clark, Martijn Warnier, Frances M. T. Brazie...
IEEEARES
2010
IEEE
16 years 26 days ago
Program Obfuscation by Strong Cryptography
—Program obfuscation is often employed by malware in order to avoid detection by anti-virus software, but it has many other legitimate uses, such as copy protection, software lic...
Zeljko Vrba, Pål Halvorsen, Carsten Griwodz
CCS
2010
ACM
16 years 25 days ago
Toward practical authorization-dependent user obligation systems
Many authorization system models include some notion of obligation. Little attention has been given to user obligations that depend on and affect authorizations. However, to be u...
Murillo Pontual, Omar Chowdhury, William H. Winsbo...
EDBTW
2010
Springer
16 years 25 days ago
Quantile-based bootstrap methods to generate continuous synthetic data
To face the increasing demand from users, National Statistical Institutes (NSI) release different information products. The dissemination of this information should be performed ...
Daniela Ichim