<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.10.0">Jekyll</generator><link href="https://anirudh-c.github.io/feed.xml" rel="self" type="application/atom+xml" /><link href="https://anirudh-c.github.io/" rel="alternate" type="text/html" /><updated>2026-10-26T20:17:48+00:00</updated><id>https://anirudh-c.github.io/feed.xml</id><title type="html">anirudh chandramouli</title><subtitle>I think about cryptography and secure computation
</subtitle><author><name>Anirudh Chandramouli</name></author><entry><title type="html">HELLO, GOODBYE: Concurrent General Composition From Super-Rushing Security</title><link href="https://anirudh-c.github.io/hello-goodbye.html" rel="alternate" type="text/html" title="HELLO, GOODBYE: Concurrent General Composition From Super-Rushing Security" /><published>2026-10-27T00:00:00+00:00</published><updated>2026-10-27T00:00:00+00:00</updated><id>https://anirudh-c.github.io/hello-goodbye</id><content type="html" xml:base="https://anirudh-c.github.io/hello-goodbye.html"><![CDATA[]]></content><author><name>Anirudh Chandramouli</name></author><category term="publications" /><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">On the Communication and Latency of Unconditionally Secure Computation</title><link href="https://anirudh-c.github.io/phd-thesis.html" rel="alternate" type="text/html" title="On the Communication and Latency of Unconditionally Secure Computation" /><published>2026-01-01T00:00:00+00:00</published><updated>2026-01-01T00:00:00+00:00</updated><id>https://anirudh-c.github.io/phd-thesis</id><content type="html" xml:base="https://anirudh-c.github.io/phd-thesis.html"><![CDATA[<p>Write about your PhD thesis here.</p>]]></content><author><name>Anirudh Chandramouli</name></author><category term="theses" /><summary type="html"><![CDATA[Write about your PhD thesis here.]]></summary></entry><entry><title type="html">Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries</title><link href="https://anirudh-c.github.io/peeking-into-the-future.html" rel="alternate" type="text/html" title="Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries" /><published>2025-05-04T00:00:00+00:00</published><updated>2025-05-04T00:00:00+00:00</updated><id>https://anirudh-c.github.io/peeking-into-the-future</id><content type="html" xml:base="https://anirudh-c.github.io/peeking-into-the-future.html"><![CDATA[]]></content><author><name>Anirudh Chandramouli</name></author><category term="publications" /><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Simple Is COOL: Graded Dispersal and Its Applications for Byzantine Fault Tolerance</title><link href="https://anirudh-c.github.io/simple-is-cool.html" rel="alternate" type="text/html" title="Simple Is COOL: Graded Dispersal and Its Applications for Byzantine Fault Tolerance" /><published>2025-01-07T00:00:00+00:00</published><updated>2025-01-07T00:00:00+00:00</updated><id>https://anirudh-c.github.io/simple-is-cool</id><content type="html" xml:base="https://anirudh-c.github.io/simple-is-cool.html"><![CDATA[]]></content><author><name>Anirudh Chandramouli</name></author><category term="publications" /><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS</title><link href="https://anirudh-c.github.io/perfect-parallel-broadcast-constant-expected-rounds.html" rel="alternate" type="text/html" title="Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS" /><published>2024-05-26T00:00:00+00:00</published><updated>2024-05-26T00:00:00+00:00</updated><id>https://anirudh-c.github.io/perfect-parallel-broadcast-constant-expected-rounds</id><content type="html" xml:base="https://anirudh-c.github.io/perfect-parallel-broadcast-constant-expected-rounds.html"><![CDATA[]]></content><author><name>Anirudh Chandramouli</name></author><category term="publications" /><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Network Agnostic Perfectly Secure MPC Against General Adversaries</title><link href="https://anirudh-c.github.io/network-agnostic-perfectly-secure-mpc.html" rel="alternate" type="text/html" title="Network Agnostic Perfectly Secure MPC Against General Adversaries" /><published>2023-10-10T00:00:00+00:00</published><updated>2023-10-10T00:00:00+00:00</updated><id>https://anirudh-c.github.io/network-agnostic-perfectly-secure-mpc</id><content type="html" xml:base="https://anirudh-c.github.io/network-agnostic-perfectly-secure-mpc.html"><![CDATA[]]></content><author><name>Anirudh Chandramouli</name></author><category term="publications" /><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries</title><link href="https://anirudh-c.github.io/revisiting-efficiency-perfectly-secure-async-mpc-general-adversaries.html" rel="alternate" type="text/html" title="Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries" /><published>2022-12-11T00:00:00+00:00</published><updated>2022-12-11T00:00:00+00:00</updated><id>https://anirudh-c.github.io/revisiting-efficiency-perfectly-secure-async-mpc-general-adversaries</id><content type="html" xml:base="https://anirudh-c.github.io/revisiting-efficiency-perfectly-secure-async-mpc-general-adversaries.html"><![CDATA[]]></content><author><name>Anirudh Chandramouli</name></author><category term="publications" /><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees</title><link href="https://anirudh-c.github.io/perfectly-secure-synchronous-mpc-with-asynchronous-fallback.html" rel="alternate" type="text/html" title="Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees" /><published>2022-07-25T00:00:00+00:00</published><updated>2022-07-25T00:00:00+00:00</updated><id>https://anirudh-c.github.io/perfectly-secure-synchronous-mpc-with-asynchronous-fallback</id><content type="html" xml:base="https://anirudh-c.github.io/perfectly-secure-synchronous-mpc-with-asynchronous-fallback.html"><![CDATA[]]></content><author><name>Anirudh Chandramouli</name></author><category term="publications" /><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Unconditionally-Secure MPC with Dynamic Participation</title><link href="https://anirudh-c.github.io/masters-thesis.html" rel="alternate" type="text/html" title="Unconditionally-Secure MPC with Dynamic Participation" /><published>2022-01-01T00:00:00+00:00</published><updated>2022-01-01T00:00:00+00:00</updated><id>https://anirudh-c.github.io/masters-thesis</id><content type="html" xml:base="https://anirudh-c.github.io/masters-thesis.html"><![CDATA[<p>Write about your master’s thesis here.</p>]]></content><author><name>Anirudh Chandramouli</name></author><category term="theses" /><summary type="html"><![CDATA[Write about your master’s thesis here.]]></summary></entry></feed>