Sciweavers

241 search results - page 36 / 49
» On Proactive Secret Sharing Schemes
Sort
View
EUROCRYPT
2004
Springer
14 years 2 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 8 months ago
Distributed Rate Allocation Policies for Multi-Homed Video Streaming over Heterogeneous Access Networks
We consider the problem of rate allocation among multiple simultaneous video streams sharing multiple heterogeneous access networks. We develop and evaluate an analytical framework...
Xiaoqing Zhu, Piyush Agrawal, Jatinder Pal Singh, ...
ITNG
2007
IEEE
14 years 2 months ago
Securing MPLS Networks with Multi-path Routing
— MPLS security is an evolving issue which has been raised by many researchers and service providers. The basic architecture of MPLS network does not provide security services su...
Sahel Alouneh, Abdeslam En-Nouaary, Anjali Agarwal
SASN
2006
ACM
14 years 2 months ago
Location-aware key predistribution scheme for wide area wireless sensor networks
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...
Katerina Simonova, Alan C. H. Ling, Xiaoyang Sean ...
ASIACRYPT
2010
Springer
13 years 6 months ago
Constant-Size Commitments to Polynomials and Their Applications
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg