A Tool for Implementing Privacy in Nano

  title={A Tool for Implementing Privacy in Nano},
  author={Rui Morais and Paul Andrew Crocker and Sim{\~a}o Melo de Sousa},
  journal={2020 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)},
  • Rui Morais, P. Crocker, S. Sousa
  • Published 1 August 2020
  • Computer Science
  • 2020 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)
We present a work in progress strategy for implementing privacy in Nano at the consensus level, that can be of independent interest. Nano is a cryptocurrency that uses an Open Representative Voting (ORV) as a consensus mechanism, a variant of Delegated Proof of Stake. Each transaction on the network is voted on by representatives and each vote has a weight equal to the percentage of their total delegated balance. Every account can delegate their stake to any other account (including itself) and… Expand
1 Citations

Figures, Tables, and Topics from this paper

A Secure and Effective Construction Scheme for Blockchain Networks
A secure and effective construction scheme for blockchain networks to improve performance and address the effective management concerns of blockchain data based on transaction categories is proposed. Expand


A practical scheme for non-interactive verifiable secret sharing
  • Paul Feldman
  • Computer Science
  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing, which provides asynchronous networks with a constant-round simulation of simultaneous broadcast networks whenever even a bare majority of processors are good. Expand
CryptoNote v 2.0
“Bitcoin” [1] has been a successful implementation of the concept of p2p electronic cash. Both professionals and the general public have come to appreciate the convenient combination of publicExpand
Polynomial Commitments
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial with a shortExpand
Constructing Ideal Secret Sharing Schemes based on Chinese Remainder Theorem
A generalized (t, n)-threshold SS scheme based on the CRT for polynomial ring over a finite field is proposed and it is proved that Shamir’s scheme, which isbased on the Lagrange interpolation, is a special case of this scheme. Expand
Zerocash: Decentralized Anonymous Payments from Bitcoin
This paper formulate and construct decentralized anonymous payment schemes (DAP schemes) and builds Zero cash, a practical instantiation of the DAP scheme construction that is orders of magnitude more efficient than the less-anonymous Zero coin and competitive with plain Bit coin. Expand
Message mapping and reverse mapping in elliptic curve cryptosystem
This paper discusses the different schemes of message mapping in elliptic curve cryptosystem, the flaws of each method, and how vulnerable they are to cryptanalysis, and derive the guidelines of a good message mapping scheme. Expand
An Efficient Solution to the Millionaires' Problem Based on Homomorphic Encryption
A two-round protocol for solving the Millionaires' Problem in the setting of semi-honest parties using either multiplicative or additive homomorphic encryptions, which is more efficient than an additive one practically. Expand
Nano : A Feeless Distributed Cryptocurrency Network
Recently, high demand and limited scalability have increased the average transaction times and fees in popular cryptocurrencies, yielding an unsatisfactory experience. Here we introduce Nano, aExpand
A Survey of Distributed Consensus Protocols for Blockchain Networks
This survey will provide blockchain developers and researchers a comprehensive view on the state-of-the-art consensus protocols and facilitate the process of designing future protocols. Expand
How to share a secret
This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces. Expand