Sciweavers

CCS
2008
ACM
13 years 6 months ago
Private combinatorial group testing
Combinatorial group testing, given a set C of individuals ("customers"), consists of applying group tests on subsets of C for the purpose of identifying which members of...
Mikhail J. Atallah, Keith B. Frikken, Marina Blant...
CCS
2008
ACM
13 years 6 months ago
Online subscriptions with anonymous access
Online privacy is an increasingly important problem, as many services are now offered in a digital form. Privacy (or the lack thereof) is of a special concern in subscriptions to ...
Marina Blanton
CCS
2008
ACM
13 years 6 months ago
On the protocol composition logic PCL
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
Cas J. F. Cremers
CCS
2008
ACM
13 years 6 months ago
Flexible security configuration for virtual machines
Virtual machines are widely accepted as a promising basis for building secure systems. However, while virtual machines offer effective mechanisms to create isolated environments, ...
Sandra Rueda, Yogesh Sreenivasan, Trent Jaeger
CCS
2008
ACM
13 years 6 months ago
Avoiding timing channels in fixed-priority schedulers
A practically feasible modification to fixed-priority schedulers allows to avoid timing channels despite threads having access to precise clocks. This modification is rather simpl...
Marcus Völp, Claude-Joachim Hamann, Hermann H...
CCS
2008
ACM
13 years 6 months ago
Controlled privacy preserving keyword search
Data sharing on public servers has become a popular service on the Internet, in which users can store and share data with other users through public servers. However, because the ...
Stephen S. Yau, Yin Yin
CCS
2008
ACM
13 years 6 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...
CCS
2008
ACM
13 years 6 months ago
Provably secure browser-based user-aware mutual authentication over TLS
The standard solution for user authentication on the Web is to establish a TLS-based secure channel in server authenticated mode and run a protocol on top of TLS where the user en...
Sebastian Gajek, Mark Manulis, Ahmad-Reza Sadeghi,...
CCS
2008
ACM
13 years 6 months ago
A general model of probabilistic packet marking for IP traceback
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
Liming Lu, Mun Choon Chan, Ee-Chien Chang
CCS
2008
ACM
13 years 6 months ago
Securing group key exchange against strong corruptions
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...
Emmanuel Bresson, Mark Manulis