README.md

@@ -6,6 +6,10 @@ Adithya Vadapalli, avadapalli@cse.iitk.ac.in
 
 PRAC implements three-party secure computation, with a particular focus on computations that require random access to memory.  Parties 0 and 1 are the computational peers, while party 2 is the server.  The server aids the computation, but generally does much less than the two computational peers.
 
+This work appeared in:
+
+Sajin Sasy, Adithya Vadapalli, Ian Goldberg. "PRAC: Round-Efficient 3-Party MPC for Dynamic Data Structures". Proceedings on Privacy Enhancing Technologies 2024(3).  [https://eprint.iacr.org/2023/1897](https://eprint.iacr.org/2023/1897).
+
 ----------
 
 ## Looking for the reproduction instructions?