Department of Computer Science & Engineering

&ldquo;IIT Jodhpur is committed to impart quality education to facilitate the creation of qualified, competent and responsible human resources to meet the emerging technological challenges of the world. It is working towards creating an equitable learning platform that is positive, accessible and effective in the face of the modern societal and scientific advancements.

Flexibility in curriculum, in all its academic programs, encompassing elements of teaching, research, creativity, innovation and entrepreneurship is the most unique feature of IIT Jodhpur. The Department of Science and Technology (DST), under the National Mission on Cyber Physical Systems, has identified IIT Jodhpur as a Technology &amp; Innovation Hub in the area of Augmented Reality and Virtual Reality. The institute has also been nominated as the coordinator for the Jodhpur City and Knowledge Cluster by the Office of Principal Scientific Adviser, Government of India.

The sprawling 852-acre IIT Jodhpur campus is a majestic tribute to the deep-rooted diverse cultural heritage of the region. The campus is an architectural masterpiece, which is slated to become an international exemplar of sustainability with net-zero energy, and advanced water and waste management strategies.&rdquo;

IIT Jodhpur

World University root node

IIITD-Delhi

Improving face recognition performance using color, shape, symmetry and texture attributes

A generalization of classical cycle hitting problems, called conflict version of the problem, is defined as follows. An input is undirected graphs G and H on the same vertex set, and a positive integer k, and the objective is to decide whether there exists a vertex subset X ? V (G) such that it intersects all desired “cycles” (all cycles or all odd cycles or all even cycles) and X is an independent set in H. In this paper we study the conflict version of classical Feedback Vertex Set, and Odd Cycle Transversal problems, from the view point of kernelization complexity. In particular, we obtain the following results, when the conflict graph H belongs to the family of d-degenerate graphs. 1. CF-FVS admits a O(kO(d)) kernel. 2. CF-OCT does not admit polynomial kernel (even when H is 1-degenerate), unless NP ? coNPpoly . For our kernelization algorithm we exploit ideas developed for designing polynomial kernels for the classical Feedback Vertex Set problem, as well as, devise new reduction rules that exploit degeneracy crucially. Our main conceptual contribution here is the notion of “k-independence preserver”. Informally, it is a set of “important” vertices for a given subset X ? V (H), that is enough to capture the independent set property in H. We show that for d-degenerate graph independence preserver of size kO(d) exists, and can be used in designing polynomial kernel. © A. Agrawal, and P. Jain, and L. Kanesh, and P. Misra, and S. Saurabh; licensed under Creative Commons License CC-BY.

Leibniz International Proceedings in Informatics, LIPIcs

Exploring the kernelization borders for hitting cycles

Recognition of touching characters in mathematical expressions is a challenging problem in the field of document image analysis. Various approaches for recognizing touching maths symbols have been reported in literature, but they mainly dealt with printed expressions and handwritten numeral strings. In this work, a new segmentation-free approach is proposed which matches convex shape portions of symbols occurring in various layout such as subscript, superscript, fraction etc. and is able to perform spotting of symbols present in a handwritten expression. Our contribution lies in the design of a novel feature which can handle touching symbols effectively in the presence of handwriting variations. This recognition-based approach helps in spotting symbols in an expression even in the presence of clutter created by the presence of other symbols. © Springer Nature Singapore Pte Ltd. 2019.

Department of Electrical Engineering

Communications in Computer and Information Science

Symbol Spotting in Offline Handwritten Mathematical Expressions

With the increased number of vehicles, the traditional VANETs (Vehicular Ad-hoc Networks) experiencing new face transitions. One such concept is Vehicular Cloud Computing (VCC), where the data exchanges between vehicles or any entities, in traffic condition or in an emergency situation can be easily done. Establishing authentication and secure communication in VCC is a major problem because of the highly dynamic nature of vehicles. False messages may mislead the drivers which may cause serious issues. In this paper, we propose a lightweight protocol for authentication and secure communication in the VCC. More specifically, we design a lightweight protocol with hash operations, XORs, concatenations, etc., to ensure security. In-depth security analysis is done to check various attacks in the VCC system. In addition to that, we have done hardware implementation on a desktop computer, on a small single board computer-Raspberry Pi and verified the execution time needed. The performance analysis reveals that our protocol outperforms well in different scenarios like communication cost, storage overhead, computation time, and energy consumption. © 2019 IEEE.

International Conference on Information Networking

A Lightweight Authentication and Communication Protocol in Vehicular Cloud Computing

With the rapid advancement in wireless communications and network technology, the vehicular ad-hoc network has become an interesting topic for researchers due to intelligent transportation systems on the road. However, the communications are performed through wireless mediums and involve vehicles, which have limited storage space and computation capability. Therefore, secure and lightweight schemes are required for authentication and communication purposes. In this paper, we propose an identity-based communication method using bilinear pairings to provide computationally better and secure communication between vehicles and infrastructure (V2V and V2I) in VANETs. This scheme is secure against various security attacks, namely, man-in-the-middle, forgery, impersonation, replay, etc. The computation and communication costs also have been improved considerably compared to other related schemes. © 2019 IEEE.

