Anat Paskin-Cherniavsky
Anat Paskin-Cherniavsky
Verifierad e-postadress på ariel.ac.il
Titel
Citeras av
Citeras av
År
Evaluating branching programs on encrypted data
Y Ishai, A Paskin
Theory of Cryptography Conference, 575-594, 2007
2102007
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
682013
Non-interactive secure multiparty computation
A Beimel, A Gabizon, Y Ishai, E Kushilevitz, S Meldgaard, ...
Annual Cryptology Conference, 387-404, 2014
512014
Secure multiparty computation with minimal interaction
Y Ishai, E Kushilevitz, A Paskin
Annual Cryptology Conference, 577-594, 2010
362010
Maliciously Circuit-private FHE
R Ostrovsky, A Paskin-Cherniavsky, B Paskin-Cherniavsky
IACR Cryptology ePrint Archive 2013 (307), 2013
322013
Secure computation with minimal interaction, revisited
Y Ishai, R Kumaresan, E Kushilevitz, A Paskin-Cherniavsky
Annual Cryptology Conference, 359-378, 2015
272015
Evolving secret sharing: dynamic thresholds and robustness
I Komargodski, A Paskin-Cherniavsky
Theory of Cryptography Conference, 379-393, 2017
162017
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
82015
How to infinitely share a secret more efficiently.
A Paskin-Cherniavsky
IACR Cryptol. ePrint Arch. 2016, 1088, 2016
42016
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
22012
On linear secret sharing for connectivity in directed graphs
A Beimel, A Paskin
International Conference on Security and Cryptography for Networks, 172-184, 2008
22008
On Polynomial Secret Sharing Schemes
A Paskin-Cherniavsky, R Artiom
1st Conference on Information-Theoretic Cryptography (ITC 2020), 2020
12020
Secure two-party computation over unreliable channels
R Gelles, A Paskin-Cherniavsky, V Zikas
International Conference on Security and Cryptography for Networks, 445-463, 2018
12018
Locally Decodable Codes for edit distance
R Ostrovsky, A Paskin-Cherniavsky
IACR Cryptology ePrint Archive 2014 (260), 2014
12014
MPC with Friends and Foes
B Alon, E Omri, A Paskin-Cherniavsky
Annual International Cryptology Conference, 677-706, 2020
2020
On Cryptographic Anonymity and Unpredictability in Secret Sharing
A Paskin-Cherniavsky, RF Olimid
Information Processing Letters, 105965, 2020
2020
On Perfectly Secure 2PC in the OT-Hybrid Model
B Alon, A Paskin-Cherniavsky
Theory of Cryptography Conference, 561-595, 2019
2019
Interactive Non-malleable Codes
N Fleischhacker, V Goyal, A Jain, A Paskin-Cherniavsky, S Radune
Theory of Cryptography Conference, 233-263, 2019
2019
Interactive Non-malleable Codes
A Paskin-Cherniavsky, S Radune
Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019
2019
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20