Sciweavers

1770 search results - page 271 / 354
» Writing requirements in computer security
Sort
View
MOBIHOC
2007
ACM
14 years 9 months ago
A random perturbation-based scheme for pairwise key establishment in sensor networks
A prerequisite for secure communications between two sensor nodes is that these nodes exclusively share a pairwise key. Although numerous pairwise key establishment (PKE) schemes ...
Wensheng Zhang, Minh Tran, Sencun Zhu, Guohong Cao
ICPADS
2005
IEEE
14 years 3 months ago
Separable and Anonymous Identity-Based Key Issuing
Abstract. In identity-based (ID-based) cryptosystems, a local registration authority (LRA) is responsible for authentication of users while the key generation center (KGC) is respo...
Ai Fen Sui, Sherman S. M. Chow, Lucas Chi Kwong Hu...
GECON
2007
Springer
124views Business» more  GECON 2007»
14 years 4 months ago
On Business Grid Demands and Approaches
This paper addresses necessary modification and extensions of existing Grid Computing approaches in order to meet nowadays business demand. So far, Grid Computing has been used to...
Carsten Franke, Adolf Hohl, Philip Robinson, Bernd...
SAC
2004
ACM
14 years 3 months ago
Trust enhanced ubiquitous payment without too much privacy loss
Computational models of trust have been proposed for use in ubicomp environments for deciding whether to allow customers to pay with an e-purse or not. In order to build trust in ...
Jean-Marc Seigneur, Christian Damsgaard Jensen
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 10 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs