The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The existing provably secure threshold decryption schemes based on the Lagrange interpolation can only be applied to the (t, n) threshold structure. The first provably secure identity-based threshold decryption scheme on access structure is proposed, in which the PKG gets the adversary structure from the access structure, and then according to the adversary structure, the PKG ingeniously distributes...
In this paper, an efficient robust text digital watermarking algorithm is proposed based on watermark fragments regrouping strategy. To enhance watermark robustness, the original watermark is divided into several ordered fragments with an order number firstly, and then these fragments are embedded into document characters redundantly. When some fragments are missed or changed by deleting and tamper...
Uncertainty is the pseudonym for many unfavorable effects in both wired and wireless communications. When uncertainty presents itself, a receiver suffers from information loss and communication efficiency is limited. Moreover, an adversary eavesdropping on the communication also faces inevitable information loss. This information loss can be utilized by legitimate users for security purposes. In this...
Internet now a day, is one of the most popular mode of communications, and its popularity suffers from a vital issue of not supporting the security of the confidential data during transmission. In this work, a high-speed cryptosystem for image data has been developed for efficient and secured communication over Internet. The basic idea is that the given image is first compressed by VQ for traffic...
We survey the literature for access control schemes in a user hierarchy. Some schemes have already been shown to be insecure or incorrect. Many schemes assume very restrictive subordinating relationships existing in a hierarchy where users are grouped into partially ordered relationships without taking resources into consideration. We believe that a practical access control scheme should support access...
Rivest, Shamir and Adleman (RSA) encryption algorithm is one of the most widely used and popular public-key cryptosystem. The main step in this algorithm is modular exponentiation which can be done by a sequence of modular multiplication. Thus, modular multiplication is the major factor, in many cryptosystems, e.g. the RSA Two-Key system and in the proposed digital signature standard DSS. One of the...
We consider the problem of clandestine communications, i.e., communications that are meant to be invisible to third-party eavesdroppers, in the context of wireless sensor networks. Although encryption and anonymous routing protocols can hide the content and the routing information, the transmission activities of sensors on the same route can still reveal the information flow. In this work, a perfectly...
Agent is a computer software procedure, it works in the dynamic environment and has the high autonomous ability, but also it has many merits: the independency, the cooperation, the adaptability to the tendency and the flexibility of the environment, the reduction of correspondence expenses and the support for fault-tolerant and so on. Time limited blackbox algorithm can not protect input and output...
In this paper, we propose a simple digital image watermarking algorithm, which can embed the watermark image blocks into the host image based on their blocks similarity coefficient. In the proposed scheme, both of watermark image and host image are divided into image blocks of size 8-by-8, and similarity coefficients between watermark image blocks and host image blocks are computed. Each watermark...
This paper discusses the predictability of the sequence given by outputing a constant proportion α of the leading bits of the numbers produced by a linear congruential generator. First, we make the assumption that the modulus of the generator is the only known parameter and we prove that, almost surely, a significant proportion of the bits can be predicted from the previous ones, once the generator...
We explicitly construct, for every integer n and ε ≫ 0, a family of functions (psuedo-random bit generators) fn,ε:{0,1}nε → {0,1}n with the following property: for a random seed, the pseudorandom output "looks random" to any polynomial size, constant depth, unbounded fan-in circuit. Moreover, the functions fn,ε themselves can be computed by uniform polynomial size, constant depth circuits...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.