Browsing by Author "Vivek, S."

Now showing 1 - 7 of 7

Clustering Enhanced Encoderâ€“Decoder Approach to Dimensionality Reduction and Encryption
(Springer Science and Business Media Deutschland GmbH info@springer-sbm.com, 2021) Mukesh, B.R.; Madhumitha, N.; Aditya, N.P.; Vivek, S.; Anand Kumar, M.
Dimensionality reduction refers to reducing the number of attributes that are being considered, by producing a set of principal variables. It can be divided into feature selection and feature extraction. Dimensionality reduction serves as one of the preliminary challenges in storage management and is useful for effective transmission over the Internet. In this paper, we propose a deep learning approach using encoderâ€“decoder networks for effective (almost-lossless) compression and encryption. The neural network essentially encrypts data into an encoded format which can only be decrypted using the corresponding decoders. Clustering is essential to reduce the variation in the dataset to ensure overfit. Using clustering resulted in a net gain of 1% over the standard encoder architecture over three MNIST datasets. The compression ratio achieved was 24.6:1. The usage of image datasets is for visualization only and the proposed pipeline could be applied for textual and visual data as well. Â© 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Cryptanalysis ofÂ theÂ Privacy-Preserving Ride-Hailing Service TRACE
(Springer Science and Business Media Deutschland GmbH, 2021) Kumaraswamy, D.; Vivek, S.
In a typical ride-hailing service, the service provider (RS) matches a customer (RC) with the closest vehicle (RV) registered to this service. Ride-hailing services have gained tremendous popularity over the past years, and several works have been proposed to ensure privacy of riders and drivers during ride-matching. TRACE is an efficient privacy-preserving ride-hailing service proposed by Wang et al. (IEEE Trans.Â Vehicular Technology 2018). TRACE uses masking along with other cryptographic techniques to ensure efficient and accurate ride-matching. RS computes a (secret) spatial division of a region into quadrants. The RS uses masked location information to match RCs and RVs within a quadrant without obtaining their exact locations, thus ensuring privacy. Additionally, an RC only gets to know location of the closest RV finally matched to it, and not of other responding RVs in the region. In this work, we disprove the privacy claims in TRACE by showing the following: a) RCs and RVs can identify the secret spatial division maintained by RS (this reveals information about the density of RVs in the region and other potential trade secrets), and b) the RS can identify exact locations of RCs and RVs (this violates location privacy). Prior to exchanging encrypted messages in the TRACE protocol, each entity masks the plaintext message with a secret unknown to others. Our attack allows other entities to recover this plaintext from the masked value by exploiting shared randomness used across different messages, that eventually leads to a system of linear equations in the unknown plaintexts. This holds even when all the participating entities are honest-but-curious. We implement our attack and demonstrate its efficiency and high success rate. For the security parameters recommended for TRACE, an RV can recover the spatial division in less than a minute, and the RS can recover the location of an RV in less than a second on a commodity laptop. Â© 2021, Springer Nature Switzerland AG.
Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
(De Gruyter Open Ltd, 2022) Vivek, S.; Murthy, S.; Kumaraswamy, D.
We investigate the problem of recovering integer inputs (up to an affine scaling) when given only the integer monotonic polynomial outputs. Given n integer outputs of a degree-d integer monotonic polynomial whose coefficients and inputs are integers within known bounds and n ≫ d, we give an algorithm to recover the polynomial and the integer inputs (up to an affine scaling). A heuristic expected time complexity analysis of our method shows that it is exponential in the size of the degree of the polynomial but polynomial in the size of the polynomial coefficients. We conduct experiments with real-world data as well as randomly chosen parameters and demonstrate the effectiveness of our algorithm over a wide range of parameters. Using only the polynomial evaluations at specific integer points, the apparent hardness of recovering the input data served as the basis of security of a recent protocol proposed by Kesarwani et al. for secure k-nearest neighbor computation on encrypted data that involved secure sorting. The protocol uses the outputs of randomly chosen monotonic integer polynomial to hide its inputs except to only reveal the ordering of input data. By using our integer polynomial recovery algorithm, we show that we can recover the polynomial and the inputs within a few seconds, thereby demonstrating an attack on the protocol of Kesarwani et al. © 2022 Srinivas Vivek et al.
Optimized Distributed Job Shop Scheduling Using Balanced Job Allocation and Modified Ant Colony Optimization
(Springer Science and Business Media Deutschland GmbH, 2022) Vivek, S.; Rakesh, K.; Mohan, B.R.
Many challenges are being faced by the manufacturing industry: ensuring profitable growth, reducing costs, increasing productivity, and giving quick responses to customers. To become more productive, reduce transportation costs, and reduce bottleneck on a single factory, industrial companies are shifting from single to distributed systems. Scheduling problems like distributed job shop, distributed flow shop, and distributed process planning are becoming a popular field to study. We try to solve the distributed job shop scheduling problem (DJSP) where the allocation of jobs to different factories needs to be done and additionally, the determination of good operation schedules for each factory. The goal of DJSP is to minimize the makespan over all the factories. To solve this problem, we first use a method of allocating jobs to factories to evenly distribute the workloads among all the factories. Later, we use a bio-inspired algorithm on each factory after the allocations, namely ant colony optimization to get a solution that is close to the most optimal solution. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Performance evaluation of cement mortar compositions at elevated temperatures
(2019) Yaragal, S.C.; Vivek, S.; Chethan, Kumar, B.
Natural river sand is becoming scarce day by day due to rapid growth in construction sector. There is need for alternatives to be used in place of river sand. The performance of alternatives to river sand at elevated temperatures is also important in the likely event of fire accidents. In this study, the effect of elevated temperatures on the compressive strength of mortars containing Crushed Rock Fines (CRF) and Lateritic Sand (LS) is investigated. Cement mortar cubes were cast for varied proportion of lateritic soil and quarry dust as fine aggregate. Lateritic content was varied from 25%-100%, and 50% quarry dust was adopted. After 28 days of water curing, specimens were exposed to temperatures of 200, 400, 600, and 800 C. At room temperature, the compressive strength decreases with increase in level of lateritic fine aggregate. The lateritic mortar mixes (50, 75, and 100%) have exhibited superior elevated temperature endurance characteristics at 400, 600, and 800 C when compared to control mix. Even the 25% laterized mortar has performed equally well as that of control mix. At elevated temperatures, CRF blended mix has performed very poorly. Mortar containing lateritic sand has potential for utilization in buildings and other structures, for better fire endurance in the likely event of fire accidents. 2019 Associated Cement Companies Ltd.. All rights reserved.
Performance evaluation of cement mortar compositions at elevated temperatures
(Associated Cement Companies Ltd., 2019) Yaragal, S.C.; Vivek, S.; Kumar, B.
Natural river sand is becoming scarce day by day due to rapid growth in construction sector. There is need for alternatives to be used in place of river sand. The performance of alternatives to river sand at elevated temperatures is also important in the likely event of fire accidents. In this study, the effect of elevated temperatures on the compressive strength of mortars containing Crushed Rock Fines (CRF) and Lateritic Sand (LS) is investigated. Cement mortar cubes were cast for varied proportion of lateritic soil and quarry dust as fine aggregate. Lateritic content was varied from 25%-100%, and 50% quarry dust was adopted. After 28 days of water curing, specimens were exposed to temperatures of 200, 400, 600, and 800°C. At room temperature, the compressive strength decreases with increase in level of lateritic fine aggregate. The lateritic mortar mixes (50, 75, and 100%) have exhibited superior elevated temperature endurance characteristics at 400, 600, and 800°C when compared to control mix. Even the 25% laterized mortar has performed equally well as that of control mix. At elevated temperatures, CRF blended mix has performed very poorly. Mortar containing lateritic sand has potential for utilization in buildings and other structures, for better fire endurance in the likely event of fire accidents. © 2019 Associated Cement Companies Ltd.. All rights reserved.
Revisiting Driver Anonymity in ORide
(Springer Science and Business Media Deutschland GmbH, 2022) Kumaraswamy, D.; Murthy, S.; Vivek, S.
Ride Hailing Services (RHS) have become a popular means of transportation, and with its popularity comes the concerns of privacy of riders and drivers. ORide is a privacy-preserving RHS proposed at the USENIX Security Symposium 2017 and uses Somewhat Homomorphic Encryption (SHE). In their protocol, a rider and all drivers in a zone send their encrypted coordinates to the RHS Service Provider (SP) who computes the squared Euclidean distances between them and forwards them to the rider. The rider decrypts these and selects the optimal driver with least Euclidean distance. In this work, we demonstrate a location-harvesting attack where an honest-but-curious rider, making only a single ride request, can determine the exact coordinates of about half the number of responding drivers even when only the distance between the rider and drivers are given. The significance of our attack lies in inferring locations of other drivers in the zone, which are not (supposed to be) revealed to the rider as per the protocol. We validate our attack by running experiments on zones of varying sizes in arbitrarily selected big cities. Our attack is based on enumerating lattice points on a circle of sufficiently small radius and eliminating solutions based on conditions imposed by the application scenario. Finally, we propose a modification to ORide aimed at thwarting our attack and show that this modification provides sufficient driver anonymity while preserving ride matching accuracy. Â© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.