Results 1 
4 of
4
A method for obtaining deniable publickey encryption
 International Journal of Network Security (IJNS), to appear. Journal of Network Security, Vol.8, No.2, PP.159–165
, 2009
"... Deniable encryption is an important notion that allows a user (a sender and/or a receiver) to escape a coercion attempted by a coercive adversary. Such an adversary approaches the coerced user after transmission forcing him to reveal all his random inputs used during encryption or decryption. Since ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Deniable encryption is an important notion that allows a user (a sender and/or a receiver) to escape a coercion attempted by a coercive adversary. Such an adversary approaches the coerced user after transmission forcing him to reveal all his random inputs used during encryption or decryption. Since traditional encryption schemes commits the user to his random inputs, the user is forced to reveal the true values of all his random inputs (including the encrypted/decrypted messages and the encryption/decryption keys) which are verifiable by this coercer using the intercepted ciphertext. In this scenario, a coercer may force the user to perform actions against his wish. In this paper we present a scheme for senderdeniable publickey encryption, by which, the sender is able to lie about the encrypted message to a coercer and hence, escape a coercion. While the receiver is able to decrypt for the true message, the sender has the ability to open a fake message of his choice to the coercer which when verified gives the same ciphertext as the true message. Our schemes rely on quadratic residuosity of a twoprime modulus. Deniability improvements to these schemes considering the sender’s local randomness are also presented. We also show how to build an efficient deniable publickey encryption from any trapdoor permutation. Compared to the schemes proposed in [5], our schemes require much less bandwidth, provide stronger deniability and no decryption errors.
RESEARCH ARTICLE ISSN 09764259 Use of Chinese Remainder Theorem to generate random numbers for
"... Random numbers are the numbers, which play an important role for various network security applications. hers are some techniques that are used to generating random numbers such as” pseudorandom number generator ” and “linear congruent generator ” also cryptographically generated random numbers ” etc ..."
Abstract
 Add to MetaCart
Random numbers are the numbers, which play an important role for various network security applications. hers are some techniques that are used to generating random numbers such as” pseudorandom number generator ” and “linear congruent generator ” also cryptographically generated random numbers ” etc. but here we are using the Chinese Reminder Theorem for the purpose of generating Random numbers. In essence, CRT says it is possible to reconstruct integers in a certain range from their residues modulo a set of pair wise relatively prime modulo.
True Random Number Generator using Fish Tank Image
"... A Pseudo Random Number Generator (PRNG) uses a deterministic system and an initial seed to generate random numbers. In order for the output sequence to be truly random, a truly random input seed is used. Most True Random Number Generators (TRNG), use noise in the form nuclear decay, atmospheric nois ..."
Abstract
 Add to MetaCart
A Pseudo Random Number Generator (PRNG) uses a deterministic system and an initial seed to generate random numbers. In order for the output sequence to be truly random, a truly random input seed is used. Most True Random Number Generators (TRNG), use noise in the form nuclear decay, atmospheric noise, electrical noise or Brownian motion as their initial seed. In order to reduce the computational complexity, we use a simple setup of a fish tank as the variable environment, capturing its images over time. The image data is then applied to a reduction algorithm and hash function to generate the initial seed. We propose a cost efficient method of extracting the true seed from the image data and applying it to a pseudo random generator, a Linear Congruential Generator (LCG) in our case to give true random numbers.