1. bookVolume 2019 (2019): Issue 3 (July 2019)
Journal Details
First Published
16 Apr 2015
Publication timeframe
4 times per year
access type Open Access

Mesh: A Supply Chain Solution with Locally Private Blockchain Transactions

Published Online: 12 Jul 2019
Volume & Issue: Volume 2019 (2019) - Issue 3 (July 2019)
Page range: 149 - 169
Received: 30 Nov 2018
Accepted: 16 Mar 2019
Journal Details
First Published
16 Apr 2015
Publication timeframe
4 times per year

A major line of research on blockchains is geared towards enhancing the privacy of transactions through anonymity using generic non-interactive proofs. However, there is a good cluster of application scenarios where complete anonymity is not desirable and accountability is in fact required. In this work, we utilize non-interactive proofs of knowledge of elliptic curve discrete logarithms to present membership and verifiable encryption proof, which offers plausible anonymity when combined with the regular signing process of the blockchain transactions. The proof system requires no trusted setup, both its communication and computation complexities are linear in the number of set members, and its security relies on the discrete logarithm assumption. As a use-case for this scenario, we present Mesh which is a blockchain-based framework for supply chain management using RFIDs. Finally, the confidentiality of the transacted information is realized using a lightweight key chaining mechanism implemented on RFIDs. We formally define and prove the main security features of the protocol, and report on experiments for evaluating the performance of the modified transactions for this system.


[1] Néstle annual review 2017, 2017. https://www.nestle.com/asset-library/documents/library/documents/annual_reports/2017-annual-review-en.pdf.Search in Google Scholar

[2] Blockchain in Transport Alliance (BiTA), 2018. https://bita.studio/members/.Search in Google Scholar

[3] India post annual report 2017, 2018. https://www.indiapost.gov.in/VAS/DOP_PDFFiles/AnnualReportEnglish2016-17.pdf.Search in Google Scholar

[4] Maersk line, 2018. https://www.maersk.com/about.Search in Google Scholar

[5] P&G manufacturing facilities locations, 2018. https://www.pgcareers.com/our-locations.Search in Google Scholar

[6] Walmart location facts, 2018. https://corporate.walmart.com/our-story/our-locations.Search in Google Scholar

[7] Epc™ radio-frequency identity protocols generation-2 uhf rfid standard version 2. EPCglobal Inc. Specification documents, Jul. 2018. https://www.gs1.org/sites/default/files/docs/epc/gs1-epc-gen2v2-uhf-airinterface_i21_r_2018-09-04.pdf.Search in Google Scholar

[8] R. AlTawy, R. Rohit, M. He, K. Mandal, G. Yang, and G. Gong. sLiSCP-light: Towards hardware optimized spongespecific cryptographic permutations. ACM Trans. Embeded Computing Systems, 17(4):81:1–81:26, 2018.Search in Google Scholar

[9] E. Androulaki, A. Barger, V. Bortnikov, C. Cachin, K. Christidis, A. De Caro, D. Enyeart, C. Ferris, G. Laventman, Y. Manevich, S. Muralidharan, C. Murthy, B. Nguyen, M. Sethi, G. Singh, K. Smith, A. Sorniotti, C. Stathakopoulou, M. Vukolic, S. Cocco, and J. Yellick. Hyperledger Fabric: A distributed operating system for permissioned blockchains. In Proceedings of the Thirteenth EuroSys Conference, pages 30:1–30:15, 2018.Search in Google Scholar

[10] Shireesh Aptea and Nikolai Petrovsky. Will blockchain technology revolutionize excipientsupply chain management? 7(3):76–78, 2016.Search in Google Scholar

[11] Ghada Arfaoui, Jean-François Lalande, Jacques Traoré, Nicolas Desmoulins, Pascal Berthomé, and Said Gharout. A practical set-membership proof for privacy-preserving nfc mobile ticketing. In PETs, pages 25–45, 2015.10.1515/popets-2015-0019Search in Google Scholar

[12] E. Ben-Sasson, I. Bentov, A. Chiesa, A. Gabizon, D. Genkin, M. Hamilis, E. Pergament, M. Riabzev, M. Silberstein, E. Tromer, and M. Virza. Computational integrity with a public random string from quasi-linear pcps. In Jean-Sébastien Coron and Jesper Buus Nielsen, editors, Advances in Cryptology – EUROCRYPT 2017, pages 551–579. Springer, 2017.10.1007/978-3-319-56617-7_19Search in Google Scholar

[13] E. Ben-Sasson, I. Bentov, Y. Horesh, and M. Riabzev. Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018/046, 2018. https://eprint.iacr.org/2018/046.Search in Google Scholar

[14] E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza. Snarks for c: Verifying program executions succinctly and in zero knowledge. In R. Canetti and J. Garay, editors, Advances in Cryptology – CRYPTO 2013, pages 90–108. Springer, 2013.10.1007/978-3-642-40084-1_6Search in Google Scholar

