Sciweavers

6861 search results - page 1340 / 1373
» Security for Ubiquitous Computing
Sort
View
SIGCOMM
2012
ACM
13 years 4 months ago
Abstractions for network update
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...
Mark Reitblatt, Nate Foster, Jennifer Rexford, Col...
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
13 years 4 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart
PODC
2009
ACM
16 years 2 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
NETGAMES
2006
ACM
15 years 8 months ago
Cheat detection for MMORPG on P2P environments
In recent years, MMORPG has become popular. In order to improve scalability of game system, several P2P-based architectures have been proposed. However, in P2P-based gaming archit...
Takato Izaiku, Shinya Yamamoto, Yoshihiro Murata, ...
ATVA
2009
Springer
100views Hardware» more  ATVA 2009»
15 years 8 months ago
Dynamic Observers for the Synthesis of Opaque Systems
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
Franck Cassez, Jérémy Dubreil, Herv&...
« Prev « First page 1340 / 1373 Last » Next »