Sciweavers

278 search results - page 11 / 56
» Variants of Spreading Messages
Sort
View
PKC
2009
Springer
115views Cryptology» more  PKC 2009»
14 years 8 months ago
Compact CCA-Secure Encryption for Messages of Arbitrary Length
This paper proposes a chosen-ciphertext secure variant of the ElGamal public-key encryption scheme which generates very compact ciphertexts for messages of arbitrary length. The ci...
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto
PSC
1992
13 years 11 months ago
A Message Passing Implementation of Lazy Task Creation
Abstract. This paper describes an implementation technique for Multilisp's future construct aimed at large shared-memory multiprocessors. The technique is a variant of lazy ta...
Marc Feeley
TPDS
1998
108views more  TPDS 1998»
13 years 7 months ago
Critical Path Profiling of Message Passing and Shared-Memory Programs
—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our...
Jeffrey K. Hollingsworth
IVCNZ
1998
13 years 9 months ago
Image Capture Modelling for High Resolution Reconstruction
: A research topic that has been receiving much interest recently is the reconstruction of a high resolution image from an ensemble of low resolution images of the same scene. Such...
D. G. Bailey
IPCCC
2007
IEEE
14 years 1 months ago
Understanding Localized-Scanning Worms
— Localized scanning is a simple technique used by attackers to search for vulnerable hosts. Localized scanning trades off between the local and the global search of vulnerable h...
Zesheng Chen, Chao Chen, Chuanyi Ji