Lossy Cryptography from Code-Based Assumptions

ePrint Report: Lossy Cryptography from Code-Based Assumptions

Quang Dao, Aayush Jain

Over the past few decades, we have seen a proliferation of advanced cryptographic primitives with lossy or homomorphic properties built from various assumptions such as Quadratic Residuosity, Decisional Diffie-Hellman, and Learning with Errors. These primitives imply hard problems in the complexity class $\mathcal{SZK}$ (statistical zero-knowledge); as a consequence, they can only be based on assumptions that are broken in $\mathcal{BPP}^{\mathcal{SZK}}$. This poses a barrier for building advanced primitives from …

advanced class code complexity cryptographic cryptography dao diffie eprint report errors hard hellman imply lossy problems proliferation report