Sciweavers

1134 search results - page 85 / 227
» Distributed Proving in Access-Control Systems
Sort
View
CSFW
1999
IEEE
15 years 7 months ago
I/O Automaton Models and Proofs for Shared-Key Communication Systems
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
Nancy A. Lynch
CODASPY
2012
13 years 11 months ago
Towards end-to-end secure content storage and delivery with public cloud
Recent years have witnessed the trend of leveraging cloudbased services for large scale content storage, processing, and distribution. Security and privacy are among top concerns ...
Huijun Xiong, Xinwen Zhang, Danfeng Yao, Xiaoxin W...
HICSS
2003
IEEE
126views Biometrics» more  HICSS 2003»
15 years 8 months ago
A Watermarking Infrastructure for Enterprise Document Management
Digital watermarking is a promising technology to embed copyright information as unperceivable signals in digital contents. Although various watermarking techniques have been empl...
Shing-Chi Cheung, Dickson K. W. Chiu
IPPS
2009
IEEE
15 years 10 months ago
Performance prediction for running workflows under role-based authorization mechanisms
When investigating the performance of running scientific/ commercial workflows in parallel and distributed systems, we often take into account only the resources allocated to the ...
Ligang He, Mark Calleja, Mark Hayes, Stephen A. Ja...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 4 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...