Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK

No abstract is available for this paper.

• Publication year

  2025

• Venue

  Journal of Cryptology

• Publication date

  2025-09-11

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00145-025-09553-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Lossy Cryptography from Code-Based Assumptions

  2024cited by this paper
• Pseudorandom Correlation Functions from Variable-Density LPN, Revisited

  2023cited by this paper
• Oblivious Transfer with Constant Computational Overhead

  2023cited by this paper
• Searching for ELFs in the Cryptographic Forest

  2023cited by this paper
• Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE

  2023cited by this paper
• Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead

  2023influential reference
• An Efficient Key Recovery Attack on SIDH

  2023cited by this paper
• A Direct Key Recovery Attack on SIDH

  2023cited by this paper
• Expand-Convolute Codes for Pseudorandom Correlation Generators from LPN

  2023cited by this paper
• Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding

  2023cited by this paper
• Multi-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN

  2023influential reference
• Relinearization Attack On LPN Over Large Fields

  2023cited by this paper
• Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions

  2022cited by this paper
• Statistically Sender-Private OT from LPN and Derandomization

  2022cited by this paper
• New Constructions of Collapsing Hashes

  2022cited by this paper
• A simple and sharper proof of the hypergraph Moore bound

  2022cited by this paper
• Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols

  2022cited by this paper
• Breaking SIDH in polynomial time

  2022cited by this paper
• Correlated Pseudorandomness from Expand-Accumulate Codes

  2022cited by this paper
• Indistinguishability Obfuscation from LPN over F_p, DLIN, and PRGs in NC^0

  2021cited by this paper
• Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random

  2021cited by this paper
• Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes

  2021cited by this paper
• SNARGs for P from LWE

  2021cited by this paper
• Efficient Pseudorandom Correlation Generators from Ring-LPN

  2020cited by this paper
• Correlated Pseudorandom Functions from Variable-Density LPN

  2020cited by this paper
• Cryptographic Group Actions and Applications

  2020cited by this paper
• Indistinguishability obfuscation from well-founded assumptions

  2020cited by this paper
• Incompressible Encodings

  2020cited by this paper
• LESS is More: Code-Based Signatures Without Syndromes

  2020cited by this paper
• Low Error Efficient Computational Extractors in the CRS Model

  2020cited by this paper
• Witness Maps and Applications

  2020cited by this paper
• Extracting Randomness from Extractor-Dependent Sources

  2020cited by this paper
• Two-Round Oblivious Transfer from CDH or LPN

  2020cited by this paper
• Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error

  2019influential reference
• Collision Resistant Hashing from Sub-exponential Learning Parity with Noise

  2019cited by this paper
• CSI-FiSh: Efficient Isogeny based Signatures through Class Group Computations

  2019cited by this paper
• Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing

  2019influential reference
• Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors

  2019cited by this paper
• Efficient Pseudorandom Correlation Generators: Silent OT Extension and More

  2019cited by this paper
• Compressing Vector OLE

  2018cited by this paper
• Quantum FHE (Almost) As Secure as Classical

  2018cited by this paper
• Collusion resistant traitor tracing from learning with errors

  2018cited by this paper
• Classical Verification of Quantum Computations

  2018cited by this paper
• On the Concrete Security of Goldreich's Pseudorandom Generator

  2018cited by this paper
• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device

  2018cited by this paper
• CSIDH: An Efficient Post-Quantum Commutative Group Action

  2018cited by this paper
• Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions

  2018cited by this paper
• Lockable Obfuscation

  2017influential reference
• Laconic Oblivious Transfer and Its Applications

  2017cited by this paper
• All-But-Many Lossy Trapdoor Functions from Lattices and Applications

  2017cited by this paper
• LPN Decoded

  2017cited by this paper
• All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE

  2017cited by this paper
• Classical Homomorphic Encryption for Quantum Circuits

  2017cited by this paper
• Sum of squares lower bounds for refuting any CSP

  2017cited by this paper
• Low-Complexity Cryptographic Hash Functions

  2017cited by this paper
• Secure Arithmetic Computation with Constant Computational Overhead

  2017influential reference
• Obfuscating Compute-and-Compare Programs under LWE

  2017cited by this paper
• Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN

  2016cited by this paper
• The Magic of ELFs

  2016cited by this paper
• Algebraic attacks against random local functions and their countermeasures

  2016cited by this paper
• Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes

  2016cited by this paper
• Predicate Encryption for Circuits from LWE

  2015cited by this paper
• New McEliece cryptosystem based on polar codes as a candidate for post-quantum cryptography

  2014cited by this paper
• Simple Chosen-Ciphertext Security from Low-Noise LPN

  2014cited by this paper
• Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch

  2014cited by this paper
• Reducing the key length of mceliece cryptosystem using polar codes

  2014cited by this paper
• Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

  2014cited by this paper
• Attribute-based encryption for circuits

  2013cited by this paper
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

  2013cited by this paper
• An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes

  2013cited by this paper
• MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes

  2013cited by this paper
• A Dichotomy for Local Small-Bias Generators

  2012cited by this paper
• On the security of Goldreich’s one-way function

  2012cited by this paper
• Pseudorandom generators with long stretch and low locality from random local one-way functions

  2012cited by this paper
• IND-CCA Secure Cryptography Based on a Variant of the LPN Problem

  2012cited by this paper
• All-But-Many Lossy Trapdoor Functions

  2012cited by this paper
• Lossy Functions Do Not Amplify Well

  2012cited by this paper
• A New Version of McEliece PKC Based on Convolutional Codes

  2012cited by this paper
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

  2012cited by this paper
• New Algorithms for Learning in Presence of Errors

  2011cited by this paper
• Efficient Fully Homomorphic Encryption from (Standard) LWE

  2011cited by this paper
• Really Fast Syndrome-Based Hashing

  2011cited by this paper
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security

  2011cited by this paper
• Wild McEliece Incognito

  2011cited by this paper
• Candidate One-Way Functions Based on Expander Graphs

  2011cited by this paper
• Leaky Pseudo-Entropy Functions

  2011cited by this paper
• Public-key cryptography from different assumptions

  2010influential reference
• Instantiability of RSA-OAEP Under Chosen-Plaintext Attack

  2010cited by this paper
• Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes

  2010cited by this paper
• On Ideal Lattices and Learning with Errors over Rings

  2010cited by this paper
• Wild McEliece

  2010cited by this paper
• Efficient Lattice (H)IBE in the Standard Model

  2010cited by this paper
• Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms

  2009cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009cited by this paper
• Hedged Public-Key Encryption: How to Protect against Bad Randomness

  2009cited by this paper
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

  2009cited by this paper
• Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes

  2008cited by this paper
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles

  2008cited by this paper
• Lossy trapdoor functions and their applications

  2008influential reference
• Cryptography with constant computational overhead

  2008influential reference

• No citing papers are available for this paper.