Sciweavers

3608 search results - page 146 / 722
» computing 2011
Sort
View
EUROCRYPT
2011
Springer
14 years 10 months ago
Semi-homomorphic Encryption and Multiparty Computation
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
Rikke Bendlin, Ivan Damgård, Claudio Orlandi...
CORR
2011
Springer
194views Education» more  CORR 2011»
15 years 1 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
DCC
2011
IEEE
15 years 1 months ago
Computing bilinear pairings on elliptic curves with automorphisms
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei...
CHI
2011
ACM
14 years 10 months ago
Computing political preference among twitter followers
Through anecdotal evidence and a variety of methods, claims are constantly being made about the bias of media outlets. As many of those outlets create online personas, we seek to ...
Jennifer Golbeck, Derek L. Hansen
PERCOM
2011
ACM
14 years 9 months ago
Ubiquitous cloud: Managing service resources for adaptive ubiquitous computing
Abstract—The adaptive ubiquitous services, which dynamically adapt behaviors to requirements and contexts, are one of the major challenges in the ubiquitous computing. To facilit...
Koichi Egami, Shinsuke Matsumoto, Masahide Nakamur...