Sciweavers

6861 search results - page 242 / 1373
» Security for Ubiquitous Computing
Sort
View
ISPEC
2010
Springer
15 years 11 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson
WMCSA
2003
IEEE
15 years 11 months ago
Proximity Mining: Finding Proximity using Sensor Data History
Emerging ubiquitous and pervasive computing applications often need to know where things are physically located. To meet this need, many locationsensing systems have been develope...
Toshihiro Takada, Satoshi Kurihara, Toshio Hirotsu...
FTDCS
2004
IEEE
15 years 9 months ago
An Architectural View of the Entities Required for Execution of Task in Pervasive Space
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide an user the transparency of anywhere, anyplace, anytime computing. Pervasive comp...
K. Kalapriya, S. K. Nandy, V. Satish, R. Uma Mahes...
ICDCS
2008
IEEE
16 years 7 days ago
Updates and Asynchronous Communication in Trusted Computing Systems
Software-based usage controls typically are vulnerable to attacks. Trusted Platform Modules (TPMs) can enable much more robust controls. However, as conventionally understood, TPM...
José Carlos Brustoloni, David Kyle
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
15 years 11 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai