Correlated pseudorandomness from expand-accumulate codes (Q6162058)

scientific article; zbMATH DE number 7703572

Language	Label	Description	Also known as
English	Correlated pseudorandomness from expand-accumulate codes	scientific article; zbMATH DE number 7703572

Statements

instance of

scholarly article

0 references

title

Correlated pseudorandomness from expand-accumulate codes (English)

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Advances in Cryptology – CRYPTO 2022

0 references

publication date

28 June 2023

0 references

zbMATH Keywords

pseudorandom correlation generator

0 references

pseudorandom correlation function

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-15979-4_21

0 references

cites work

Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub>

0 references

New Algorithms for Learning in Presence of Errors

0 references

A Statistical Decoding Algorithm for General Linear Block Codes

0 references

More on average case vs approximation complexity

0 references

Efficient Encryption From Random Quasi-Cyclic Codes

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 for mixed-mode and fixed-point secure computation

0 references

Q4035736

0 references

Sigma protocols for MQ, PKP and SIS, and fishy signature schemes

0 references

Q4341754

0 references

Functional Signatures and Pseudorandom Functions

0 references

Function Secret Sharing

0 references

Secure computation with preprocessing via function secret sharing

0 references

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

0 references

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

0 references

Smaller Decoding Exponents: Ball-Collision Decoding

0 references

Decoding linear codes with high error rate and its impact for LPN security

0 references

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

0 references

Pseudorandom Functions: Three Decades Later

0 references

On solving LPN using BKW and variants, Implementation and analysis

0 references

Optimization of $$\mathsf {LPN}$$ Solving Algorithms

0 references

Constrained Pseudorandom Functions and Their Applications

0 references

Secret-shared shuffle

0 references

A note on the communication complexity of multiparty computation in the correlated randomness model

0 references

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

0 references

Better security-efficiency trade-offs in permutation-based two-party computation

0 references

Spooky Encryption and Its Applications

0 references

The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited

0 references

Multiparty Computation from Somewhat Homomorphic Encryption

0 references

LPN decoded

0 references

Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem

0 references

Security Bounds for the Design of Code-Based Cryptosystems

0 references

On publicly-accountable zero-knowledge and small shuffle arguments

0 references

Q3729902

0 references

Solving LPN using covering codes

0 references

Good Variants of HB + Are Hard to Find

0 references

Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)

0 references

Low cost constant round MPC combining BMR and oblivious transfer

0 references

Advances in Cryptology - CRYPTO 2003

0 references

Secure Arithmetic Computation with No Honest Majority

0 references

Overdrive: making SPDZ great again

0 references

An Improved LPN Algorithm

0 references

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

0 references

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

0 references

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

0 references

On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes

0 references

The rise of Paillier: homomorphic secret sharing and public-key silent OT

0 references

Statistical Decoding Revisited

0 references

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

0 references

Linearization Attacks Against Syndrome Based Hashes

0 references

Q3835408

0 references

Q4409125

0 references

Faster Algorithms for Solving LPN

0 references

Identifiers

zbMATH Open document ID

1517.94073

0 references

DOI

10.1007/978-3-031-15979-4_21

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6162058