662 reputation
311
bio website
location
age
visits member for 3 years, 3 months
seen yesterday

1d
comment Is there an “additive” proof-of-work?
The proposal has some merits, but fails to satisfy the requeriments in several aspects: the proof size is unbounded, as long as the graph expands. Also the additive propery is lost when a new graph needs to be created, since you need to verify all previous graphs. Last, it would be very hard to set the difficulty increments in such a way that every increment corresponds to a predefined work.
2d
asked Is there an “additive” proof-of-work?
Aug
3
awarded  Yearling
Jul
2
awarded  Curious
Jun
22
awarded  Popular Question
Apr
11
revised Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
deleted 4 characters in body
Apr
11
comment Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
@poncho: If the problem is easy, then my question is meaningless.
Apr
10
revised Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
Previous question was not exactly was I was looking for
Apr
10
asked Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
Apr
8
comment Is there a malleable pubkey digital signature scheme?
Corrected. Are there more trivial solutions?
Apr
8
revised Is there a malleable pubkey digital signature scheme?
added 1 characters in body
Apr
8
revised Is there a malleable pubkey digital signature scheme?
added 1 characters in body
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?