• Mirror Theory and its Applications in Cryptography 

  Saha, Abishanka (Indian Statistical Institute, Kolkata, 2024-07)

  The indistinguishability security of a cryptographic construction refers to the maximum advantage of an interactive adversary to distinguish between the real and ideal world, where in the real world it interacts with the ...
• Leveraging software engineering frameworks, methods and tools to automate CRM pre-sales in real estate applications 

  Ray, Parthasarathi (Indian Statistical Institute, Kolkata, 2024)

  In this thesis, we leverage the learning from Essence, a “language and kernel“ of Software Engineering, which has resulted from the efforts of the SEMAT initiative founded to bring together industry, research and education ...
• A Few Selected Topics on Boolean Functions 

  Roy, Animesh (Indian Statistical Institute, Kolkata, 2024)

  In this thesis, we use the techniques of Boolean functions in di erent applications. More speci cally, our focus is on the properties of Boolean functions that hold cryptographic signi cance. The employed techniques ...
• Investigating Security of a Few Schemes Based on Public Primitives 

  Raychaudhuri, Anik (Indian Statistical Institute, Kolkata, 2023-07)

  Random oracles are cryptographers’ conceptions of what an ’ideal’ hash function should be.Put succinctly, a random oracle is a perfectly random function that you can evaluate quickly. Random functions are beautiful not ...
• Sphere fibrations over highly connected manifolds 

  Ghosh, Aloke Kr (Indian Statistical Institute, Kolkata, 2024-10)

  This thesis analyzes the construction of the sphere fibrations over (n − 1)-connected 2n-manifolds for an even integer n such that the total space is a connected sum of sphere products, in a localized category of spaces. ...
• Effects of symmetry in combinatorial complexity measures of Boolean functions 

  Kayal, Chandrima (Indian Statistical Institute, Kolkata, 2024-05)

  Boolean functions are one of the central objects in the study of Computer Science. Any decision problem can be expressed as a Boolean function that takes an $n$-bit string as input and gives a single-bit output. Its ...
• Cryptanalysis of Selected SPN and NLFSR-based Symmetric-Key Ciphers 

  Jana, Amit (Indian Statistical Institute, Kolkata, 2023-06)

  The thesis focuses on the cryptanalysis of private-key ciphers, which are widely used encryption methods due to their fast encryption/decryption computing ability and low memory requirements. The thesis covers two different ...
• Data Reduction Using EM Algorithm with Deliberately Introduced Missingness 

  Ghosh, Atanu Kumar (Indian Statistical Institute, Kolkata, 2022)

  Abstract
• Essays on Evaluation Aggregation, Strategy-proof Social Choice, and Myopic-Farsighted Stable Matching 

  Karmokar, Madhuparna (Indian Statistical Institute, Kolkata, 2022-06)

  Abstract
• Multi-View Discriminant Canonical Correlation Analysis 

  Mandal, Ankita (Indian Statistical Institute, Kolkata, 2022-12)

  Multi-view learning is an emerging machine learning paradigm that focuses on discovering patterns in data represented by multiple distinct views. One of the important issues associated with real-life high-dimensional ...
• Coloring of Graphs with no Induced Six-Vertex path 

  Char, Arnab (Indian Statistical Institute, Chennai, 2024-04)

  Graph coloring is one among the oldest and broadly studied topics in graph theory. A coloring of a graph G is an assignment of colors to the vertices of G such that no two adjacent vertices receive the same color, and ...
• Design and Analysis of Authenticated Encryption Modes 

  Bhattacharjee, Arghya (Indian Statistical Institute, Kolkata, 2024-09)

  This thesis proposes and analyses the security of a few symmetric key modes. The first three of them are NAEAD modes, named Oribatida, ISAP+ and OCB+. Oribatida is lightweight, sponge-based, INT-RUP secure and achieves ...
• Some Studies on Mathematical Morphology in Remotely Sensed Data Analysis 

  Barman, Geetika (Indian Statistical Institute, Bangalore, 2023-07)

  The application of Mathematical Morphology (MM) techniques has proven to be beneficial in the extraction of shapebased and texture-based features during remote sensing image analysis. The characteristics of these ...
• Variants of vertex and edge colorings of graphs 

  Pattanayak, Drimit (Indian Statistical Institute, Kolkata, 2024-07)

  A k-linear coloring of a graph G is an edge coloring of G with k colors so that each color class forms a linear forest—a forest whose each connected component is a path. The linear arboricity χ′ l(G) of G is the minimum ...
