( en | de | ru )

 

Disambiguation of "Kulkarni, Mukul"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-Malleable Codes.

, , 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.

Mukul Agarwal

Jagadish Kulkarni

Mukul Lal

Praveen Kulkarni

Suchita Kulkarni

 

Other publications of authors with the same name

Locally Decodable and Updatable Non-Malleable Codes in the Bounded Retrieval Model., , and . IACR Cryptology ePrint Archive, (2017)Partial Key Exposure in Ring-LWE-Based Cryptosystems: Attacks and Resilience., , , and . IACR Cryptology ePrint Archive, (2018)Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes., , and . Public Key Cryptography (1), volume 10174 of Lecture Notes in Computer Science, page 310-332. Springer, (2017)Local Non-malleable Codes in the Bounded Retrieval Model., , and . Public Key Cryptography (2), volume 10770 of Lecture Notes in Computer Science, page 281-311. Springer, (2018)Helping Johnny encrypt: toward semantic interfaces for cryptographic frameworks., , , and . Onward!, page 180-196. ACM, (2016)Extending The Applicability of Non-Malleable Codes.. University of Maryland, College Park, MD, USA, (2019)base-search.net (ftunivmaryland:oai:drum.lib.umd.edu:1903/25179).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)Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes., , and . Inf. Comput., (2019)Don't Use It Twice! Solving Relaxed Linear Code Equivalence Problems., , , , and . IACR Cryptol. ePrint Arch., (2024)