International Symposium on Advanced Networks and Telecommunication Systems, ANTS

Pseudo-identity Based Secure Communication Scheme for Vehicular Ad-hoc Networks

The pioneering concept of connected vehicles has transformed the way of thinking for researchers and entrepreneurs by collecting relevant data from nearby objects. However, this data is useful for a specific vehicle only. Moreover, vehicles get a high amount of data (e.g., traffic, safety, and multimedia infotainment) on the road. Thus, vehicles expect adequate storage device for this data, but it is infeasible to have a large memory in each vehicle. Hence, the vehicular cloud computing (VCC) framework came into the picture to provide a storage facility by connecting a road-side-unit (RSU) with the vehicular cloud (VC). In this, data should be saved in an encrypted form to preserve security, but there is a challenge to search for information over encrypted data. Next, we understand that many of vehicular communication schemes are inefficient for data transmissions due to its poor performance results and vulnerable to different fundamental security attacks. Accordingly, on-device performance is critical, but data damages and secure on-time connectivity are also significant challenges in a public environment. Therefore, we propose reliable data transmission protocols for cutting-edge architecture to search data from the storage, to resist against various security attacks, and provide better performance results. Thus, the proposed data transmission protocol is useful in diverse smart city applications (business, safety, and entertainment) for the benefits of society. © 2019 Association for Computing Machinery.

UbiComp/ISWC 2019- - Adjunct Proceedings of the 2019 ACM International Joint Conference on Pervasive and Ubiquitous Computing and Proceedings of the 2019 ACM International Symposium on Wearable Computers

Secure communication protocol for smart transportation based on vehicular cloud

Database encryption is a process in which the data stored in the database are converted from plaintext (PT) to ciphertext (CT). The original data can be retrieved from the ciphertext with the help of a predefined key and a decryption scheme. This way, only the appropriate authority that has the key can access the data. Thus, encrypted databases help ensure data confidentiality and avoid data leaks. In this paper, we will describe a modification to the Secure K-Nearest Neighbours (SkNN) [3] technique to construct an encrypted database system. We briefly discuss some of the existing encryption models and the principles involved in their construction and look at some of the issues that plague these models. The motivation behind this paper is to devise a method that allows for strong database encryption, while at the same time facilitating efficient search over the encrypted data. In order to achieve this, we suggest an approach which combines RSA with the SkNN scheme. © 2019, Springer Nature Switzerland AG.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Efficient searching over encrypted database: Methodology and algorithms

By 2020, around 25 billion "things" will be connected to the Internet for a better society using different technological systems. Vehicle users have better experiences by collaborating the Internet of Things (IoT) and vehicular ad-hoc network (VANET) architectures, and this emerging field is called the Internet of vehicles (IoV). Thus, this architecture will play an important role in the industry, research organization, and academics for various public and commercial applications. However, the IoV structure should ensure secure and efficient performance for vehicular communications, else an attacker may interfere in the system. In this paper, we propose protected comprehensive data dissemination protocols (say IoVCom) using a one-way hash function for the IoV structure. Next, we discuss security strengths of the proposed schemes against various security attacks and measure performance results, i.e., communication overhead, computation time, storage cost, and energy consumption. IEEE

IEEE Transactions on Dependable and Secure Computing

IoVCom: Reliable Comprehensive Communication System for Internet of Vehicles

In the fast-growing world, a significant increase in the number of vehicles has opened an opportunity to transform vehicles from a mechanical device to an intelligent system. The vehicular ad-hoc network (VANET) is designed to exchange messages with nearby devices. However, it is tough to transmit information from a sender to a receiver in a public environment due to malicious activities (by an adversary), wireless connection, mobility, and high-cost requirement. In this paper, we propose a state-of-the-art protocol, names as 'VehicleChain' for smart transportation to ensure secure and cost-effective vehicle-to-vehicle and vehicle-to-infrastructure communications. The VehicleChain combines the robustness of a blockchain with elliptic-curve cryptography (ECC) to improve the system security level without increasing the computational cost. The VehicleChain is protected against different attacks, i.e., insider, server spoofing, modification, man-in-the-middle, plaintext, replay, and impersonation. Further, the proposed scheme comparatively achieves better results for different performance measures. © 2019 IEEE.

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Vehiclechain: Blockchain-based vehicular data transmission scheme for smart city

Spatial Computing as a field is being used vastly to locate services around the user and to provide efficient search results for the same. Location-based services are a good example of spatial computing where the position of the user around the globe is of more importance than any other parameters and based on this spatial value of the user, the database is queried to provide the user with the nearest available location. The spatial value of the user is made available by using the Global Positioning System (GPS). Nowadays every mobile phone is inbuilt with a GPS receiver to locate the relatively accurate position of the user. The aim of the paper is to improvise the results of GPS (Global Positioning System) based service by making it more users flexible and taking into consideration more number of parameters other than distance. The parameters taken into consideration should aid the user in such a way that the result obtained by the user is more relevant to him than the previous search result when only the distance was taken into consideration. © 2019 IEEE.