Dissertation and Thesis: Recent submissions

  • Physical attacks on CCA-Secure Lattice-based KEM SABER 
    Mondal, Puja (Indian Statistical Institute, Kolkata, 2021-07)
    Nowadays the security of most used public-key algorithms are based on the hardness of one of the following problems : 1. The integer factorization, 2. The elliptic-curve discrete logarithm problem. But these problems ...
  • Bulk Categorization Analyse 
    Dhar, Arunava (Indian Statistical Institute, Kolkata, 2021-07)
  • Evaluation of Optical Character Recognition (OCR) accuracy: Supervised and Unsupervised techniques 
    Banerjee, Niladri (Indian Statistical Institute, Kolkata, 2021-07)
    This work’s aim is to find an efficient method to measure the Optical Character Recognition (OCR) accuracy in the absence of the ground truth text. To successfully obtain the desired result, initially we have tried some ...
  • Investigating Applications of The Target Di erence Algorithm in Keccak & Ascon 
    Manna, Asim (Indian Statistical Institute, Kolkata, 2021-07)
  • Project on securing personal health information associated with HIPAA compliance 
    Ramani, Chandan (Indian Statistical Institute, Kolkata, 2021-07)
    In this project my aim was to research about how to secure personal health information associated with HIPAA compliance. Firstly, we tried to understand what is HIPAA and how it is connected to health information. Then ...
  • Efficient and Secure Access Control for Sensitive Healthcare Data 
    Samanta, Asmita (Indian Statistical Institute, Kolkata, 2021-07)
    Healthcare services produce and use a great deal of sensitive personal data. But the fact is that this healthcare data has very high black market value. Now to easily access the healthcare data we can think about an ...
  • Design and Analysis of Blockchain-based E-voting Protocols 
    Ghosh, Sarbajit (Indian Statistical Institute, Kolkata., 2021-07)
    Voting is the most fundamental cornerstone in the context of representative democracy. With the advent of the internet technologies, various types of e-voting mechanisms have emerged. Building an e-voting system capable ...
  • Verifiable e-auction over a Block-Chain 
    Chakraborty, Sayantan (Indian Statistical Institute, Kolkata., 2021-07)
    Auction has been an integral part of trading throughout ages. Sealed-bid e-auction (both first-price and second-price) is considered to be a classic example of Secure Multi-Party Computation problem. In this project, ...
  • Fault Analysis of the Prince Family of Lightweight Ciphers 
    Kundu, Anup Kumar (Indian Statistical Institute, Kolkata, 2021-07)
    Privacy is one of the most fundamental aspects of the digital age that we live in. With the advent of the Internet and the advances in both nanoscale electronics and communication technologies, data has become the new oil. ...
  • Study on the Generation of Pseudo-Random Numbers using Recurrent Neural Network 
    Ravish, Ankit (Indian Statistical Institute, Kolkata, 2021-07)
    Generating random numbers is an important task in cryptography as well as computer science. Pseudo-randomness is fundamental to cryptography and it is required for achieving any cryptographic function like encryption, ...
  • A Catalogue for Provably Secure Symmetric Modes and Primitives 
    Dutta, Anisha (Indian Statistical Institute, Kolkata, 2021-07)
    Modern-day Symmetric-key Cryptology is enriched with numerous contributions including symmetric-key primitives to modes of operation. The approach to design and develop provably secure designs have accelerated the growth ...
  • Prediction of Rate of Penetration in Drilling 
    Roy, Abir Lal (Indian Statistical Institute, Kolkata, 2021-07)
    Drilling has become an expensive and necessary operation to explore petroleum and natural gases.The goal is to increase drilling speed with minimum cost and at the same time maintaining safety.Predicting rate of penetration ...
  • Rainbow Edge Coloring 
    Ghosh, Sudipta (Indian Statistical Institute, Kolkata., 2021-07)
    Graph coloring is a well known problem with wide-ranging applications. The vertex and edge coloring problems have been studied in various models of computation. Rainbow coloring is a type of edge coloring that also acts ...
  • Strategies for User Allocation and Service Placement in Multi-Access Edge Computing 
    Panda, Subrat Prasad (Indian Statistical Institute, Kolkata., 2021-07)
    The emergence of Multi-access Edge Computing (MEC) grants service providers the ability to deploy services at edge servers near base stations to mitigate the effects of high network latencies often encountered in cloud-based ...
  • Pre-Fall Detection by Openpose 
    Saha, Subhajit (Indian Statistical Institute, Kolkata., 2021-07)
    Due to the improvement of medical science people worldwide are living longer. WHO has already predicted that the number of persons with age more than 60, will increase to 1.4 billion by 2030 and 2.1 billion by 2050. Where ...
  • Deep Learning for Classification of COVID-19 Chest CT Scan 
    Ghosh, Subhadip (Indian Statistical Institute, Kolkata., 2021-07)
    The latest threat to global health is COVID-19. It has a tremendous diffusion rate and to combat with this pandemic, large scale testing and diagnosis is required. RT-PCR is the most accurate screening for validating ...
  • Multi-View Hierarchical Clustering using Optimal Transport 
    Ghosh, Sohan (Indian Statistical Institute, Kolkata., 2021-07)
    With the growing availability of multi-view data, development of multi-view clustering algorithms has gained prominence among researchers. However, most of these algorithms are either based on subspace, graph or spectral ...
  • Effectiveness of A* Algorithm for Constrained Tiling 
    Dey, Rishi (Indian Statistical Institute, Kolkata., 2021-07)
    The ‘Mondrian Tiling’ problem is a particular class of constraint optimization problem where a square grid is covered with some non-overlapping integer dimension rectangles, which must not be pairwise congruent. The ...
  • Center-based Robust Clustering 
    Das, Pranta (Indian Statistical Institute, Kolkata., 2021-07)
    We consider the problem of clustering observations xi ∈ R d , i = 1, ..., n into k possible clusters. We are mainly interested in clustering in the presence of outliers, where classical clustering algorithms face ...
  • Graphs with equal independence and matching number 
    Patle, Prajyot Subhash (Indian Statistical Institute, Kolkata., 2021-07)
    Extremal graphs are graphs which sit at the extremes. In simpler words for a class of graphs which satisfy a certain property, extremal graphs are the ones which exhibit a minimum or maximum of that property. Here, we ...

Search DSpace


Advanced Search

Browse

My Account