Sciweavers

147 search results - page 7 / 30
» Robust Metering Schemes for General Access Structures
Sort
View
ASIACRYPT
2005
Springer
14 years 1 months ago
Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
Zhifang Zhang, Mulan Liu, Liangliang Xiao
CORR
2007
Springer
143views Education» more  CORR 2007»
13 years 7 months ago
On Myopic Sensing for Multi-Channel Opportunistic Access
We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert-Elli...
Qing Zhao, Bhaskar Krishnamachari, Keqin Liu
MOBICOM
2010
ACM
13 years 7 months ago
Exploiting temporal stability and low-rank structure for localization in mobile networks
Localization is a fundamental operation for many wireless networks. While GPS is widely used for location determination, it is unavailable in many environments either due to its h...
Swati Rallapalli, Lili Qiu, Yin Zhang, Yi-Chao Che...
SIROCCO
1998
13 years 8 months ago
The counting pyramid: an adaptive distributed counting scheme
A distributed counter is a concurrent object which provides a fetch-and-increment operation on a shared value. On the basis of a distributed counter, one can implement various fun...
Roger Wattenhofer, Peter Widmayer
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 11 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...