The hardness of LPN over any integer ring and field for PCG applications (Q6637566)

scientific article; zbMATH DE number 7943480

Language	Label	Description	Also known as
English	The hardness of LPN over any integer ring and field for PCG applications	scientific article; zbMATH DE number 7943480

Statements

instance of

scholarly article

0 references

title

The hardness of LPN over any integer ring and field for PCG applications (English)

0 references

0 references

0 references

0 references

0 references

13 November 2024

0 references

zbMATH Keywords

learning parity with noise

0 references

secure multi-party computation

0 references

zero-knowledge proofs

0 references

private set intersection

0 references

MaRDI profile type

Publication

0 references

cites work

Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN

0 references

A Statistical Decoding Algorithm for General Linear Block Codes

0 references

Garbling XOR gates ``for free'' in the standard model

0 references

Cryptography with Constant Input Locality

0 references

Progress in Cryptology – Mycrypt 2005

0 references

Moz$\mathbb{Z}_{2^k}$arella: efficient vector-OLE and zero-knowledge proofs over $\mathbb{Z}_{2^k}$

0 references

\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions

0 references

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

0 references

Improved cryptanalysis of UOV and Rainbow

0 references

Q4341754

0 references

Efficient pseudorandom correlation generators: silent OT extension and more

0 references

Efficient pseudorandom correlation generators from ring-LPN

0 references

Function Secret Sharing

0 references

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

0 references

A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions

0 references

Improved private set intersection for sets with small entries

0 references

Short signatures from regular syndrome decoding in the head

0 references

Statistical decoding 2.0: reducing decoding to LPN

0 references

Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm

0 references

Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes

0 references

$\mathrm{SPD}\mathbb {Z}_{2^k}$: efficient MPC $\mod 2^k$ for dishonest majority

0 references

Actively secure half-gates with minimum overhead under duplex networks

0 references

Multiparty Computation from Somewhat Homomorphic Encryption

0 references

Universally Composable Oblivious Transfer Based on a Variant of LPN

0 references

Authenticated garbling from simple correlations

0 references

On cryptography with auxiliary input

0 references

Syndrome Decoding Estimator

0 references

LPN decoded

0 references

McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD

0 references

Syndrome decoding in the head: shorter signatures from zero-knowledge proofs

0 references

Security Bounds for the Design of Code-Based Cryptosystems

0 references

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

0 references

TinyKeys: a new approach to efficient multi-party computation

0 references

Low cost constant round MPC combining BMR and oblivious transfer

0 references

Q4474165

0 references

Indistinguishability obfuscation from well-founded assumptions

0 references

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

0 references

Parallel and concurrent security of the HB and $HB^{+}$ protocols

0 references

Actively Secure OT Extension with Optimal Overhead

0 references

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

0 references

Efficient Encryption From Random Quasi-Cyclic Codes

0 references

Rigorous foundations for dual attacks in coding theory

0 references

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

0 references

A New Approach to Practical Active-Secure Two-Party Computation

0 references

Expand-convolute codes for pseudorandom correlation generators from LPN

0 references

VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE

0 references

Decoding One Out of Many

0 references

Q3835408

0 references

Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm

0 references

Analysis of Information Set Decoding for a Sub-linear Error Weight

0 references

Solving sparse linear equations over finite fields

0 references

Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN

0 references

Collision resistant hashing from sub-exponential learning parity with noise

0 references

Identifiers

zbMATH Open document ID

1548.9489

0 references

DOI

10.1007/978-3-031-58751-1_6

0 references

Mathematics Subject Classification ID

94A60

0 references

zbMATH DE Number

7943480

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6637566