Abstract
We propose a new authentication algorithm for small internet of things (IoT) devices without key distribution and secure servers. Encrypted private data are stored on the cloud server in the registration step and compared with incoming encrypted data without decryption in the verification step. We call a set of encryptions that can verify two encrypted data items without decryption a verifiable encryption (VE). In this paper, we define VE, and claim that several cryptosystems belong to the VE class. Moreover, we introduce an authentication algorithm based on VE, and show an example of the algorithm and discuss its performance and security. As the algorithm neither shares any secret keys nor decrypts, its computation time becomes very small.
Highlights
Besides the recent development of network services and internet of things (IoT) devices, an efficient processing technology for encrypted big data is required
We propose a class of cryptosystems where the distance is calculated on the space of ciphered texts, the so-called verifiable encryption (VE)
We defined verifiable encryption, which is given by a class of the cryptosystem
Summary
Besides the recent development of network services and internet of things (IoT) devices, an efficient processing technology for encrypted big data is required. For this purpose, speed and security should be balanced reasonably. SE focused on IoT and big data has been actively studied [3,4,5,6]. We propose a class of cryptosystems where the distance is calculated on the space of ciphered texts, the so-called verifiable encryption (VE). The known authentication algorithms, viz., Fiat–Shamir [12]. We provide the implementation of one of the new authentication algorithms and demonstrate its performance
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
