Author of the publication

Interactive Non-malleable Codes.

, , , , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 233-263. Springer, (2019)

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.

 

Other publications of authors with the same name

Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme & Its Consequences., , , , , , and . ITC, volume 230 of LIPIcs, page 16:1-16:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes., , , and . CRYPTO (3), volume 12827 of Lecture Notes in Computer Science, page 779-808. Springer, (2021)Interactive Non-malleable Codes., , , , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 233-263. Springer, (2019)Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks., , , , , , and . ISIT, page 976-981. IEEE, (2021)On Polynomial Secret Sharing Schemes., and . ITC, volume 163 of LIPIcs, page 12:1-12:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)MPC with Friends and Foes., , and . CRYPTO (2), volume 12171 of Lecture Notes in Computer Science, page 677-706. Springer, (2020)Improved Bound on the Local Leakage-resilience of Shamir's Secret Sharing., , , and . ISIT, page 2678-2683. IEEE, (2022)PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection., , , and . AsiaCCS, page 1098-1112. ACM, (2022)From randomizing polynomials to parallel algorithms., , and . ITCS, page 76-89. ACM, (2012)Statistical Randomized Encodings: A Complexity Theoretic View., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 1-13. Springer, (2015)