Collision resistant hashing from sub-exponential learning parity with noise

DOI10.1007/978-3-030-34621-8_1zbMath1455.94200OpenAlexW2989843281MaRDI QIDQ2176637

Chun Guo, Yu Yu, Jian Weng, Jiang Zhang, Xiang-Xue Li

Publication date: 5 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-34621-8_1

zbMATH Keywords

collision resistant hash functionsymmetric-key cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ New constructions of collapsing hashes ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN

This page was built for publication: Collision resistant hashing from sub-exponential learning parity with noise