Download presentation
Presentation is loading. Please wait.
Published byDylan Brown Modified over 9 years ago
1
CryptoNote v 2.0 Nicolas van Saberhagen
2
One-time public keys © cryptonote.org Linkable transactions CryptoNote solves this problem by an automatic creation of multiple unique one-time keys, derived from the single public key, for each p2p payment.
3
Unlinkability For any two outgoing transactions it is impossible to prove they were sent to the same person. © cryptonote.org
4
Ring signatures Ordinary signature Ring signature © cryptonote.org
5
Untraceability For each incoming transaction all possible senders are equiprobable. © cryptonote.org
6
Blockchain analysis resistance © cryptonote.org The sender uses the receiver's public address and his own random data to compute a one-time key for the payment. As a result “Z” gets incoming payments, associated with one-time public keys which are unlinkable for a spectator.
7
Double-spending proof © cryptonote.org Key image via one-way function Double-spending check
8
CryptoNight (egalitarian proof-of-work algorithm) image from www.danielyeow.com/wp-content/uploads/votes1.png Our primary goal is to close the gap between CPU (majority) and GPU/FPGA/ASIC (minority) miners. 1 CPU = 1 vote
9
Thank you for your attention! www.cryptonote.org contact@cryptonote.org
Similar presentations
© 2025 SlidePlayer.com Inc.
All rights reserved.