Mukul Kulkarni

According to our database1, Mukul Kulkarni authored at least 27 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
PERK: compact signature scheme based on a new variant of the permuted kernel problem.
Des. Codes Cryptogr., August, 2024

Strong Existential Unforgeability and More of MPC-in-the-Head Signatures.
IACR Cryptol. ePrint Arch., 2024

Don't Use It Twice! Solving Relaxed Linear Code Equivalence Problems.
IACR Cryptol. ePrint Arch., 2024

Modelings for generic PoK and Applications: Shorter SD and PKP based Signatures.
IACR Cryptol. ePrint Arch., 2024

Properties of Lattice Isomorphism as a Cryptographic Group Action.
Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024

2023
Code-based signatures from new proofs of knowledge for the syndrome decoding problem.
Des. Codes Cryptogr., February, 2023

Lattice Isomorphism as a Group Action and Hard Problems on Quadratic Forms.
IACR Cryptol. ePrint Arch., 2023

2022
Quasi-Cyclic Stern Proof of Knowledge.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Towards a Ring Analogue of the Leftover Hash Lemma.
J. Math. Cryptol., 2021

(In)Security of Ring-LWE Under Partial Key Exposure.
J. Math. Cryptol., 2021

2020
Differentially-Private Multi-Party Sketching for Large-Scale Statistics.
Proc. Priv. Enhancing Technol., 2020

New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Extending The Applicability of Non-Malleable Codes.
PhD thesis, 2019

Limits to Non-Malleability.
IACR Cryptol. ePrint Arch., 2019

New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction.
IACR Cryptol. ePrint Arch., 2019

2018
Upper and Lower Bounds for Continuous Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2018

Partial Key Exposure in Ring-LWE-Based Cryptosystems: Attacks and Resilience.
IACR Cryptol. ePrint Arch., 2018

Non-Malleable Codes Against Bounded Polynomial Time Tampering.
IACR Cryptol. ePrint Arch., 2018

Local Non-malleable Codes in the Bounded Retrieval Model.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Locally Decodable and Updatable Non-Malleable Codes in the Bounded Retrieval Model.
IACR Cryptol. ePrint Arch., 2017

Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2017

On the Leakage Resilience of Ideal-Lattice Based Public Key Encryption.
IACR Cryptol. ePrint Arch., 2017

Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering.
IACR Cryptol. ePrint Arch., 2017

2016
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits.
IACR Cryptol. ePrint Arch., 2016

Toward Semantic Cryptography APIs.
Proceedings of the IEEE Cybersecurity Development, 2016

Helping Johnny encrypt: toward semantic interfaces for cryptographic frameworks.
Proceedings of the 2016 ACM International Symposium on New Ideas, 2016


  Loading...