Sciweavers

110 search results - page 20 / 22
» Patterson-Wiedemann construction revisited
Sort
View
CCS
2008
ACM
13 years 9 months ago
Multi-use unidirectional proxy re-signatures
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
Benoît Libert, Damien Vergnaud
EUROCRYPT
2009
Springer
14 years 8 months ago
Asymmetric Group Key Agreement
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish...
Qianhong Wu, Yi Mu, Willy Susilo, Bo Qin, Josep Do...
SENSYS
2003
ACM
14 years 22 days ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 10 days ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
SCS
2004
13 years 8 months ago
The HEAT/ACT Preliminary Safety Case: A case study in the use of Goal Structuring Notation
The HEAT/ACT project consists of replacing the conventional mechanical flight control system of a helicopter with a fly-by-wire system. With such a project, the safety concerns ar...
Paul Chinneck, David Pumfrey, John McDermid