- Nov 29, 2024
Dusk Whitepaper 2024
The Dusk whitepaper outlines the technical framework and key innovations behind the Dusk protocol. It serves as a comprehensive guide to understand how Dusk enables privacy,… - Sep 25, 2024
Phoenix Transaction Model
Phoenix is the transaction model of the Dusk network, enabling confidential financial transactions. It extends the UTXO model with techniques from Zcash and CryptoNote and… - Apr 16, 2024
Phoenix Security Analysis
A formal security analysis of the Phoenix transaction model, proving non-malleability, ledger indistinguishability, balance and note spendability. - Jul 18, 2023
Confidential Security Contract (XSC) Standard
The XSC standard defines how confidential security tokens can be issued and managed on Dusk, covering supply, whitelists, transfers, dividends and voting. - Jan 23, 2023
Citadel: Self-Sovereign Identities on Dusk Network
Citadel is a fully privacy-preserving self-sovereign identity system for the Dusk network. It introduces a native privacy-preserving NFT model so that user rights are stored… - Mar 08, 2022
Fort Protocol Research Paper
FORT is a protocol for proving your right to use a service, such as entry to an event, with NFTs and zero-knowledge proofs, without revealing sensitive data. - Jan 12, 2022
PlonKup Research Paper
Dusk Network shares its zero-knowledge proof (ZKP) system 'PlonKup' to make cryptographic obfuscation of data on layer-1 blockchains affordable. The tool makes it economically… - Aug 23, 2021
Reinforced Concrete Research Paper
Published on August 23rd, 2021. Documentation on the breakthrough hash function for ZKproofs & Verifiable Computation, co-authored by Dusk Network's Dmitry Khovratovich. - Jul 02, 2019
Full Privacy in Account-based Cryptocurrencies
How account-based cryptocurrencies can get full sender and value privacy with efficient zero-knowledge proofs of balance, via private memory and a balance tree. - Jul 02, 2019
Blind Bid Protocol
Blind bid lets participants bid for the right to generate a block, with hidden amounts and zero-knowledge proofs, so no bid can be ruled out as the winner.