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
2222007
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
752013
Non-interactive secure multiparty computation
A Beimel, A Gabizon, Y Ishai, E Kushilevitz, S Meldgaard, ...
Annual Cryptology Conference, 387-404, 2014
652014
Secure multiparty computation with minimal interaction
Y Ishai, E Kushilevitz, A Paskin
Annual Cryptology Conference, 577-594, 2010
422010
Maliciously Circuit-private FHE
R Ostrovsky, A Paskin-Cherniavsky, B Paskin-Cherniavsky
IACR Cryptology ePrint Archive 2013 (307), 2013
382013
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
232017
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
How to infinitely share a secret more efficiently.
A Paskin-Cherniavsky
IACR Cryptol. ePrint Arch. 2016, 1088, 2016
52016
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
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
32021
Locally Decodable Codes for edit distance
R Ostrovsky, A Paskin-Cherniavsky
IACR Cryptology ePrint Archive 2014 (260), 2014
32014
From randomizing polynomials to parallel algorithms
Y Ishai, E Kushilevitz, A Paskin-Cherniavsky
Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012
32012
Secure computation with minimal interaction
A Paskin-Cherniavsky, Y Ishai, E Kushilevitz
Computer Science Department, Technion, 2012
32012
MPC with friends and foes
B Alon, E Omri, A Paskin-Cherniavsky
Annual International Cryptology Conference, 677-706, 2020
22020
On Leakage-Resilient Secret Sharing.
HK Maji, A Paskin-Cherniavsky, T Suad, M Wang
IACR Cryptol. ePrint Arch. 2020, 1517, 2020
22020
On Polynomial Secret Sharing Schemes
A Paskin-Cherniavsky, R Artiom
1st Conference on Information-Theoretic Cryptography (ITC 2020), 2020
22020
On cryptographic anonymity and unpredictability in secret sharing
A Paskin-Cherniavsky, RF Olimid
Information Processing Letters 161, 105965, 2020
12020
Interactive Non-malleable Codes
N Fleischhacker, V Goyal, A Jain, A Paskin-Cherniavsky, S Radune
Theory of Cryptography Conference, 233-263, 2019
12019
On Share Conversions for Private Information Retrieval
A Paskin-Cherniavsky, L Schmerler
Entropy 21 (9), 826, 2019
12019
The system can't perform the operation now. Try again later.
Articles 1–20