Commit Graph
11 Commits
Author SHA1 Message Date
Tim Ruffing ad1eba008c Update bip-schnorr.mediawiki 2019-12-14 22:11:47 +01:00
Tim Ruffing ff2b53737c Mention that we don't change the hash function 2019-12-13 12:11:50 +01:00
Tim Ruffing 92582c2a33 Clarify why we don't want short hashes
This is supposed to supersede https://github.com/sipa/bips/pull/158.
I tried to say this carefully. I don't think that multiparty signing is in general broken with short hashes. For example the attack in #158 could be avoided by letting everybody not only commit to the nonce but also to the message. It's just that using a collision-resistant hash just eliminates the problem entirely...
2019-12-12 22:49:21 +01:00
Tim Ruffing db1973ffba improve rationale for key prefixing 2019-10-30 01:32:07 +01:00
Tim Ruffing 73b8e3aeeb typos 2019-10-30 01:27:26 +01:00
Tim Ruffing 0176ed1871 Change reference for ECDSA proofs
Refer to Manuel Fersch's dissertation for provable security of ECDSA. It's freely accessible and multiple results put well in context.
2019-10-21 13:27:59 +02:00
Tim Ruffing 2d9877e6e1 bip-schnorr: more on (e,s) 2019-10-15 17:26:45 -07:00
Tim Ruffing e139975eff bip-schnorr: more on provable security
I'll try to get a link to the CCS paper that does not have a paywall...
2019-10-15 16:02:09 -07:00
Tim Ruffing 3f61b2b1e7 Link to Schnorr's paper instead of Wikipedia 2019-10-03 11:21:24 +02:00
Tim Ruffing 4a383064fb Add a footnote about 32-byte security 2019-09-08 16:38:55 +02:00
Tim Ruffing 6d99e45126 Rework Applications section 2019-09-08 16:38:15 +02:00