[15] Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, and Madars Virza. Succinct non-interactive zero knowledge for a von neumann architecture. Cryptology ePrint Archive, Report 2013/879, 2013. https://eprint.iacr.org/2013/879, updated in 2015.Search in Google Scholar

[16] D. Boneh. The decision diffie-hellman problem. In J.. Buhler, editor, Algorithmic Number Theory, pages 48–63. Springer, 1998.10.1007/BFb0054851Search in Google Scholar

[17] Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the weil pairing. Journal of Cryptology, 17(4):297–319, 2004.10.1007/s00145-004-0314-9Search in Google Scholar

[18] B. Bünz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell. Bulletproofs: Short proofs for confidential transactions and more. In IEEE Symposium on Security and Privacy (SP), pages 315–334, 2018.10.1109/SP.2018.00020Search in Google Scholar

[19] Vitalik Buterin and Christian Reitwiessner. Eip 197: Precompiled contracts for optimal tate pairing check on the elliptic curve alt_bn128, 2017. https://eips.ethereum.org/EIPS/eip-197.Search in Google Scholar

[20] J. Camenisch and M. Stadler. Proof systems for general statements about discrete logarithms. Technical report, Dept. of Computer Science, ETH Zurich., 1997.Search in Google Scholar

[21] Jan Camenisch, Rafik Chaabouni, and abhi shelat. Efficient protocols for set membership and range proofs. In Josef Pieprzyk, editor, Advances in Cryptology - ASIACRYPT 2008, pages 234–252. Springer, 2008.10.1007/978-3-540-89255-7_15Search in Google Scholar

[22] Sébastien Canard, Iwen Coisel, Amandine Jambert, and Jacques Traoré. New results for the practical use of range proofs. In Sokratis Katsikas and Isaac Agudo, editors, Public Key Infrastructures, Services and Applications, pages 47–64. Springer, 2014.10.1007/978-3-642-53997-8_4Search in Google Scholar

[23] Rafik Chaabouni, Helger Lipmaa, and Bingsheng Zhang. A non-interactive range proof with constant communication. In Angelos D. Keromytis, editor, Financial Cryptography and Data Security, pages 179–199. Springer, 2012.10.1007/978-3-642-32946-3_14Search in Google Scholar

[24] D. Chaum and E. van Heyst. Group signatures. In D. Davies, editor, EUROCRYPT ’91, pages 257–265. Springer, 1991.10.1007/3-540-46416-6_22Search in Google Scholar

[25] Ronald Cramer, Ivan Damgård, and Berry Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Yvo G. Desmedt, editor, CRYPTO, pages 174–187. Springer, 1994.10.1007/3-540-48658-5_19Search in Google Scholar

[26] I. Damgård. Towards practical public key systems secure against chosen ciphertext attacks. In J. Feigenbaum, editor, Advances in Cryptology — CRYPTO ’91, pages 445–456. Springer, 1992.10.1007/3-540-46766-1_36Search in Google Scholar

[27] U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. In ACM Symposium on Theory of Computing, STOC ’90, pages 416–426. ACM, 1990.10.1145/100216.100272Search in Google Scholar

[28] A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. Odlyzko., editor, Advances in Cryptology — CRYPTO’ 86, pages 186–194. Springer, 1987.10.1007/3-540-47721-7_12Search in Google Scholar

[29] E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski, editor, Advances in Cryptology — CRYPTO ’97, pages 16–30. Springer, 1997.10.1007/BFb0052225Search in Google Scholar

[30] R. Gennaro, C. Gentry, B. Parno, and M. Raykova. Quadratic span programs and succinct NIZKs without PCPs. In T. Johansson and P. Nguyen, editors, Advances in Cryptology – EUROCRYPT 2013, pages 626–645. Springer, 2013.10.1007/978-3-642-38348-9_37Search in Google Scholar

[31] S Goldwasser, S Micali, and C Rackoff. The knowledge complexity of interactive proof-systems. In The ACM Symposium on Theory of Computing, STOC ’85, pages 291–304. ACM, 1985.10.1145/22145.22178Search in Google Scholar

[32] T. Groenfeldt. IBM ibm and Maersk apply blockchain to container shipping. https://www.forbes.com/sites/tomgroenfeldt/2017/03/05/ibm-and-maersk-applyblockchain-to-container-shipping.Search in Google Scholar

[33] J. Groth. Short pairing-based non-interactive zero-knowledge arguments. In M. Abe, editor, Advances in Cryptology - ASIACRYPT 2010, pages 321–340. Springer, 2010.10.1007/978-3-642-17373-8_19Search in Google Scholar

[34] J. Guo, T. Peyrin, and A. Poschmann. The photon family of lightweight hash functions. In P. Rogaway, editor, CRYPTO, pages 222–239. Springer, 2011.10.1007/978-3-642-22792-9_13Search in Google Scholar

[35] IBM.com. IBM Food Trust Marketplace. https://www.ibm.com/us-en/marketplace/food-trust/purchase, accessed: 22 Aug. 2018.Search in Google Scholar

