Reputation
767
Top tag
Next privilege 1,000 Rep.
See votes, expandable usercard
Badges
3 14
Newest
 Nice Answer
Impact
~11k people reached

  • 0 posts edited
  • 1 helpful flag
  • 19 votes cast
Apr
8
comment Is there a malleable pubkey digital signature scheme?
OK. Now I have cleared my mind and I re-wrote the whole question. At least now I can be told it's impossible.
Apr
8
revised Is there a malleable pubkey digital signature scheme?
added 189 characters in body
Apr
8
comment Is there a malleable pubkey digital signature scheme?
Not seems to be related to multi-signatures. I try to build a signature which has plausible deniability: If I sign a document I can always claim it was signed by another unknown party, but still nobody can sign with my pubkey.
Apr
8
revised Is there a malleable pubkey digital signature scheme?
Add a more formal definition of the required property of malleable pubkey signatures
Apr
8
asked Is there a malleable pubkey digital signature scheme?
Feb
24
comment Attack against modular inversion operation using side-channels?
As stated in the question, the value to be inverted is not secret. The modulus factorization (and phi(m)) are the secret values, so using Fermat's Little Theorem makes inverting similar to an RSA private operation regarding timing attacks.
Jan
3
accepted Attack against modular inversion operation using side-channels?
Dec
24
accepted Is there a practical zero-knowledge proof for this special discrete log equation?
Dec
19
answered Attack against modular inversion operation using side-channels?
Dec
16
comment Attack against modular inversion operation using side-channels?
It seems that you solved the problem, while we still don't know if there is a problem or not. I'm sure that someone must have analyzed modinv side-channels in the past...
Dec
15
revised Attack against modular inversion operation using side-channels?
Added suggested clarifications
Dec
15
comment Attack against modular inversion operation using side-channels?
He may be able to measure computing time. He does not have access to the output nor to the modulus. He knows only the value that will be inverted.
Dec
15
accepted Can one use a Cryptographic Accumulator to efficiently store Lamport public keys without the need of a Merkle Tree?
Dec
15
asked Attack against modular inversion operation using side-channels?
Dec
10
answered Can one use a Cryptographic Accumulator to efficiently store Lamport public keys without the need of a Merkle Tree?
Dec
10
asked Can one use a Cryptographic Accumulator to efficiently store Lamport public keys without the need of a Merkle Tree?
Dec
10
accepted How hard is to invert the function that computes the middle-bits of (x^2)?
Dec
4
comment How hard is to invert the function that computes the middle-bits of (x^2)?
The brute-force attack is obviously a upper bound in the number of computations. It does not help me much to known how much time an attacker will require to invert it.
Dec
2
comment How hard is to invert the function that computes the middle-bits of (x^2)?
Also I'm interested in the number of logic gates it takes to implement the inversion circuit, as compared to the number of logic gates it takes to compute f.
Dec
2
asked How hard is to invert the function that computes the middle-bits of (x^2)?