Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007)

scientific article

Language	Label	Description	Also known as
English	Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN	scientific article

Statements

instance of

scholarly article

0 references

title

Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (English)

0 references

0 references

0 references

22 April 2022

0 references

zbMATH Keywords

foundations of cryptography

0 references

worst-case to average-case reduction

0 references

learning parity with noise

0 references

smoothing lemma

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-84252-9_16

0 references

cites work

Deterministic Approximation Algorithms for the Nearest Codeword Problem

0 references

Arithmetic Cryptography

0 references

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

0 references

Secure arithmetic computation with constant computational overhead

0 references

Cryptography with constant input locality

0 references

The hardness of approximate optima in lattices, codes, and systems of linear equations

0 references

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding

0 references

Q4828976

0 references

Smaller Decoding Exponents: Ball-Collision Decoding

0 references

Q4341754

0 references

Noise-tolerant learning, the parity problem, and the statistical query model

0 references

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

0 references

Classical hardness of learning with errors

0 references

Worst-case hardness for LPN and cryptographic hashing via code smoothing

0 references

Two-Round Man-in-the-Middle Security from LPN

0 references

Secure Computation from Random Error Correcting Codes

0 references

Universally Composable Oblivious Transfer Based on a Variant of LPN

0 references

Message Authentication, Revisited

0 references

Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification

0 references

Hardness of approximating the minimum distance of a linear code

0 references

An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding

0 references

Fully homomorphic encryption using ideal lattices

0 references

Maliciously secure oblivious linear function evaluation with constant overhead

0 references

Three XOR-Lemmas — An Exposition

0 references

Attribute-based encryption for circuits

0 references

Q4474165

0 references

Secure Arithmetic Computation with No Honest Majority

0 references

Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise

0 references

Authenticating Pervasive Devices with Human Protocols

0 references

Parallel and Concurrent Security of the HB and HB + Protocols

0 references

Efficient Authentication from Hard Learning Problems

0 references

An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices

0 references

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

0 references

Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs

0 references

Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Q3835408

0 references

Q4795836

0 references

Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN

0 references

Collision resistant hashing from sub-exponential learning parity with noise

0 references

Identifiers

DOI

10.1007/978-3-030-84252-9_16

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2129007