Sciweavers

852 search results - page 170 / 171
» Small Active Counters
Sort
View
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
13 years 2 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
SPAA
2012
ACM
13 years 2 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
EUROSYS
2006
ACM
15 years 8 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...
ICC
2007
IEEE
186views Communications» more  ICC 2007»
15 years 6 months ago
An Efficient Cluster-Based Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
Ying Dong, Ai Fen Sui, Siu-Ming Yiu, Victor O. K. ...
ALMOB
2008
127views more  ALMOB 2008»
14 years 11 months ago
HuMiTar: A sequence-based method for prediction of human microRNA targets
Background: MicroRNAs (miRs) are small noncoding RNAs that bind to complementary/partially complementary sites in the 3' untranslated regions of target genes to regulate prot...
Jishou Ruan, Hanzhe Chen, Lukasz A. Kurgan, Ke Che...