Confidential and efficient asset proof for bitcoin exchanges

DOI10.1007/s12046-018-0880-4zbMath1398.94202OpenAlexW2810480116WikidataQ129644082 ScholiaQ129644082MaRDI QIDQ1615407

V. Jeevan Prakash, M. K. Kavitha Devi, Maya Mohan

Publication date: 31 October 2018

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://www.ias.ac.in/describe/article/sadh/043/08/0126

zbMATH Keywords

zero-knowledge proofcommitment schemecryptocurrencynon-programmable random oracle modelbitcoin exchangeproof of assets

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Uses Software

• SNARKs for C

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid commitments and their applications to zero-knowledge proof systems
• A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Making Sigma-Protocols Non-interactive Without Random Oracles
• The random oracle methodology, revisited
• Universal Electronic Cash
• An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle

This page was built for publication: Confidential and efficient asset proof for bitcoin exchanges