Abstract
In the era of Internet of Things, identity and information authentication have drawn more and more attention. Existing identification mechanisms for identity information generally require networks, biometrics, etc., which exist security vulnerabilities such as security holes, privacy leaks, and vulnerability to attacks. A non-interactive concise offline authentication scheme based on block-chain technology is proposed which no need for complex services such as networking, and hardware implementation is simple. We research anonymity based on block-chain, workload proof and privacy protection technologies, design system models. Integrate device information, data, and confidentiality. The cloud platform function such as key management completes the hardware verification of the offline token authentication algorithm. The experiment results show that the scheme has the characteristics of extremely low recognition rate with a certain difficulty, high performance, high security, low cost, etc. Compared with the existing authentication methods, ours has more advantages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
Lamport, L.: Paxos made simple. ACM SIGACT News 32(4), 18–25 (2001)
Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. (TOCS) 16(2), 133–169 (1998)
Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: OSDI 1999, vol. 99, pp. 173–186 (1999)
Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm (extended version). In: USENIX Annual Technical Conference, pp. 305–320 (2014)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Massachusetts Inst of Tech Cambridge Lab for Computer Science (1982)
Dai, W.: B-money, a scheme for a group of untraceable digital pseudonyms to pay each other with money and to enforce contracts amongst themselves without outside help (1998). http://www.weidai.com/bmoney.txt
Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https://bitcoin.org/bitcoin.pdf
Christidis, K., Devetsikiotis, M.: Blockchains and smart contracts for the Internet of Things. IEEE Access 4, 2292–2303 (2016)
Koblitz, N., Menezes, A., Vanstone, S.: The state of elliptic curve cryptography. Des. Codes Crypt. 19(2–3), 173–193 (2000)
Hui, H., Zhou, C., Xu, S., Lin, F.: A novel secure data transmission scheme in industrial Internet of Things. China Commun. 17(1), 73–88 (2020)
Su, J., Lin, F., Zhou, X., Lu, X.: Steiner tree based optimal resource caching scheme in fog computing. China Commun. 12(8), 161–168 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Du, XF., Lu, YM., Han, DQ. (2020). Point-to-Point Offline Authentication Consensus Algorithm in the Internet of Things. In: Sun, X., Wang, J., Bertino, E. (eds) Artificial Intelligence and Security. ICAIS 2020. Lecture Notes in Computer Science(), vol 12240. Springer, Cham. https://doi.org/10.1007/978-3-030-57881-7_57
Download citation
DOI: https://doi.org/10.1007/978-3-030-57881-7_57
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-57880-0
Online ISBN: 978-3-030-57881-7
eBook Packages: Computer ScienceComputer Science (R0)