Normally, when registering your public address, anyone can check all incoming transactions even if they are hidden behind a circular signature. To avoid the connection it is possible to create hundreds of keys and send them to your taxpayers in private, but this would deprive us of the convenience of having a single public address.
Dinastycoin solves this dilemma by automatically creating multiple unique keys, derived from the unique public key, for each p2p payment. The solution consists in an intelligent modification of the Diffie-Hellman exchange protocol . Originally, two parties are allowed to produce a common secret key derived from their public key. In our version the sender uses the recipient’s public address and their own random data to calculate a one-time payment key.
The sender can only produce the public part of the key, while only the receiver can compute the private part; therefore the receiver is the only one who can release the funds after the transaction has been committed. Eventually he needs to run a single-formula check on each transaction to determine if it belongs to him. This process involves the use of its private key, so no third party will be able to perform this check and discover the link between the one-time key generated by the sender and the recipient’s only public address.
An important part of our protocol is the sender’s use of random data. There One-Time key it will always be unique even if the sender and the recipient remain the same for all operations (that’s why the key is called “one-time”). Also, even if they are both the same person, all One-time keys will always be absolutely unique.
Non traceable payments
 Whitfield Diffie and Martin Hellman. New directions in cryptography. IEEE Transactions on Information Theory 22 (6): 644-654, 1976.