You are on page 1of 2

CONCLUSION

•Trust management framework for blockchain is developed with multi users

•Participants can be added or revoked by authorized user to enhance security

•Trust and reputation score are assigned dynamically to provide transparency

•Smart contract is deployed for automation of reputation calculation

REFERENCES
[1] C. Cachin, “Architecture of the hyperledger blockchain fabric,” in Workshop on Distributed
Cryptocurrencies and Consensus Ledgers, vol. 310, 2016.

[2] A. Starbird, “Acceptance sampling, imperfect production, and the optimality of zero
defects,” Naval Research Logistics (NRL), vol. 44, no. 6, pp. 515–530, 1997.

[3] Z. Yang, K. Zheng, K. Yang, and V. C. Leung, “A blockchain-based reputation system for
data credibility assessment in vehicular networks,” in 2017 IEEE 28th PIMRC Symposium.
IEEE, 2017, pp. 1–5.

[4] K. N. Khaqqi, J. J. Sikorski, K. Hadinoto, and M. Kraft, “Incorporating seller/buyer


reputation-based system in blockchain-enabled emission trading application,” Applied Energy,
vol. 209, pp. 8–19, 2018.

[5] Schaub, R. Bazin, O. Hasan, and L. Brunie, “A trustless privacypreserving reputation


system,” in IFIP International Information Security and Privacy Conference. Springer, 2016, pp.
398–411.

[6]A. Moinet, B. Darties, and J.-L. Baril, “Blockchain based trust & authentication for
decentralized sensor networks,” arXiv preprint arXiv:1706.01730, 2017.

[7]Malik, S. S. Kanhere, and R. Jurdak, “Productchain: Scalable blockchain framework to


support provenance in supply chains,” in 2018 IEEE 17th NCA Symposium, Nov 2018, pp. 1–
10.

[8] Combating fraud with blockchain and cryptoanchors. [Online]. Available:


https://www.research.ibm.com/5-in-5/ crypto-anchors-and-blockchain/
[9] P. Thakkar, S. Nathan, and B. Viswanathan, “Performance benchmarking and optimizing
hyperledger fabric blockchain platform,” in 2018 IEEE 26th MASCOTS Symposium, 2018, pp.
264–276.

[10] D. Gambetta et al., “Can we trust trust,” Trust: Making and breaking cooperative relations,
vol. 13, pp. 213–237, 2000.