[137275] in cryptography@c2.net mail archive
Re: voting by m of n digital signature?
daemon@ATHENA.MIT.EDU (dan@geer.org)
Mon Nov 10 14:07:46 2008
From: dan@geer.org
To: "James A. Donald" <jamesd@echeque.com>
cc: cryptography@metzdowd.com
In-Reply-To: Your message of "Sun, 09 Nov 2008 19:19:10 +1000."
<4916AB0E.4000108@echeque.com>
Date: Sun, 09 Nov 2008 14:56:27 -0500
"James A. Donald" writes:
-+-----------------------
| Is there a way of constructing a digital signature so
| that the signature proves that at least m possessors of
| secret keys corresponding to n public keys signed, for n
| a dozen or less, without revealing how many more than m,
| or which ones signed?
|
quorum threshhold crypto; if Avishai Wool or Moti Yung
or Yvo Desmedt or Yair Frankel or... are here on this
list, they should answer
a *tiny* contribution on my part
http://geer.tinho.net/geer.yung.pdf
humbly,
--dan
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
