( en | de | ru )

 

Disambiguation of "Ghosal, Riddhi"

Author of the publication

copydeleteadd this publication to your clipboard
Hiding in Plain Sight: Memory-tight Proofs via Randomness Programming.

, , , and . IACR Cryptol. ePrint Arch., (2021)

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.

Samir Ansari {Arindam Ghosal, Vikash Kumar}

 

Other publications of authors with the same name

Hard Languages in $NP coNP$ and NIZK Proofs from Unstructured Hardness., , , , , and . IACR Cryptol. ePrint Arch., (2023)Building Hard Problems by Combining Easy Ones., and . ISIT, page 1770-1775. IEEE, (2023)Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness., , , , , and . STOC, page 1243-1256. ACM, (2023)Analysing Relations involving small number of Monomials in AES S- Box.. IACR Cryptology ePrint Archive, (2017)Non-Interactive Publicly-Verifiable Delegation of Committed Programs., , and . IACR Cryptol. ePrint Arch., (2022)Approximate Distance-Comparison-Preserving Symmetric Encryption., , , and . IACR Cryptol. ePrint Arch., (2021)Hiding in Plain Sight: Memory-Tight Proofs via Randomness Programming., , , and . EUROCRYPT (2), volume 13276 of Lecture Notes in Computer Science, page 706-735. Springer, (2022)Non-Interactive Publicly-Verifiable Delegation of Committed Programs., , and . Public Key Cryptography (2), volume 13941 of Lecture Notes in Computer Science, page 575-605. Springer, (2023)Hiding in Plain Sight: Memory-tight Proofs via Randomness Programming., , , and . IACR Cryptol. ePrint Arch., (2021)Privacy Preserving Multi-server k-means Computation over Horizontally Partitioned Data., and . ICISS, volume 11281 of Lecture Notes in Computer Science, page 189-208. Springer, (2018)