21 reputation
3
bio website
location
age
visits member for 1 year
seen Oct 10 '13 at 9:18

Oct
10
comment Blind Signatures
Yes, am designing a blind signature based on DL. I have parameters which are computed later. So verification of blind signature was not possible before unblinding.
Oct
10
comment Blind Signatures
And one more question. I have a verification algorithm that takes in parameter which are computed after unblinding. And it is quite impossible for me to verify the blinded message and it's signature. Do you think there is any alternative solution to this problem??
Oct
10
comment Blind Signatures
To ensure that the signer is not any adversary, and has produced the sign using the actual signing algorithm.
Aug
6
comment Finite fields in elliptic curve
@minar Problem is that am trying to bring out without using pairing.
Aug
5
comment Finite fields in elliptic curve
I am working with discrete logarithm problem. Currently am constructing a signature scheme where one of my signature component is in terms of like $S_1=aP$ and the verification algorithm so far which I have come out with has $S_1P=$some value. Is that possible(Since $S_1$ will be a group element) or in case if you have faced any such moments, do you have any idea about it's alternative solution.