Sciweavers

96 search results - page 5 / 20
» Covert Multi-Party Computation
Sort
View
SAC
2009
ACM
14 years 2 months ago
On the practical importance of communication complexity for secure multi-party computation protocols
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
Florian Kerschbaum, Daniel Dahlmeier, Axel Schr&ou...
CCS
2007
ACM
14 years 1 months ago
Detecting covert timing channels: an entropy-based approach
The detection of covert timing channels is of increasing interest in light of recent practice on the exploitation of covert timing channels over the Internet. However, due to the ...
Steven Gianvecchio, Haining Wang
COMSUR
2007
101views more  COMSUR 2007»
13 years 7 months ago
A survey of covert channels and countermeasures in computer network protocols
Covert channels are used for the secret transfer of information. Encryption only protects communication from being decoded by unauthorised parties, whereas covert channels aim to ...
Sebastian Zander, Grenville J. Armitage, Philip Br...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 6 days ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
LCN
2008
IEEE
14 years 1 months ago
Covert channels in multiplayer first person shooter online games
Abstract—Covert channels aim to hide the existence of communication between two or more parties. Such channels typically utilise pre-existing (overt) data transmissions to carry ...
Sebastian Zander, Grenville J. Armitage, Philip Br...