Sciweavers

CCS
2008
ACM
13 years 5 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 5 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 5 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 5 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 5 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 5 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
CCS
2008
ACM
13 years 5 months ago
Towards automatic reverse engineering of software security configurations
The specifications of an application's security configuration are crucial for understanding its security policies, which can be very helpful in security-related contexts such...
Rui Wang 0010, XiaoFeng Wang, Kehuan Zhang, Zhuowe...
CCS
2008
ACM
13 years 5 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
CCS
2008
ACM
13 years 5 months ago
Identity-based encryption with efficient revocation
Identity-based encryption (IBE) is an exciting alternative to public-key encryption, as IBE eliminates the need for a Public Key Infrastructure (PKI). Any setting, PKI- or identit...
Alexandra Boldyreva, Vipul Goyal, Virendra Kumar