Sciweavers

CCS
2008
ACM
13 years 9 months ago
Enforcing a security pattern in stakeholder goal models
Patterns are useful knowledge about recurring problems and solutions. Detecting a security problem using patterns in requirements models may lead to its early solution. In order t...
Yijun Yu, Haruhiko Kaiya, Hironori Washizaki, Ying...
CCS
2008
ACM
13 years 9 months ago
Towards experimental evaluation of code obfuscation techniques
While many obfuscation schemes proposed, none of them satisfy any strong definition of obfuscation. Furthermore secure generalpurpose obfuscation algorithms have been proven to be...
Mariano Ceccato, Massimiliano Di Penta, Jasvir Nag...
CCS
2008
ACM
13 years 9 months ago
Towards provable secure neighbor discovery in wireless networks
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
Marcin Poturalski, Panagiotis Papadimitratos, Jean...
CCS
2008
ACM
13 years 9 months ago
Location privacy of distance bounding protocols
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Kasper Bonne Rasmussen, Srdjan Capkun
CCS
2008
ACM
13 years 9 months ago
Privacy oracle: a system for finding application leaks with black box differential testing
We describe the design and implementation of Privacy Oracle, a system that reports on application leaks of user information via the network traffic that they send. Privacy Oracle ...
Jaeyeon Jung, Anmol Sheth, Ben Greenstein, David W...
CCS
2008
ACM
13 years 9 months ago
Ether: malware analysis via hardware virtualization extensions
Malware has become the centerpiece of most security threats on the Internet. Malware analysis is an essential technology that extracts the runtime behavior of malware, and supplie...
Artem Dinaburg, Paul Royal, Monirul I. Sharif, Wen...
CCS
2008
ACM
13 years 9 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier
CCS
2008
ACM
13 years 9 months ago
PEREA: towards practical TTP-free revocation in anonymous authentication
Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. ...
CCS
2008
ACM
13 years 9 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers