[cryptography] Practical Threshold Signatures

2013-11-12 Thread realcr
Hi, I recently read the article Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme, written by Alexandra Boldyreva. Link can be found here: https://www.iacr.org/archive/pkc2003/25670031/25670031.pdf. (Note: If you are going to read

Re: [cryptography] Practical Threshold Signatures

2013-11-12 Thread realcr
Hey. I want to thank everyone for the helpful answers. They were very interesting to read. From what I understand, the group I'm looking for is an elliptic cure with a weil pairing. (Jonathan mentioned bilinear map, I assume that means the same thing?) The C code for the Pairing based cryptography

Re: [cryptography] The Wandering Music Band

2015-01-08 Thread realcr
calculations. The naive solution proposed in my first message will still outperform the most efficient Bitcoin based solution. (Because it is O(log(n)) network complexity). On Thu, Jan 8, 2015 at 1:12 PM, Natanael natanae...@gmail.com wrote: Den 8 jan 2015 11:54 skrev realcr rea...@gmail.com: Hey

Re: [cryptography] The Wandering Music Band

2015-01-07 Thread realcr
Hey Natanael, Thanks for your response. It's the chain of signatures always published in an accessible way so that the original members can't doublespend and claim to be the task group? Otherwise the blockchain approach is useful for you. I think the naive solution I proposed in my first

Re: [cryptography] The Wandering Music Band

2015-01-08 Thread realcr
Hey, thanks again for the reply. The only notable difference is that in my version you are checkpointing the change in th blockchain. You still have the very same form of signing, but you sign a slightly different message (transfer of a colored coin, one Satoshi worth of Bitcoin, to a new

Re: [cryptography] The Wandering Music Band

2015-01-08 Thread realcr
MESSAGE- Hash: SHA256 On 08/01/15 07:03, realcr wrote: I think the naive solution I proposed in my first message is more efficient than using Bitcoin, because it does not involve proof of work or flooding stuff. Shortly: Whenever a person is added to the band, all the members sign

Re: [cryptography] The Wandering Music Band

2015-01-08 Thread realcr
Sorry, I should've read your formulation more carefully. Don't worry about it :) We wrote lots of stuff since the first message, it's hard to trace it back to the original message. @Natanael: I think I understand now that our different opinions are due to different concepts of adversarial

Re: [cryptography] The Wandering Music Band

2015-01-07 Thread realcr
Horsfall wrote: On Wed, 7 Jan 2015, realcr wrote: I am looking for some crypto primitive to solve a problem I have. [...] I guess, if it is really a band application as opposed to something more abstract, it boils down to what you mean by descendants. At least one founding member left

[cryptography] The Wandering Music Band

2015-01-07 Thread realcr
Hi, I am looking for some crypto primitive to solve a problem I have. Assume that I meet a group of people. call it S. I get to talk to them a bit, and then they are gone. This group of people walk together in the world. Sometimes they add a person to their group, and sometimes they remove one

[cryptography] Fwd: The Wandering Music Band

2015-12-10 Thread realcr
at its core on a special form of trusted entity called the supernode. In addition to its ability to manage payments, the supernode should allow to securely exchange computation and storage services for money. real. -- Forwarded message -- From: realcr <rea...@gmail.com> Dat