meta user
network profile
| bio | website | people.scs.carleton.ca/~clark |
|---|---|---|
| location | Ottawa, Canada | |
| age | 32 | |
| visits | member for | 1 year, 10 months |
| seen | May 16 at 13:24 | |
| stats | profile views | 103 |
Postdoctoral fellow interested in authentication and cryptographic voting.
|
Mar 7 |
answered | RSA-OAEP versus RSA with Fujisaki-Okamoto construction |
|
Feb 22 |
revised |
Threshold Signatures for RSA and DSA added 220 characters in body |
|
Feb 15 |
revised |
Is there some way to generate a non-predictable random number in a decentralised network? added 17 characters in body |
|
Feb 15 |
answered | Is there some way to generate a non-predictable random number in a decentralised network? |
|
Feb 14 |
comment |
Threshold Signatures for RSA and DSA Thanks. I am thinking of an offline/infrequent signing scenario like issuing SSL/TLS certificates, transaction signing in Bitcoin, code signing in Android, etc. |
|
Feb 14 |
comment |
Threshold Signatures for RSA and DSA Thanks. That gives the secret sharing / reconstruction portion. I think the challenge with RSA is more in distributively generating a proper $n$ and $\phi{n}$ without anyone learning $p$ and $q$. |
|
Feb 13 |
asked | Threshold Signatures for RSA and DSA |
|
Feb 3 |
comment |
What type of hash functions provides non-malleability of hash digests? I think so. It is sort of a deterministic version of $\mathcal{H}(r\|\mathcal{H}(m))$ or $\mathcal{H}(r_2\|\mathcal{H}(r_1\|m))$ which have been studied in designing message authentication codes. Once again, it isn't provably non-malleable, but in practice should eliminate the length-extension attack. |
|
Feb 3 |
comment |
Why RSA encryption key is based on modulo(phi(n)) rather than modulo n Thanks. I see why it was incorrect before. |
|
Feb 2 |
revised |
commitments wiki description added 658 characters in body |
|
Feb 2 |
suggested | suggested edit on commitments tag wiki excerpt |
|
Feb 2 |
suggested | suggested edit on commitments tag wiki |
|
Feb 2 |
wiki | created commitments description |
|
Feb 2 |
revised |
Is there a cumulative commitment scheme? edited tags |
|
Feb 2 |
revised |
What type of hash functions provides non-malleability of hash digests? edited tags |
|
Feb 2 |
answered | What type of hash functions provides non-malleability of hash digests? |
|
Feb 1 |
answered | Why RSA encryption key is based on modulo(phi(n)) rather than modulo n |
|
Jan 30 |
answered | Are there two known strings which have the same MD5 hash value? |
|
Jan 30 |
comment |
Salts, how does the script know what the salt is? Thanks @Paulo and @Thomas; good points. I fixed my answer. |
|
Jan 30 |
revised |
Salts, how does the script know what the salt is? added 36 characters in body |
