4.5 Article

Towards verifiable and privacy-preserving account model on a consortium blockchain based on zk-SNARKs

Related references

Note: Only part of the references are listed.
Proceedings Paper Computer Science, Information Systems

Verifying Privacy-Preserving Financing Orders on a Consortium Blockchain Based on zk-SNARKs

Xiaoyan Hu et al.

Summary: Consortium blockchain is widely used in various fields of society due to its efficiency, low overhead, and high scalability. Order financing is one of the scenarios where consortium blockchain is applied. This paper proposes VmppOrder, a verifiable model for privacy-preserving financing orders, based on zk-SNARKs. By using zero-knowledge proofs, the investor can verify encrypted financing orders without decrypting them. The model is implemented on Hyperledger Fabric and experiments show its efficiency.

2022 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) (2022)

Article Computer Science, Information Systems

Blockchain smart contracts: Applications, challenges, and future trends

Shafaq Naheed Khan et al.

Summary: The rapid development of blockchain technology and cryptocurrencies has led to the emergence of a new crypto-economy in the financial industry. Smart contracts have paved the way for next-generation decentralized applications without the need for trusted third parties, but concerns such as security threats, vulnerabilities, and legal issues persist as barriers to adoption.

PEER-TO-PEER NETWORKING AND APPLICATIONS (2021)

Proceedings Paper Computer Science, Theory & Methods

Bulletproofs: Short Proofs for Confidential Transactions and More

Benedikt Bunz et al.

2018 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP) (2018)

Proceedings Paper Computer Science, Theory & Methods

Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs

Jens Groth et al.

ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PART II (2017)

Article Computer Science, Hardware & Architecture

Pinocchio: Nearly Practical Verifiable Computation

Bryan Parno et al.

COMMUNICATIONS OF THE ACM (2016)

Proceedings Paper Computer Science, Theory & Methods

On the Size of Pairing-Based Non-interactive Arguments

Jens Groth

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT II (2016)