Sciweavers

32607 search results - page 6507 / 6522
» Supporting
Sort
View
PODC
2012
ACM
12 years 7 days ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
PODC
2012
ACM
12 years 7 days ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
12 years 7 days ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman
EUROCRYPT
2012
Springer
12 years 7 days ago
Fully Homomorphic Encryption with Polylog Overhead
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
Craig Gentry, Shai Halevi, Nigel P. Smart
ICDCS
2012
IEEE
12 years 7 days ago
G-COPSS: A Content Centric Communication Infrastructure for Gaming Applications
—With users increasingly focused on an online world, an emerging challenge for the network infrastructure is the need to support Massively Multiplayer Online Role Playing Games (...
Jiachen Chen, Mayutan Arumaithurai, Xiaoming Fu, K...
« Prev « First page 6507 / 6522 Last » Next »