( en | de | ru )

 

Disambiguation of "Dachman-Soled, Dana"

Author of the publication

copydeleteadd this publication to your clipboard
Locally Decodable and Updatable Non-Malleable Codes in the Bounded Retrieval Model.

, , and . IACR Cryptology ePrint Archive, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Antonios K Danassis

María Soledad Stoll

Ataollah Danai

Ingeborg Danai

Michelle Danaher

 

Other publications of authors with the same name

On the Leakage Resilience of Ideal-Lattice Based Public Key Encryption., , , and . IACR Cryptology ePrint Archive, (2017)Non-Malleable Codes Against Bounded Polynomial Time Tampering., , , , and . EUROCRYPT (1), volume 11476 of Lecture Notes in Computer Science, page 501-530. Springer, (2019)Leakage-Tolerant Computation with Input-Independent Preprocessing., , and . CRYPTO (2), volume 8617 of Lecture Notes in Computer Science, page 146-163. Springer, (2014)Locally Decodable and Updatable Non-malleable Codes and Their Applications., , , and . J. Cryptol., 33 (1): 319-355 (2020)Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes., , and . Inf. Comput., (2019)BKW Meets Fourier New Algorithms for LPN with Sparse Parities., , , and . TCC (2), volume 13043 of Lecture Notes in Computer Science, page 658-688. Springer, (2021)Improved, black-box, non-malleable encryption from semantic security., , , and . Des. Codes Cryptogr., 86 (3): 641-663 (2018)Limits to Non-Malleability., , , and . IACR Cryptol. ePrint Arch., (2019)On the Privacy of Sublinear-Communication Jaccard Index Estimation via Min-hash Sketching., , , , and . IACR Cryptol. ePrint Arch., (2023)Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness., , , , and . ASIACRYPT (1), volume 9452 of Lecture Notes in Computer Science, page 337-359. Springer, (2015)