Expand-convolute codes for pseudorandom correlation generators from LPN

DOI10.1007/978-3-031-38551-3_19OpenAlexW4385654079MaRDI QIDQ6190124

Srinivasan Raghuraman, Titouan Tanguy, Peter Rindal

Publication date: 6 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38551-3_19

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• Efficient pseudorandom correlation generators: silent OT extension and more
• Candidate weak pseudorandom functions in AC ⁰ ○ MOD ₂
• Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem
• The intractability of computing the minimum distance of a code
• A Statistical Decoding Algorithm for General Linear Block Codes
• The Minimum Distance of Turbo-Like Codes
• Pseudorandom Functions: Three Decades Later
• Efficient Encryption From Random Quasi-Cyclic Codes
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Correlated pseudorandomness from expand-accumulate codes
• Statistical decoding 2.0: reducing decoding to LPN

This page was built for publication: Expand-convolute codes for pseudorandom correlation generators from LPN