Anat Paskin-Cherniavsky

发表

Evolving Secret Sharing: Dynamic Thresholds and Robustness

Anat Paskin-Cherniavsky, Ilan Komargodski, Anat Paskin-Cherniavsky, 2017, TCC.

On cryptographic anonymity and unpredictability in secret sharing

Anat Paskin-Cherniavsky, Ruxandra F. Olimid, 2020, Inf. Process. Lett..

On Perfectly Secure 2PC in the OT-hybrid model

Anat Paskin-Cherniavsky, Anat Paskin-Cherniavsky, 2019, IACR Cryptol. ePrint Arch..

Secure Computation with Minimal Interaction, Revisited

Anat Paskin-Cherniavsky, Yuval Ishai, Eyal Kushilevitz, 2015, CRYPTO.

On Share Conversions for Private Information Retrieval

Anat Paskin-Cherniavsky, Leora Schmerler, 2019, Entropy.

Maliciously Circuit-Private FHE

Anat Paskin-Cherniavsky, Rafail Ostrovsky, Beni Paskin-Cherniavsky, 2014, CRYPTO.

Non-Interactive Secure Multiparty Computation

Anat Paskin-Cherniavsky, Yuval Ishai, Eyal Kushilevitz, 2014, IACR Cryptol. ePrint Arch..

Coding for interactive communication beyond threshold adversaries

Anat Paskin-Cherniavsky, Slava Radune, Anat Paskin-Cherniavsky, 2017, IACR Cryptol. ePrint Arch..

Secure Multiparty Computation with Minimal Interaction

Anat Paskin-Cherniavsky, Yuval Ishai, Eyal Kushilevitz, 2010, CRYPTO.

On Cryptographic Anonimity and Unpredicatbility in Secret Sharing

Anat Paskin-Cherniavsky, Ruxandra F. Olimid, Anat Paskin-Cherniavsky, 2015, IACR Cryptol. ePrint Arch..

On Leakage-Resilient Secret Sharing

Anat Paskin-Cherniavsky, Hemanta K. Maji, Mingyuan Wang, 2020, IACR Cryptol. ePrint Arch..

On Linear Secret Sharing for Connectivity in Directed Graphs

Anat Paskin-Cherniavsky, Amos Beimel, 2008, SCN.

From randomizing polynomials to parallel algorithms

Anat Paskin-Cherniavsky, Yuval Ishai, Eyal Kushilevitz, 2012, ITCS '12.

Secure Two-Party Computation over Unreliable Channels

Anat Paskin-Cherniavsky, Ran Gelles, Vassilis Zikas, 2018, IACR Cryptol. ePrint Arch..

Statistical Randomized Encodings: A Complexity Theoretic View

Anat Paskin-Cherniavsky, Yuval Ishai, Dakshita Khurana, 2015, ICALP.

On the Power of Correlated Randomness in Secure Computation

Anat Paskin-Cherniavsky, Yuval Ishai, Eyal Kushilevitz, 2013, TCC.

Locally Decodable Codes for Edit Distance

Anat Paskin-Cherniavsky, Rafail Ostrovsky, 2015, ICITS.

On polynomial secret sharing schemes

Anat Paskin-Cherniavsky, Artiom Radune, Anat Paskin-Cherniavsky, 2019, IACR Cryptol. ePrint Arch..

Evaluating Branching Programs on Encrypted Data

Anat Paskin-Cherniavsky, Yuval Ishai, Y. Ishai, 2007, TCC.

Interactive Non-malleable Codes

Anat Paskin-Cherniavsky, Vipul Goyal, Abhishek Jain, 2019, TCC.

How to infinitely share a secret more efficiently

Anat Paskin-Cherniavsky, 2016, IACR Cryptol. ePrint Arch..

Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks

Anat Paskin-Cherniavsky, Hemanta K. Maji, H. K. Maji, 2021, 2021 IEEE International Symposium on Information Theory (ISIT).

PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection

Eran Omri, Anat Paskin-Cherniavsky, Aner Ben-Efraim, 2021, IACR Cryptol. ePrint Arch..

Leakage-resilience of the Shamir Secret-sharing Scheme against Physical-bit Leakages

Anat Paskin-Cherniavsky, Hemanta K. Maji, H. K. Maji, 2021, IACR Cryptol. ePrint Arch..

On perfectly secure 2PC in the OT-hybrid model

Anat Paskin-Cherniavsky, Bar Alon, 2021, Theor. Comput. Sci..

Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes

Anat Paskin-Cherniavsky, Hemanta K. Maji, H. K. Maji, 2021, CRYPTO.