Skip to content

Multiparty Session Types: Separation and Encodability Results by Prof. Nobuko Yoshida

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti501 / Teams link will also be shared Abstract: Multiparty session types (MPST) are a type discipline for enforcing the structured, deadlock-free communication of concurrent and message-passing programs. Traditional MPST have a limited form of choice in which alternative communication possibilities are offered by a single participant and selected by another. Mixed choice multiparty… Read More »Multiparty Session Types: Separation and Encodability Results by Prof. Nobuko Yoshida

Relational Transformer: Toward Zero-Shot Foundation Models for Relational Data by Rishabh Ranjan

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti501 Abstract: Pretrained transformers readily adapt to new sequence modeling tasks via zero-shot prompting, but relational domains still lack architectures that transfer across datasets and tasks. The core challenge is the diversity of relational data, with varying heterogeneous schemas, graph structures and functional dependencies. In this talk, I will present the Relational Transformer (RT) architecture,… Read More »Relational Transformer: Toward Zero-Shot Foundation Models for Relational Data by Rishabh Ranjan

Traceable Secret Sharing: Strong Security and Efficient Constructions by Aditi Partap

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti 501 Abstract: Suppose Alice uses a t-out-of-n secret sharing to store her secret key on n servers. Her secret key is protected as long as t of them do not collude. However, what if a less-than-t subset of the servers decides to offer the shares they have for sale? In this case, Alice… Read More »Traceable Secret Sharing: Strong Security and Efficient Constructions by Aditi Partap

Online Flexible Busy Time Scheduling on Heterogeneous Machines by Gruia Calinescu

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti501 Abstract: We study the online busy time scheduling model on heterogeneous machines. In our setting, jobs with uniform length arrive online with a deadline that becomes known to the algorithm at the job's arrival time. An algorithm has access to machines, each with different associated capacities and costs. The goal is to schedule… Read More »Online Flexible Busy Time Scheduling on Heterogeneous Machines by Gruia Calinescu

Coping with choices – List Decoding in Coding Theory by Dr. Shashank Srivastava

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti-501/MS Teams Abstract: The goal of error correcting codes is to encode data in a way that allows for this data to be recovered even if the encoded copy is corrupted by an adversary. The usual algorithmic challenge associated with codes, called decoding, is to output the uncorrupted copy of data by looking only at… Read More »Coping with choices – List Decoding in Coding Theory by Dr. Shashank Srivastava

Agentic Information Seeking for Knowledge Acquisition by Revanth Reddy

SIT 001 Amar Nath and Shashi Khosla School of Information Technology, IIT Delhi, Hauz Khas, New Delhi 110016, India, Delhi, Delhi, India

Venue: SIT001 Abstract:  The vast expansion of online information has shifted the challenge from simply locating data to efficiently filtering and aggregating relevant content from diverse sources. This talk introduces innovative methodologies aimed at enhancing automated information seeking capabilities within intelligent systems. I will present a modular, agent-based framework that decomposes the information-seeking process into navigation,… Read More »Agentic Information Seeking for Knowledge Acquisition by Revanth Reddy

WhiteLie: A Robust System for Spoofing User Data in Android Platforms by Harish Yadav

SIT 113 Amar Nath and Shashi Khosla School of Information Technology, Indian Institute of Technology, Delhi, Hauz Khas, New Delhi, Delhi, India

Venue: SIT113 Abstract: The Android operating system uses a permission framework that allows users to control access to their private data, such as location and contacts, when using apps. However, many apps become non-functional or crash if denied these permissions, effectively pressuring users to grant access and compromising their privacy. In this paper, we introduce WhiteLie,… Read More »WhiteLie: A Robust System for Spoofing User Data in Android Platforms by Harish Yadav

Logical Relations for Formally Verified Authenticated Data Structures by Chaitanya Agarwal

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti501 Abstract: Authenticated data structures (ADSs) allow untrusted third parties to carry out operations which produce proofs that can be used to verify an operation’s output. Such data structures are challenging to develop and implement correctly. In this talk, I will talk about a library, Authentikit, that is implemented in OCaml, that generates authenticated… Read More »Logical Relations for Formally Verified Authenticated Data Structures by Chaitanya Agarwal

Lumos: A DSL for Language Model System Certification by Isha Chaudhary

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti 501 Abstract: As Language Model Systems (LMS) are deployed across an expanding range of applications, aligning them with human ethics has become crucial. Although recent works propose methods to formally certify LMS properties such as fairness, correct question answering, and safety, these approaches are generally ad hoc and hard to generalize. We introduce a principled… Read More »Lumos: A DSL for Language Model System Certification by Isha Chaudhary