Abstract

Abstract

In recent times, the development of the zkSNARKs protocols opens up many applications to prove the authenticity of the data, computations and also the sender without revealing the secret data with very little communication and verification cost. However, resource-constrained devices&...

The way we store and manage data has changed dramatically with the rise of cloud storage. However, keeping our data safe for the long haul requires us to stay vigilant. According to NIST, one important way to do this is by regularly changing the encryption &#x...

Shor’s factoring algorithm is one of the most eagerly awaited applications of quantum computing, promising to revolutionise fields such as cryptography by efficiently factoring large integers, a task that is computationally intensive for classical computers. Currently, the limited capabil...

In this research, we propose a comprehensive framework for uncovering hidden patterns, selecting optimal features, and reducing dimensionality in large datasets, particularly focusing on 10K x 10K dimensional data. Traditional methods often struggle to efficiently handle such vast datasets due to...

Secure Multi Party Computation (MPC) in a three-party honest majority setting is currently the most used cryptographic primitive for running machine learning algorithms in a privacy-preserving manner. Although MPC typically operates with integers, it becomes necessary to extend its&...

Large Language Models are Machine Learning models that are trained on large text data, and have the capability to understand and generate human languages. Cryptographic techniques can be able to protect both the input and output privacy of the users. Secure Multi-Party ...

Blockchain technologies have received a lot of attention over the past years. The fundamental part of each blockchain is the underlying consensus mechanism that ensures the blockchain peers agree on the state of the blockchain ledger. One of the most popular blockchains,&#x...

This thesis is a compilation of provable security analyses of various cryptographic constructions in idealised models. The first construction examined is the ABR hash. We revisit the existing proof of the ABR hash in the random oracle model and identify significant errors&#...

We have examined various aspects of multiple hypothesis testing under dependence. Traditional algorithms designed to control the error arising from multiplicity become severely conservative when the hypotheses exhibit positive dependence, resulting in a loss of power. There is a pauc...

Abstract

In our usual life, data is all around us, everywhere we look! Now a days every individuals and organizations continue to generate, store, and share vast amounts of data and as a result the role of cloud storage becomes important to us. In the context of&...

Generating accurate SQL from natural language questions (text-to-SQL) is a longstanding challenge due to the complexities involved in understanding user queries, comprehending database schemas, and generating SQL statements. Traditional text-to-SQL systems have utilized human-engineered solutions and&#x...

With the rapid increase in digital images, it has become essential to have advanced systems to find specific images quickly from large collections. Traditional methods that depend on text descriptions often fail because tagging images manually is time-consuming and subjective. T...

In the bounded quantum storage model (BQSM), it is possible to realize oblivious transfer (OT) non-interactively. However, existing schemes are non-interactive only when the erasure rate is low. Quantum communication, even over short distances, is subject to relatively high erasure&#...

The role of embeddable cryptographic processors in revolutionizing defense communications for the Indian Navy bears immense significance. These processors serve as catalysts for a diverse range of novel applications critical to naval operations, encompassing tailored smartphones and robust...

In this work, we revisit Yao’s [Yao82] celebrated 1982 question concerning the collaborative computation of integer functions by a set of n parties, each initially possessing only their respective inputs. The challenge is to compute an integer function without revealing individual...

Owing to its adaptability in cryptographic protocols and possible defence against quantum attacks, lattice-based cryptography has become a very attractive topic. This survey explores the fundamental hard problems in lattice theory, such as the Shortest Vector Problem (SVP), the Close...