Sciweavers

686 search results - page 79 / 138
» Secure Two-Party Computation Is Practical
Sort
View
COMPUTER
1999
95views more  COMPUTER 1999»
13 years 9 months ago
Wide-Area Computing: Resource Sharing on a Large Scale
abstract over a complex set of resources and provide a high-level way to share and manage them over the network. To be effective, such a system must address the challenges posed by...
Andrew S. Grimshaw, Adam Ferrari, Frederick Knabe,...
TCC
2012
Springer
240views Cryptology» more  TCC 2012»
12 years 5 months ago
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohe...
CCS
2008
ACM
14 years 2 hour 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
2007
ACM
14 years 4 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
WS
2005
ACM
14 years 3 months ago
Group-based key pre-distribution in wireless sensor networks
Many key pre-distribution techniques have been developed recently to establish pairwise keys for wireless sensor networks. To further improve these schemes, researchers have propo...
Donggang Liu, Peng Ning, Wenliang Du