Collision resistant hashing from sub-exponential learning parity with noise

DOI10.1007/978-3-030-34621-8_1MaRDI QIDQ2176637zbMATH OpenOpenAlexFDO

Authors Yu Yu, Jiang Zhang, Jian Weng, Chun Guo, Xiangxue 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)

Recommendations

• Worst-case hardness for LPN and cryptographic hashing via code smoothing
• Pseudorandom functions in almost constant depth from low-noise LPN
• Cryptography from learning parity with noise
• Low-complexity cryptographic hash functions
• Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise

Cited in

(22)

• Anonymous IBE, leakage resilience and circular security from new assumptions
• On iterative collision search for LPN and subset sum
• Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
• Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
• Property-preserving hash functions for Hamming distance from standard assumptions
• On the complexity of collision resistant hash functions: new and old black-box separations
• Worst-case hardness for LPN and cryptographic hashing via code smoothing
• Low-complexity cryptographic hash functions
• Pseudorandom functions in almost constant depth from low-noise LPN
• New constructions of collapsing hashes
• An iterative correction method for practically LPN solving
• Combinatorially homomorphic encryption
• The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
• The hardness of LPN over any integer ring and field for PCG applications
• Lossy cryptography from code-based assumptions
• The quantum decoding problem
• Instance compression, revisited
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
• Limitations of the decoding-to-LPN reduction via code smoothing
• A note on low-communication secure multiparty computation via circuit depth-reduction
• Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
• Learning with errors with output dependencies: LWE, LWR, and physical learning problems under the same umbrella

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176637)