Comments by kaliprasad123

kaliprasad123 30-May-17 5:33am View

Hi Richard,

thanks for reply, that is the first thing that I did when I got the error. None has given the solution. After the user has logged off and log on it works as expected for short duration.

thanks
kaliprasad

kaliprasad123 30-May-17 5:17am View

hi Richard,

the link you provided clearly says that it has get and set.
double Width { get; set; }

any other suggestion?

kaliprasad123 30-May-17 2:53am View

hi Madhav,

I am pretty sure that the width is not read only because it works few times. I wonder how to implement _Application interface. Could you please write some code wrt to it.

kaliprasad123 30-May-17 1:21am View

I am sure it has width property, it works fine for few times, after few days the same line gives exception. Logging off and logging on to the system fixes issue temporarily.

kaliprasad123 29-Jul-16 15:30pm View

Hi,

Solution is in the C# and referring some dll

kaliprasad123 4-Mar-13 23:31pm View

i dint find ABE algorithm in there

kaliprasad123 24-Jan-13 6:34am View

THANKS FOR UR REPLY...

actually i am asking for in built class in c#..

if exists please give the full explanation of it... like namespace and class name....

kaliprasad123 20-Jan-13 23:02pm View

thanks for ur reply...

is KP-ABE or CP-ABE algorithm is built in class or just an algorithm...

can u pls give the reference link...

and one more think i want in C#

thnak you

kaliprasad123 19-Jan-13 0:06am View

thanks for ur reply...

short group signature is a algorithm, which generate the key pairs (public key and private key) and distribute to the group...

the group in here is the vehicles, these vehicle get the public key and encrypt the data like road condition, GPS position and send to the authority..

authority has all the private keys of the group, and if the authority try to keep on trying to decrypt using all the private keys, then it will consume more time...

so, the short group signature says that, within one decryption we should be able to decrypt the encrypted data and find the user who has encrypted it...

this is the scenario i am in...

please help to solve this problem...

here is the algorithm..

1. G1 aid G2 are two (multiplicative) cyclic groups of prime order p:
2. g1 is a generator of G1 and g2 is a generator of G2;
3. phi is a computable isomorphism from G2 to G1. with phi(g2) = g1;

and
4. e is a computable map e : G1 x G2 —> GT with the following

properties:
• Bilinearity: for all u belongs G1, v belongs G2 and a, b belongs Z,

e(u^a. v^b) = e(u, v)^ab.
• Non-degeneracy: e(g1, g2) != 1.

Comments by kaliprasad123 (Top 9 by date)