default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnat Paskin-Cherniavsky
Person information
- affiliation: Technion - Israel Institute of Technology, Computer Science Department, Haifa, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Xiuyu Ye:
Constructing Leakage-Resilient Shamir's Secret Sharing: Over Composite Order Fields. EUROCRYPT (4) 2024: 286-315- [i19]Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky:
New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. IACR Cryptol. ePrint Arch. 2024: 419 (2024) - [i18]Efrat Cohen, Anat Paskin-Cherniavsky:
Quantum Evolving Secret Sharing for General Access Structures. IACR Cryptol. ePrint Arch. 2024: 912 (2024) - [i17]Tamar Ben David, Varun Narayanan, Olga Nissenbaum, Anat Paskin-Cherniavsky:
New results in Share Conversion, with applications to evolving access structures. IACR Cryptol. ePrint Arch. 2024: 1781 (2024) - 2023
- [c25]Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, Divya Ravi:
MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. ITC 2023: 11:1-11:22 - [i16]Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, Divya Ravi:
MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. IACR Cryptol. ePrint Arch. 2023: 683 (2023) - 2022
- [j4]Anat Paskin-Cherniavsky
, Olga Nissenbaum:
New Bounds and a Generalization for Share Conversion for 3-Server PIR. Entropy 24(4): 497 (2022) - [c24]Aner Ben-Efraim, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky:
PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. AsiaCCS 2022: 1098-1112 - [c23]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang, Xiuyu Ye, Albert Yu:
Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme & Its Consequences. ITC 2022: 16:1-16:19 - [c22]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Mingyuan Wang:
Improved Bound on the Local Leakage-resilience of Shamir's Secret Sharing. ISIT 2022: 2678-2683 - [c21]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang, Xiuyu Ye, Albert Yu:
Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family. TCC (1) 2022: 355-383 - [c20]Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra:
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. TCC (2) 2022: 532-561 - [i15]Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra:
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. IACR Cryptol. ePrint Arch. 2022: 1504 (2022) - 2021
- [j3]Bar Alon, Anat Paskin-Cherniavsky:
On perfectly secure 2PC in the OT-hybrid model. Theor. Comput. Sci. 891: 166-188 (2021) - [c19]Hemanta K. Maji, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes. CRYPTO (3) 2021: 779-808 - [c18]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages. EUROCRYPT (2) 2021: 344-374 - [c17]Donald Q. Adams, Hemanta K. Maji, Hai H. Nguyen, Minh L. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks. ISIT 2021: 976-981 - [i14]Aner Ben-Efraim, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky:
PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. IACR Cryptol. ePrint Arch. 2021: 122 (2021) - [i13]Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Leakage-resilience of the Shamir Secret-sharing Scheme against Physical-bit Leakages. IACR Cryptol. ePrint Arch. 2021: 186 (2021) - 2020
- [j2]Anat Paskin-Cherniavsky, Ruxandra F. Olimid:
On cryptographic anonymity and unpredictability in secret sharing. Inf. Process. Lett. 161: 105965 (2020) - [c16]Bar Alon, Eran Omri, Anat Paskin-Cherniavsky:
MPC with Friends and Foes. CRYPTO (2) 2020: 677-706 - [c15]Anat Paskin-Cherniavsky, Artiom Radune:
On Polynomial Secret Sharing Schemes. ITC 2020: 12:1-12:21 - [i12]Bar Alon, Eran Omri, Anat Paskin-Cherniavsky:
MPC with Friends and Foes. IACR Cryptol. ePrint Arch. 2020: 701 (2020) - [i11]Hemanta K. Maji, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
On Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2020: 1517 (2020)
2010 – 2019
- 2019
- [j1]Anat Paskin-Cherniavsky, Leora Schmerler:
On Share Conversions for Private Information Retrieval. Entropy 21(9): 826 (2019) - [c14]Nils Fleischhacker, Vipul Goyal, Abhishek Jain, Anat Paskin-Cherniavsky, Slava Radune:
Interactive Non-malleable Codes. TCC (2) 2019: 233-263 - [c13]Bar Alon, Anat Paskin-Cherniavsky:
On Perfectly Secure 2PC in the OT-Hybrid Model. TCC (1) 2019: 561-595 - [i10]Anat Paskin-Cherniavsky, Artiom Radune:
On polynomial secret sharing schemes. IACR Cryptol. ePrint Arch. 2019: 361 (2019) - 2018
- [c12]Ran Gelles, Anat Paskin-Cherniavsky, Vassilis Zikas:
Secure Two-Party Computation over Unreliable Channels. SCN 2018: 445-463 - [i9]Anat Paskin-Cherniavsky:
On Perfectly Secure 2PC in the OT-hybrid model. IACR Cryptol. ePrint Arch. 2018: 308 (2018) - [i8]Ran Gelles, Anat Paskin-Cherniavsky, Vassilis Zikas:
Secure Two-Party Computation over Unreliable Channels. IACR Cryptol. ePrint Arch. 2018: 506 (2018) - 2017
- [c11]Ilan Komargodski, Anat Paskin-Cherniavsky:
Evolving Secret Sharing: Dynamic Thresholds and Robustness. TCC (2) 2017: 379-393 - [i7]Anat Paskin-Cherniavsky, Slava Radune:
Coding for interactive communication beyond threshold adversaries. IACR Cryptol. ePrint Arch. 2017: 672 (2017) - [i6]Ilan Komargodski, Anat Paskin-Cherniavsky:
Evolving Secret Sharing: Dynamic Thresholds and Robustness. IACR Cryptol. ePrint Arch. 2017: 948 (2017) - 2016
- [i5]Anat Paskin-Cherniavsky:
How to infinitely share a secret more efficiently. IACR Cryptol. ePrint Arch. 2016: 1088 (2016) - 2015
- [c10]Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz, Anat Paskin-Cherniavsky:
Secure Computation with Minimal Interaction, Revisited. CRYPTO (2) 2015: 359-378 - [c9]Shweta Agrawal, Yuval Ishai, Dakshita Khurana, Anat Paskin-Cherniavsky:
Statistical Randomized Encodings: A Complexity Theoretic View. ICALP (1) 2015: 1-13 - [c8]Rafail Ostrovsky, Anat Paskin-Cherniavsky:
Locally Decodable Codes for Edit Distance. ICITS 2015: 236-249 - [i4]Ruxandra F. Olimid, Anat Paskin-Cherniavsky:
On Cryptographic Anonimity and Unpredicatbility in Secret Sharing. IACR Cryptol. ePrint Arch. 2015: 1234 (2015) - 2014
- [c7]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky:
Non-Interactive Secure Multiparty Computation. CRYPTO (2) 2014: 387-404 - [c6]Rafail Ostrovsky, Anat Paskin-Cherniavsky, Beni Paskin-Cherniavsky:
Maliciously Circuit-Private FHE. CRYPTO (1) 2014: 536-553 - [i3]Rafail Ostrovsky, Anat Paskin-Cherniavsky:
Locally Decodable Codes for edit distance. IACR Cryptol. ePrint Arch. 2014: 260 (2014) - [i2]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky:
Non-Interactive Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 960 (2014) - 2013
- [c5]Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky:
On the Power of Correlated Randomness in Secure Computation. TCC 2013: 600-620 - [i1]Rafail Ostrovsky, Anat Paskin-Cherniavsky, Beni Paskin-Cherniavsky:
Maliciously Circuit-private FHE. IACR Cryptol. ePrint Arch. 2013: 307 (2013) - 2012
- [b1]Anat Paskin-Cherniavsky:
Secure computation with minimal interaction. Technion - Israel Institute of Technology, Israel, 2012 - [c4]Yuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky:
From randomizing polynomials to parallel algorithms. ITCS 2012: 76-89 - 2010
- [c3]Yuval Ishai, Eyal Kushilevitz, Anat Paskin:
Secure Multiparty Computation with Minimal Interaction. CRYPTO 2010: 577-594
2000 – 2009
- 2008
- [c2]Amos Beimel, Anat Paskin:
On Linear Secret Sharing for Connectivity in Directed Graphs. SCN 2008: 172-184 - 2007
- [c1]Yuval Ishai, Anat Paskin:
Evaluating Branching Programs on Encrypted Data. TCC 2007: 575-594
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
