[137610] in cryptography@c2.net mail archive
Re: voting by m of n digital signature?
daemon@ATHENA.MIT.EDU (Florian Weimer)
Fri Nov 14 17:30:27 2008
From: Florian Weimer <fw@deneb.enyo.de>
To: "James A. Donald" <jamesd@echeque.com>
Cc: cryptography@metzdowd.com
Date: Fri, 14 Nov 2008 23:16:14 +0100
In-Reply-To: <4916AB0E.4000108@echeque.com> (James A. Donald's message of
"Sun, 09 Nov 2008 19:19:10 +1000")
* James A. Donald:
> 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?
What about this?
Christian Cachin, Asad Samar
Secure Distributed DNS
<http://www.zurich.ibm.com/security/dti/#dnsrepl>
Or do you require that potential signers must not be able to prove
that they signed?
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
