Abstract
Authentication is the first defence line to prevent malicious entities to access smart mobile devices (or SMD). Essentially, there exist many available cryptographic primitives to design authentication protocols. Oblivious transfer (OT) protocol is one of the important cryptographic primitives to design authentication protocols. The first lattice-based OT framework under universal composability (UC) model was designed by dual mode encryption and promoted us to find an alternative efficient scheme. We note that “lossy encryption” scheme is an extension of the dual mode encryption and can be used to design UC-secure OT protocol, but the investigations of OT via lossy encryption over the lattice are absent. Hence, in order to obtain an efficient authentication protocol by improving the performance of the UC-secure OT protocol, in this paper, we first design a multibit lossy encryption under the decisional learning with errors (LWE) assumption and then design a new variant of UC-secure OT protocol for authenticated protocol via lossy encryption scheme. Additionally, our OT protocol is secure against semihonest (static) adversaries in the common reference string (CRS) model and within the UC framework.
Highlights
Oblivious transfer (OT) is an important cryptographic primitive which can be used for designing secure multiparty computing and privacy-preserving schemes, such as authenticated key exchange and password-based authentication key exchange (PAKE) [1]
In some indistinguishability against chosen plaintext attack (IND-CPA) secure public key encryption (PKE) schemes, if the public key generated by the key generation algorithm is Wireless Communications and Mobile Computing indistinguishable from the public key sampled from a uniform distribution, we can use the PKE scheme to design an OT protocol [9]
We have investigated one of the hot but hard topics in authentication of smart mobile devices (SMD), Internet of things (IoTs), and wireless sensor networks (WSNs)
Summary
Oblivious transfer (OT) is an important cryptographic primitive which can be used for designing secure multiparty computing and privacy-preserving schemes, such as authenticated key exchange and password-based authentication key exchange (PAKE) [1]. In some indistinguishability against chosen plaintext attack (IND-CPA) secure PKE schemes, if the public key generated by the key generation algorithm is Wireless Communications and Mobile Computing indistinguishable from the public key sampled from a uniform distribution, we can use the PKE scheme to design an OT protocol [9] In this setting, Peikert-VaikuntanathanWaters (PVW) [10] has constructed an efficient, universally composability and generally realizable OT via “dual mode encryption” under worst-case lattice assumption (LWE) at CRYPTO’08. From the above observations and inspired by the work of Peikert et al [10], we still work along this line and construct a multibit LWE-based lossy encryption scheme which has two types of public keys.
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
