In today's world, rapid technological advancement has led to the generation of vast amounts of sensitive data, often in a distributed manner. Ensuring secure and controlled access to this data, while avoiding single points of failure, presents natural yet complex challenges in modern cryptography. My research explores how advanced cryptographic primitives can address these challenges.

In this talk, I will begin with a brief overview of my research interests, and then focus on one key theme: multi-input attribute-based encryption (k-ABE). This is a generalization of attribute-based encryption (ABE), which allows expressive access control over encrypted data. In ABE, a message is encrypted under an attribute x, and decryption keys correspond to policies f, allowing decryption only if f(x) = 1. In the multi-input setting, data is generated independently by k parties, each with input (x_i, m_i). A decryption key for a k-ary predicate f can recover all messages if and only if f(x₁,...,x_k) = 1. I will outline our formalization of k-ABE and highlight constructions under various assumptions. If time permits, I will briefly mention my work on threshold signatures and conclude with future research directions and open problems.

Short Bio: Anshu Yadav is currently a postdoctoral researcher at IST Austria. She received her PhD from IIT Madras, guided by Prof. Shweta Agrawal. Her research interests are in the area of theoretical cryptography in building various cryptographic primitives largely from post-quantum lattice-based cryptographic assumptions and some from classical assumptions as well.