Sciweavers

241 search results - page 34 / 49
» On Proactive Secret Sharing Schemes
Sort
View
ACISP
1999
Springer
14 years 28 days ago
Changing Thresholds in the Absence of Secure Channels
The ways the threshold parameter can be modified after the setup of a secret sharing scheme is the main theme of this work. The considerations are limited to the case when there ...
Keith M. Martin, Josef Pieprzyk, Reihaneh Safavi-N...
TDSC
2008
121views more  TDSC 2008»
13 years 8 months ago
Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission
In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and are loaded on the sensors pri...
Jing Deng, Yunghsiang S. Han
CCS
2009
ACM
14 years 9 months ago
PBES: a policy based encryption system with application to data sharing in the power grid
In distributed systems users need the ability to share sensitive content with multiple other recipients based on their ability to satisfy arbitrary policies. One such system is el...
Rakeshbabu Bobba, Himanshu Khurana, Musab AlTurki,...
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
14 years 22 days ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
DCC
2010
IEEE
13 years 8 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park