Anat Paskin-Cherniavsky

Orcid: 0000-0001-6566-2644

Affiliations:
  • Technion - Israel Institute of Technology, Computer Science Department, Haifa, Israel


According to our database1, Anat Paskin-Cherniavsky authored at least 38 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New results in Share Conversion, with applications to evolving access structures.
IACR Cryptol. ePrint Arch., 2024

Quantum Evolving Secret Sharing for General Access Structures.
IACR Cryptol. ePrint Arch., 2024

New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs.
IACR Cryptol. ePrint Arch., 2024

Constructing Leakage-Resilient Shamir's Secret Sharing: Over Composite Order Fields.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More.
IACR Cryptol. ePrint Arch., 2023

2022
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness.
IACR Cryptol. ePrint Arch., 2022

New Bounds and a Generalization for Share Conversion for 3-Server PIR.
Entropy, 2022

Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Improved Bound on the Local Leakage-resilience of Shamir's Secret Sharing.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme & Its Consequences.
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021
On perfectly secure 2PC in the OT-hybrid model.
Theor. Comput. Sci., 2021

Leakage-resilience of the Shamir Secret-sharing Scheme against Physical-bit Leakages.
IACR Cryptol. ePrint Arch., 2021

PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection.
IACR Cryptol. ePrint Arch., 2021

Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
On cryptographic anonymity and unpredictability in secret sharing.
Inf. Process. Lett., 2020

On Leakage-Resilient Secret Sharing.
IACR Cryptol. ePrint Arch., 2020

MPC with Friends and Foes.
IACR Cryptol. ePrint Arch., 2020

2019
On polynomial secret sharing schemes.
IACR Cryptol. ePrint Arch., 2019

On Share Conversions for Private Information Retrieval.
Entropy, 2019

Interactive Non-malleable Codes.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

2018
On Perfectly Secure 2PC in the OT-hybrid model.
IACR Cryptol. ePrint Arch., 2018

Secure Two-Party Computation over Unreliable Channels.
IACR Cryptol. ePrint Arch., 2018

2017
Coding for interactive communication beyond threshold adversaries.
IACR Cryptol. ePrint Arch., 2017

Evolving Secret Sharing: Dynamic Thresholds and Robustness.
IACR Cryptol. ePrint Arch., 2017

2016
How to infinitely share a secret more efficiently.
IACR Cryptol. ePrint Arch., 2016

2015
On Cryptographic Anonimity and Unpredicatbility in Secret Sharing.
IACR Cryptol. ePrint Arch., 2015

Statistical Randomized Encodings: A Complexity Theoretic View.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Secure Computation with Minimal Interaction, Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Locally Decodable Codes for edit distance.
IACR Cryptol. ePrint Arch., 2014

Non-Interactive Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2014

2013
Maliciously Circuit-private FHE.
IACR Cryptol. ePrint Arch., 2013

On the Power of Correlated Randomness in Secure Computation.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012
Secure computation with minimal interaction.
PhD thesis, 2012

From randomizing polynomials to parallel algorithms.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2010
Secure Multiparty Computation with Minimal Interaction.
Proceedings of the Advances in Cryptology, 2010

2008
On Linear Secret Sharing for Connectivity in Directed Graphs.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

2007
Evaluating Branching Programs on Encrypted Data.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007


  Loading...