A Tool for Implementing Privacy in Nano

@article{Morais2020ATF,
  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)},
  year={2020},
  pages={159-163}
}
  • Rui MoraisP. CrockerS. Sousa
  • Published 1 August 2020
  • Computer Science, Mathematics
  • 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… 

Figures and Tables 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.

References

SHOWING 1-10 OF 22 REFERENCES

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.

CryptoNote v 2.0

It is believed that a system taking into account the solutions proposed will lead to a healthy competition among different electronic cash systems, and the author proposes his own electronic cash, “CryptoNote”, a name emphasizing the next breakthrough in electronic cash.

Polynomial Commitments

The polynomial commitment schemes are useful tools to reduce the communication cost in cryptographic protocols and apply to four problems in cryptography: verifiable secret sharing, zero-knowledge sets, credentials and content extraction signatures.

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.

Tezos : A Self-Amending Crypto-Ledger Position Paper

This paper aims to remedy the potential for atrophied evolution in the crypto-currency space by presenting Tezos, a generic and self-amending crypto-ledger that can instantiate any blockchain based protocol.

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.

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.

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.

Elliptic curve ElGamal Threshold-based Key Management Scheme against Compromise of Distributed RSUs for VANETs

An Elliptic curve ElGamal Threshold system-based key management scheme for safeguarding a VANET from RSUs being compromised and their collusion with malicious vehicles and does not increase overhead in DFCD during security promotion.

The Stellar Consensus Protocol : A Federated Model for Internet-level Consensus

A new model for consensus called federated Byzantine agreement (FBA), which achieves robustness through quorum slices—individual trust decisions made by each node that together determine system-level quorums.