• Embedding problems for the ´etale fundamental group of curves 

  Mandal, Poulami (Indian Statistical Institute, Bangalore, 2024-08)

  Let X be a smooth projective curve over an algebraically closed field k of char- acteristic p > 0, S be a finite subset of closed points in X. Given an embedding problem (β : Γ ↠ G, α : π´et 1 (X \S) ↠ G) for the ´etale ...
• Enhanced Security Approaches for Data Protection: Managing Consent, Data Breach, and Asset Inheritance 

  Singh, Ram Govind (Indian Statistical Institute, Kolkata, 2024-07)

  The journey of the Indian data protection framework started in 2018 with the introduction of the initial draft as ``Personal Data Protection Bill (PDPB-2018)''. Subsequently, a revised draft PDPB-2019 was introduced. This ...
• Algorithms and Applications in Complex Network Representation, Classification and Manipulation 

  Chowdhury, Anjan (Indian Statistical Institute, Kolkata, 2024-07)

  A complex network is a useful model for many real-world systems. Recently, much effort has been put into studying the insights of the complex network. This thesis is all about the study of complex networks. Based on the ...
• Essays in Decision Theory 

  Bhardwaj, Bhavook (Indian Statistical Institute, Delhi, 2024-05)

  This thesis contains three chapters on individual decision-making and choice. The first chapter introduces a general model of decision-making where alternatives are sequentially examined by a decision maker. Our main ...
• Cancellations in Short Sums related to Hecke-Cusp Forms 

  Ghosh, Aritra (Indian Statistical Institute, Kolkata, 2024-04)

  In number theory, a problem which arises in a variety of contexts is getting non- trivial cancellation for the general correlation problem, specially when we assume that they are short sums related to Hecke-cusp forms. ...
