Sciweavers

1923 search results - page 14 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
IEEEARES
2007
IEEE
14 years 2 months ago
Agent Alliances: A Means for Practical Threshold Signature
In [7] we have proposed a model for the robust and private evaluation of a function within a group of cooperating mobile agents, called an agent Alliance. The model has been given...
Regine Endsuleit, Christoph Amma
PKC
2004
Springer
146views Cryptology» more  PKC 2004»
14 years 1 months ago
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
Huafei Zhu
ICPPW
2003
IEEE
14 years 1 months ago
Security Aspects of Wireless Heterogeneous Databases - Protocol, Performance, and Energy Analysis
Users have been demanding information “anytime, anywhere”. The notion of accessing diverse and autonomous information repositories with different APIs is not accepted. This ha...
Harshal Haridas, Ali R. Hurson, Yu Jiao
GSEM
2004
Springer
14 years 1 months ago
Enhancing Java Grid Computing Security with Resource Control
Abstract. This paper outlines an original Computational Grid deployment protocol which is entirely based on Java, leveraging the portability of this language for distributing custo...
Jarle Hulaas, Walter Binder, Giovanna Di Marzo Ser...
COLT
2000
Springer
14 years 24 days ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon