Evaluating Branching Programs on Encrypted Data. - Yuval Ishai; Anat Paskin (TCC, 2007)

On Linear Secret Sharing for Connectivity in Directed Graphs. - Amos Beimel; Anat Paskin (SCN, 2008)

Secure Multiparty Computation with Minimal Interaction. - Yuval Ishai; Eyal Kushilevitz; Anat Paskin (CRYPTO, 2010)

From randomizing polynomials to parallel algorithms. - Yuval Ishai; Eyal Kushilevitz; Anat Paskin-Cherniavsky (ITCS, 2012)

Secure computation with minimal interaction. - Anat Paskin-Cherniavsky (2012)

On the Power of Correlated Randomness in Secure Computation. - Yuval Ishai; Eyal Kushilevitz; Sigurd Meldgaard; Claudio Orlandi; Anat Paskin-Cherniavsky (TCC, 2013)

Maliciously Circuit-private FHE. - Rafail Ostrovsky; Anat Paskin-Cherniavsky; Beni Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2013)

Non-Interactive Secure Multiparty Computation. - Amos Beimel; Ariel Gabizon; Yuval Ishai; Eyal Kushilevitz; Sigurd Meldgaard; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2014)

Locally Decodable Codes for edit distance. - Rafail Ostrovsky; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2014)

Secure Computation with Minimal Interaction, Revisited. - Yuval Ishai; Ranjit Kumaresan; Eyal Kushilevitz; Anat Paskin-Cherniavsky (CRYPTO (2), 2015)

Statistical Randomized Encodings: A Complexity Theoretic View. - Shweta Agrawal 001; Yuval Ishai; Dakshita Khurana; Anat Paskin-Cherniavsky (ICALP (1), 2015)

On Cryptographic Anonimity and Unpredicatbility in Secret Sharing. - Ruxandra F. Olimid; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2015)

How to infinitely share a secret more efficiently. - Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2016)

Evolving Secret Sharing: Dynamic Thresholds and Robustness. - Ilan Komargodski; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2017)

Coding for interactive communication beyond threshold adversaries. - Anat Paskin-Cherniavsky; Slava Radune (IACR Cryptol. ePrint Arch., 2017)

Secure Two-Party Computation over Unreliable Channels. - Ran Gelles; Anat Paskin-Cherniavsky; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2018)

On Perfectly Secure 2PC in the OT-hybrid model. - Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2018)

Interactive Non-malleable Codes. - Nils Fleischhacker; Vipul Goyal; Abhishek Jain 002; Anat Paskin-Cherniavsky; Slava Radune (TCC (2), 2019)

On Share Conversions for Private Information Retrieval. - Anat Paskin-Cherniavsky; Leora Schmerler (Entropy, 2019)

On polynomial secret sharing schemes. - Anat Paskin-Cherniavsky; Artiom Radune (IACR Cryptol. ePrint Arch., 2019)

MPC with Friends and Foes. - Bar Alon; Eran Omri; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2020)

On Leakage-Resilient Secret Sharing. - Hemanta K. Maji; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2020)

On cryptographic anonymity and unpredictability in secret sharing. - Anat Paskin-Cherniavsky; Ruxandra F. Olimid (Inf. Process. Lett., 2020)

Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes. - Hemanta K. Maji; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001 (CRYPTO (3), 2021)

Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks. - Donald Q. Adams; Hemanta K. Maji; Hai H. Nguyen; Minh L. Nguyen; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001 (ISIT, 2021)

PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. - Aner Ben-Efraim; Olga Nissenbaum; Eran Omri; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2021)

Leakage-resilience of the Shamir Secret-sharing Scheme against Physical-bit Leakages. - Hemanta K. Maji; Hai H. Nguyen; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2021)

On perfectly secure 2PC in the OT-hybrid model. - Bar Alon; Anat Paskin-Cherniavsky (Theor. Comput. Sci., 2021)

Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme & Its Consequences. - Hemanta K. Maji; Hai H. Nguyen; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001; Xiuyu Ye; Albert Yu 003 (ITC, 2022)

Improved Bound on the Local Leakage-resilience of Shamir's Secret Sharing. - Hemanta K. Maji; Hai H. Nguyen; Anat Paskin-Cherniavsky; Mingyuan Wang 001 (ISIT, 2022)

Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family. - Hemanta K. Maji; Hai H. Nguyen; Anat Paskin-Cherniavsky; Tom Suad; Mingyuan Wang 001; Xiuyu Ye; Albert Yu 003 (TCC (1), 2022)

New Bounds and a Generalization for Share Conversion for 3-Server PIR. - Anat Paskin-Cherniavsky; Olga Nissenbaum (Entropy, 2022)

On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. - Bar Alon; Olga Nissenbaum; Eran Omri; Anat Paskin-Cherniavsky; Arpita Patra (IACR Cryptol. ePrint Arch., 2022)

MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. - Hannah Keller; Claudio Orlandi; Anat Paskin-Cherniavsky; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2023)

Constructing Leakage-Resilient Shamir's Secret Sharing: Over Composite Order Fields. - Hemanta K. Maji; Hai H. Nguyen; Anat Paskin-Cherniavsky; Xiuyu Ye (EUROCRYPT (4), 2024)

New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. - Bar Alon; Amos Beimel; Tamar Ben David; Eran Omri; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2024)

Quantum Evolving Secret Sharing for General Access Structures. - Efrat Cohen; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2024)

New results in Share Conversion, with applications to evolving access structures. - Tamar Ben David; Varun Narayanan; Olga Nissenbaum; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2024)

Tight Lower Bounds and New Upper Bounds For Evolving CDS. - Tamar Ben David; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2025)