• Bilateral Trade and Partnership with Loss Averse Agents 

  Dalakoti, Harshika (Indian Statistical Institute,Delhi, 2023-07)

  This thesis consists of three essays on bilateral trading and partnership with loss averse agents. All the three essays consider the same model where two loss averse agents (Tversky and Kahneman (1991), K ̈oszegi and Rabin ...

• Mirror Theory and its Applications in Cryptography 

  Saha, Abishanka (Indian Statistical Institute, Kolkata, 2024-07)

  The indistinguishability security of a cryptographic construction refers to the maximum advantage of an interactive adversary to distinguish between the real and ideal world, where in the real world it interacts with the ...
• Leveraging software engineering frameworks, methods and tools to automate CRM pre-sales in real estate applications 

  Ray, Parthasarathi (Indian Statistical Institute, Kolkata, 2024)

  In this thesis, we leverage the learning from Essence, a “language and kernel“ of Software Engineering, which has resulted from the efforts of the SEMAT initiative founded to bring together industry, research and education ...
• A Few Selected Topics on Boolean Functions 

  Roy, Animesh (Indian Statistical Institute, Kolkata, 2024)

  In this thesis, we use the techniques of Boolean functions in di erent applications. More speci cally, our focus is on the properties of Boolean functions that hold cryptographic signi cance. The employed techniques ...
• Investigating Security of a Few Schemes Based on Public Primitives 

  Raychaudhuri, Anik (Indian Statistical Institute, Kolkata, 2023-07)

  Random oracles are cryptographers’ conceptions of what an ’ideal’ hash function should be.Put succinctly, a random oracle is a perfectly random function that you can evaluate quickly. Random functions are beautiful not ...
• Sphere fibrations over highly connected manifolds 

  Ghosh, Aloke Kr (Indian Statistical Institute, Kolkata, 2024-10)

  This thesis analyzes the construction of the sphere fibrations over (n − 1)-connected 2n-manifolds for an even integer n such that the total space is a connected sum of sphere products, in a localized category of spaces. ...
• Effects of symmetry in combinatorial complexity measures of Boolean functions 

  Kayal, Chandrima (Indian Statistical Institute, Kolkata, 2024-05)

  Boolean functions are one of the central objects in the study of Computer Science. Any decision problem can be expressed as a Boolean function that takes an $n$-bit string as input and gives a single-bit output. Its ...
• Cryptanalysis of Selected SPN and NLFSR-based Symmetric-Key Ciphers 

  Jana, Amit (Indian Statistical Institute, Kolkata, 2023-06)

  The thesis focuses on the cryptanalysis of private-key ciphers, which are widely used encryption methods due to their fast encryption/decryption computing ability and low memory requirements. The thesis covers two different ...
• Data Reduction Using EM Algorithm with Deliberately Introduced Missingness 

  Ghosh, Atanu Kumar (Indian Statistical Institute, Kolkata, 2022)

  Abstract
• Essays on Evaluation Aggregation, Strategy-proof Social Choice, and Myopic-Farsighted Stable Matching 

  Karmokar, Madhuparna (Indian Statistical Institute, Kolkata, 2022-06)

  Abstract
• Multi-View Discriminant Canonical Correlation Analysis 

  Mandal, Ankita (Indian Statistical Institute, Kolkata, 2022-12)

  Multi-view learning is an emerging machine learning paradigm that focuses on discovering patterns in data represented by multiple distinct views. One of the important issues associated with real-life high-dimensional ...
• Coloring of Graphs with no Induced Six-Vertex path 

  Char, Arnab (Indian Statistical Institute, Chennai, 2024-04)

  Graph coloring is one among the oldest and broadly studied topics in graph theory. A coloring of a graph G is an assignment of colors to the vertices of G such that no two adjacent vertices receive the same color, and ...
• Design and Analysis of Authenticated Encryption Modes 

  Bhattacharjee, Arghya (Indian Statistical Institute, Kolkata, 2024-09)

  This thesis proposes and analyses the security of a few symmetric key modes. The first three of them are NAEAD modes, named Oribatida, ISAP+ and OCB+. Oribatida is lightweight, sponge-based, INT-RUP secure and achieves ...
• Some Studies on Mathematical Morphology in Remotely Sensed Data Analysis 

  Barman, Geetika (Indian Statistical Institute, Bangalore, 2023-07)

  The application of Mathematical Morphology (MM) techniques has proven to be beneficial in the extraction of shapebased and texture-based features during remote sensing image analysis. The characteristics of these ...
• Variants of vertex and edge colorings of graphs 

  Pattanayak, Drimit (Indian Statistical Institute, Kolkata, 2024-07)

  A k-linear coloring of a graph G is an edge coloring of G with k colors so that each color class forms a linear forest—a forest whose each connected component is a path. The linear arboricity χ′ l(G) of G is the minimum ...
• Embedding problems for the ´etale fundamental group of curves 

  Mandal, Poulami (Indian Statistical Institute, Bangalore, 2024-08)

  Let X be a smooth projective curve over an algebraically closed field k of char- acteristic p > 0, S be a finite subset of closed points in X. Given an embedding problem (β : Γ ↠ G, α : π´et 1 (X \S) ↠ G) for the ´etale ...
• Enhanced Security Approaches for Data Protection: Managing Consent, Data Breach, and Asset Inheritance 

  Singh, Ram Govind (Indian Statistical Institute, Kolkata, 2024-07)

  The journey of the Indian data protection framework started in 2018 with the introduction of the initial draft as ``Personal Data Protection Bill (PDPB-2018)''. Subsequently, a revised draft PDPB-2019 was introduced. This ...
• Algorithms and Applications in Complex Network Representation, Classification and Manipulation 

  Chowdhury, Anjan (Indian Statistical Institute, Kolkata, 2024-07)

  A complex network is a useful model for many real-world systems. Recently, much effort has been put into studying the insights of the complex network. This thesis is all about the study of complex networks. Based on the ...
• Essays in Decision Theory 

  Bhardwaj, Bhavook (Indian Statistical Institute, Delhi, 2024-05)

  This thesis contains three chapters on individual decision-making and choice. The first chapter introduces a general model of decision-making where alternatives are sequentially examined by a decision maker. Our main ...
• Cancellations in Short Sums related to Hecke-Cusp Forms 

  Ghosh, Aritra (Indian Statistical Institute, Kolkata, 2024-04)

  In number theory, a problem which arises in a variety of contexts is getting non- trivial cancellation for the general correlation problem, specially when we assume that they are short sums related to Hecke-cusp forms. ...
• Bilateral Trade and Partnership with Loss Averse Agents 

  Dalakoti, Harshika (Indian Statistical Institute,Delhi, 2023-07)

  This thesis consists of three essays on bilateral trading and partnership with loss averse agents. All the three essays consider the same model where two loss averse agents (Tversky and Kahneman (1991), K ̈oszegi and Rabin ...

View more