Anat Paskin-Cherniavsky
Anat Paskin-Cherniavsky
Verified email at ariel.ac.il
Title
Cited by
Cited by
Year
Evaluating branching programs on encrypted data
Y Ishai, A Paskin
Theory of Cryptography Conference, 575-594, 2007
2282007
On the power of correlated randomness in secure computation
Y Ishai, E Kushilevitz, S Meldgaard, C Orlandi, A Paskin-Cherniavsky
Theory of Cryptography Conference, 600-620, 2013
792013
Non-interactive secure multiparty computation
A Beimel, A Gabizon, Y Ishai, E Kushilevitz, S Meldgaard, ...
Annual Cryptology Conference, 387-404, 2014
712014
Maliciously Circuit-private FHE
R Ostrovsky, A Paskin-Cherniavsky, B Paskin-Cherniavsky
IACR Cryptology ePrint Archive 2013 (307), 2013
442013
Secure multiparty computation with minimal interaction
Y Ishai, E Kushilevitz, A Paskin
Annual Cryptology Conference, 577-594, 2010
442010
Secure computation with minimal interaction, revisited
Y Ishai, R Kumaresan, E Kushilevitz, A Paskin-Cherniavsky
Annual Cryptology Conference, 359-378, 2015
372015
Evolving secret sharing: dynamic thresholds and robustness
I Komargodski, A Paskin-Cherniavsky
Theory of Cryptography Conference, 379-393, 2017
272017
Statistical randomized encodings: A complexity theoretic view
S Agrawal, Y Ishai, D Khurana, A Paskin-Cherniavsky
International Colloquium on Automata, Languages, and Programming, 1-13, 2015
92015
Leakage-resilience of the Shamir Secret-sharing Scheme against Physical-bit Leakages
HK Maji, HH Nguyen, A Paskin-Cherniavsky, T Suad, M Wang
Annual International Conference on the Theory and Applications of …, 2021
42021
Psimple: Practical multiparty maliciously-secure private set intersection
AB Efraim, O Nissenbaum, E Omri, A Paskin-Cherniavsky
Cryptology ePrint Archive, Report 2021/122, 2021. https://eprint. iacr. org …, 2021
42021
Constructing Locally Leakage-resilient Linear Secret-sharing Schemes
H Maji, A Paskin-Cherniavsky, T Suad, M Wang
Cryptology ePrint Archive, 2020
42020
How to infinitely share a secret more efficiently.
A Paskin-Cherniavsky
IACR Cryptol. ePrint Arch. 2016, 1088, 2016
42016
Locally Decodable Codes for edit distance
R Ostrovsky, A Paskin-Cherniavsky
IACR Cryptology ePrint Archive 2014 (260), 2014
42014
From randomizing polynomials to parallel algorithms
Y Ishai, E Kushilevitz, A Paskin-Cherniavsky
Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012
42012
Secure computation with minimal interaction
A Paskin-Cherniavsky, Y Ishai, E Kushilevitz
Computer Science Department, Technion, 2012
42012
On linear secret sharing for connectivity in directed graphs
A Beimel, A Paskin
International Conference on Security and Cryptography for Networks, 172-184, 2008
42008
Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks
DQ Adams, HK Maji, HH Nguyen, ML Nguyen, A Paskin-Cherniavsky, ...
2021 IEEE International Symposium on Information Theory (ISIT), 976-981, 2021
32021
On polynomial secret sharing schemes
A Paskin-Chernivasky, A Radune
Cryptology ePrint Archive, 2019
32019
MPC with Friends and Foes
B Alon, E Omri, A Paskin-Cherniavsky
Annual International Cryptology Conference, 677-706, 2020
22020
On cryptographic anonymity and unpredictability in secret sharing
A Paskin-Cherniavsky, RF Olimid
Information Processing Letters 161, 105965, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20