Cash Online (Chaum's Anonymity)
Вставка
- Опубліковано 1 гру 2013
- First talk in a series on crypto currency, focusing on David Chaum's ingenious invention for paying anonymously on the Internet. We describe how digital payments happen without anonymity, and then we discuss the mechanism for blind signatures that guarantees the desired anonymity for any purchase on the Web.
- Наука та технологія
You are amazing. This is so perfectly analyzed
thank you very much , you are a good teacher !!
Your videos are very useful for me! Thank you so much!
This video was (digital) gold, thank you!
You just ended the video like a Cristopher Nolan film...I got the rest of that.
The video was really helpful.
Very simple explanation of blind signature, thanks a lot! I hope you're fine Mr. Samid
Thank you Selin, sorry for the late reply... Here is the latest with blind signatures: bitmint.com/BitMint_LeVeL_Pager1.pdf
Great info. looking for good options like this one.
That was awesome. Thanks for making me smarter
I appreciate you letting me know that a good impact is happening through these videos!
Hey there Mr. Samid. I've been watching some of your videos on digital currency and have already familiarized myself with the Bitcoin and Digicash systems. So far what I've gathered from your system (I haven't actually purchased your books yet or anything) that's novel is the emphasis on specifying precisely how money is to be used. This goal seems orthogonal to the purposes Bitcoin (decentralized and other "libertarian" concepts including a limited number of coins) and Digicash (anonymous transactions) emphasize. While you seem uninterested in Bitcoin, here you praise Digicash quite a bit, so I was just wondering if your BitMint system is going to incorporate its anonymous transaction properties or not.
Is there a part 2 to this video?
Hey! This is an excellent video, thank you so much, do you have another one explaining where does the trust come from in a blind signature scheme? I was wondering that.. please help us with it.
Thanks Victor. If I give you 1000 envelopes claiming that each contains $100 bill. You randomly select 999 envelopes, open them, and find a $100 in each. Then you can "blindly trust" that the one remaining envelope also contains $100.
@@GideonTheTeacher Thank you!!
Hi, how does Alice know which Serial Number she must use to have a unique No? You said thousands of Users came to the bank, there must be at least one double Serial No. The next thing is, I maybe don´t want to pay 100$ to the Merchant, but 50$, but I am only able to give him 100 Bucks. And if i like to implement this technique I need always a Internet Connection to send the Bank the signature. I can not use it twice, because Alice owns a copy of it.
Great Video, but I´m not convinced to use that algorithm in a daily use. Greetings
The serial number thing, in this video its taken as a simple assumption...in real time aplications they get serious.
As this paper was published in 80's its quite obvious that you're not convinced to use that algorithm in a daily use.
but a valid doubt would be how does the bank know that the amount to be transfered to the merchant is available in Alice's account. say, i generated a plain text x that says give $100 to merchant1 and make it blindly signatured by the bank and the merchant gets his 100 but this can happen even if there was less than 100 bucks in my account...but as for the first paper on digital currencies, its a fantastic paper.