[36] Aferdita Ibrahimi. Cloud computing: Pricing model. Journal of Advanced Computer Science and Applications, 8(6):434–441, 2017.Search in Google Scholar

[37] j. Bootle, A. Cerulli, P. Chaidos, J. Groth, and C. Petit. Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In M. Fischlin and JS. Coron, editors, Advances in Cryptology – EUROCRYPT 2016, pages 327–357. Springer, 2016.10.1007/978-3-662-49896-5_12Search in Google Scholar

[38] A. Juels. Minimalist cryptography for low-cost RFIS tags (extended abstract). In C. Blundo and S. Cimato, editors, Security in Communication Networks, pages 149–164. Springer, 2005.10.1007/978-3-540-30598-9_11Search in Google Scholar

[39] A. Juels and S.. Weis. Authenticating pervasive devices with human protocols. In V. Shoup, editor, Advances in Cryptology – CRYPTO 2005, pages 293–308. Springer, 2005.10.1007/11535218_18Search in Google Scholar

[40] J. Katz, R. Ostrovsky, and M. Yung. Forward secrecy in password-only key exchange protocols. In Proceedings of the 3rd International Conference on Security in Communication Networks, SCN’02, pages 29–44. Springer, 2003.10.1007/3-540-36413-7_3Search in Google Scholar

[41] J. Kilian and E. Petrank. Identity escrow. In H. Krawczyk, editor, Advances in Cryptology — CRYPTO ’98, pages 169–185. Springer, 1998.10.1007/BFb0055727Search in Google Scholar

[42] N. Koblitz. Elliptic curve cryptosystems. Mathematics of computation, 48(177):203–209, 1987.10.1090/S0025-5718-1987-0866109-5Search in Google Scholar

[43] Ahmed Kosba, Andrew Miller, Elaine Shi, Zikai Wen, and Charalampos Papamanthou. Hawk: The blockchain model of cryptography and privacy-preserving smart contracts. In 2016 IEEE Symposium on Security and Privacy, pages 839–858, 2016.10.1109/SP.2016.55Search in Google Scholar

[44] Z. Li, G. Gong, and Z. Qin. Secure and efficient LCMQ entity authentication protocol. IEEE Trans. Information Theory, 59(6):4042–4054, 2013.10.1109/TIT.2013.2253892Search in Google Scholar

[45] mwpvl international. Amazon distribution network, 2018. http://www.mwpvl.com/html/amazon_com.html.Search in Google Scholar

[46] T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In E. Brickell, editor, Advances in Cryptology — CRYPTO’ 92, pages 31–53. Springer, 1993.10.1007/3-540-48071-4_3Search in Google Scholar

[47] H. Petersen. How to convert any digital signature scheme into a group signature scheme. In B. Christianson, B. Crispo, M. Lomas, and M. Roe, editors, Security Protocols, pages 177–190. Springer, 1998.10.1007/BFb0028168Search in Google Scholar

[48] B. Peterson. IBM told investors that it has over 400 blockchain clients — including Walmart, Visa, and Nestlé. https://www.businessinsider.com/ibm-blockchain-enterprisecustomers-walmart-visa-nestl-2018-3?IR=T.Search in Google Scholar

[49] Christian Reitwiessner. Eip 196: Precompiled contracts for addition and scalar multiplication on the elliptic curve alt_bn128, 2017. https://eips.ethereum.org/EIPS/eip-196.Search in Google Scholar

[50] Ronald L. Rivest, Adi Shamir, and Yael Tauman. How to leak a secret. In Colin Boyd, editor, ASIACRYPT, pages 552–565. Springer, 2001.10.1007/3-540-45682-1_32Search in Google Scholar

[51] E. B. Sasson, A. Chiesa, C. Garman, M. Green, I. Miers, E. Tromer, and M. Virza. Zerocash: Decentralized anonymous payments from bitcoin. In 2014 IEEE Symposium on Security and Privacy, pages 459–474, 2014.10.1109/SP.2014.36Search in Google Scholar

[52] C. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161–174, 1991.10.1007/BF00196725Search in Google Scholar

[53] B. Schoenmakers. Interval proofs revisited. In International Workshop on Frontiers in Electronic Elections, 2005. (slides presentation).Search in Google Scholar

[54] Nicolas van Saberhagen. Cryptonote v 2.0, 2013. https://cryptonote.org/whitepaper.pdf.Search in Google Scholar

[55] GAVIN Wood. Ethereum: A secure decentralised generalised transaction ledger. 2014. http://gavwood.com/paper.pdf.Search in Google Scholar

[56] Fan Zhang, Philip Daian, Gabriel Kaptchuk, Iddo Bentov, Ian Miers, and Ari Juels. Paralysis proofs: Secure dynamic access structures for cryptocurrencies and more, 2018. In Bitcoin magazine https://eprint.iacr.org/2018/096.pdf.10.1145/3318041.3355459Search in Google Scholar

Recommended articles from Trend MD

Plan your remote conference with Sciendo