Conference Papers

Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506

Browse

Author: search.filters.author.Sri Siddhartha, M.

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Location Privacy Using Data Obfuscation in Fog Computing
    (Institute of Electrical and Electronics Engineers Inc., 2019) Naik, C.; Sri Siddhartha, M.; Martin, J.P.; Chandrasekaran, K.
    In the past few decades, smartphones and Global Positioning System(GPS) devices have led to the popularity of Location Based Services. It is crucial for large MNCs to get a lot of data from people and provide their services accordingly. However, on the other side, the concern of privacy has also increased among the users, and they would like to hide their whereabouts. The rise of data consumption and the hunger for faster network speed has also led to the emergence of new concepts such as the Fog Computing. Fog computing paradigm extends the storage, networking, and computing facilities of the cloud computing towards the edge of the networks while removing the load on the server centers and decreasing the latency at the edge device. The fog computing will help in unlimited growth of location services and this adoption of fog computing calls for the need for more secure and robust algorithms for location privacy. One of the ways we can alter the information regarding the location of the user is Location Obfuscation. This can be done reversibly or irreversibly. In this paper, we address the problem of location privacy and present a solution based on the type of data that has to be preserved (in our case, it is distance). A mobile application has been designed and developed to test and validate the feasibility of the proposed obfuscation techniques for the Fog computing environments. © 2019 IEEE.
  • No Thumbnail Available
    Item
    Greatest common divisor and its applications in security: Case study
    (Institute of Electrical and Electronics Engineers Inc., 2020) Sri Siddhartha, M.; Rodriques, J.; Chandavarkar, B.R.
    In this paper, we explain the importance and applications of the Greatest Common Divisor(GCD) in the field of security. GCD of two numbers is the greatest divisor that ultimately divides these two numbers. The paper initially discusses four standard algorithms used in calculating GCD: Euclidean Algorithm, Binary GCD algorithm, Dijkstra's algorithm, and Lehmer's algorithm. We then analyze the various GCD applications in computer security. Some applications like generating modular multiplicative inverse are used in various cryptographic algorithms, reducing public keys' disclosure within closed groups, the importance of GCD in cryptographic algorithms, key refreshment message authentication, and peer validation. In the end, we cover the effects arising due to not proper use of GCD according to the algorithms stated in this paper, and how a poor choice of prime numbers that we use to compute the GCD and miscalculation of GCD can affect the computer security. © 2020 IEEE.