Abstract. Online/Offline signcryption is a cryptographic primitive where the signcryption process is divided into two phases- online and offline phase. Most of the computations are carried out offline (where the message and the receiver identity are unavailable). The online phase does not require

compromise the security of the users. Online/offline have two parts, first the computationally heavy part(offline) of the cryptosystem and then the main "online" algorithm for use on resource constrained devices. The heavy computations are done in the offline phase on a more powerful device. Hence

encryption scheme proposed in ACNS 09 by Liu et al. [7]. The scheme in [7] is the first identity based online offline encryption scheme in the random oracle model, in which the message and recipient are not known during the offline phase. We show that this scheme is not CCA secure. We show the weakness

We review the field of offline cursive word recognition. We mainly deal with the various methods that were proposed to realize the core of recognition in a word recognition system. These methods are discussed in view of the two most important properties of such a system: the size and nature

This paper describes a method for the detection of phases in time-series data. The specific application considered is time-series data which describes an execution profile of a parallel program. The algorithm is described and examples are presented. This paper presents the problem in the broader

time soon. We construct a WE scheme where encryption is done by simply computing a Naor-Yung ciphertext (two CPA encryptions and a NIZK proof). To achieve this, our scheme has a setup phase, which outputs public parameters containing an obfuscated circuit (only required for decryption), two encryption

Based on Henglein’s efficient binding-time analysis for the lambda calculus (with constants and “fix”) [Hen91], we develop four efficient analyses for use in the preprocessing phase of Similix, a self-applicable partial evaluator for a higher-order subset of Scheme. The analyses developed

We describe a computer program which is able to estimate the tempo and the times of musical beats in expressively performed music. The input data may be either digital audio or a symbolic representation of music such as MIDI. The data is processed off-line to detect the salient rhythmic events

Knowledge compilation has been emerging recently as a new direction of research for dealing with the computational intractability of general propositional reasoning. According to this approach, the reasoning process is split into two phases: an off-line compilation phase and an online query

systems with output estimation. A so called offline/online decomposition is the key for efficient simulation: In the offline phase, one prepares the reduced basis and auxiliary parameter-independent quantities. These preparations allow rapid online simulations for varying parameters. The possibly