New Research: Supply Chain Attack on Axios Pulls Malicious Dependency from npm.Details →
Socket
Book a DemoSign in
Socket

anonymous-transfer

Package Overview
Dependencies
Maintainers
1
Versions
1
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

anonymous-transfer

ZKP and IMT to transfer tokens anonymously

latest
npmnpm
Version
0.1.0
Version published
Weekly downloads
3
50%
Maintainers
1
Weekly downloads
 
Created
Source

Anonymous transfer

This implementation is a PoC project to learn and build a stack of how ZKP works in practice.

An excellent article was written on this topic, illustrating the basic principles and a small amount of history.

Theory

"Zero-knowledge" proving system

A zero-knowledge proving system is a cryptographic tool that allows a prover to demonstrate that:

  • She (Alice) knows a secret (a secret will be a value or a few values)
  • She used those secret values inside a defined and known computation
  • She performed that computation

Furthermore, let her prove all the above without revealing the original secret. The proof also needs to have some specific positive features (be short, quick to verify)

Practical example

  • Alice has two snooker balls, a black one and a white one.
  • She knows a secret: the black one is lighter than the white one.
  • She wants to prove to Bob that she knows this secret without revealing any information about it
  • She puts two balls into the bag and asks Bob to name the colour
  • If he says white, she holds up the heaviest; if he says black, the lightest
  • She repeats the process until Bob is convinced that she knows how to identify the correct ball

ZKP core

As we move on, we need to understand the properties that need to be respected by our proof /proving system:

  • Soundness. It means that Alice cannot cheat.
  • Completeness. It means that each possibility has a way to be proven.
  • Zero-Knowledge. It means that the only statement disclosed is the one being proven.

Problem

Imagine a situation where Alice wants to transfer one ETH to Bob anonymously, i.e., in a way that makes it impossible to identify the source and recipient of the transfer.

Solution

One of the possible solutions is to use ZKP of inclusion to hide a transfer in a set of other transfers.

we need high user activity on the core contract to achieve anonymity.

How it works

  • Alice generates secrets (two big random numbers: secret and nullifier) and commitment.
  • Deposits one ETH and sends commitment to the core contract.
  • Retrieves a contract stay to be able to generate a ZKP.
  • Generates ZKP of action (deposit).
  • Send the proof offline to an account unrelated to Alice but controlled by Alice or someone who has agreed with Alice
  • Withdraws one ETH by convincing the contract (verifier) that some action happened and she is eligible to withdraw funds.
  • Contract uses the nullifier hash provided with withdrawal to "nullify" the commitment. (Prevents double spending)

Commitment scheme

Acknowledgments

FAQs

Package last updated on 10 Apr 2024

Did you know?

Socket

Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.

Install

Related posts