A public-key encryption scheme with quasi-exponential security is constructed from the conjectured intractability of high-corruption LARP-CSP and kXOR problems, supported by lower bounds and a new error-correcting code.
Pr b∼PH,F [T(b) = 1]−Pr b∼QH,F [T(b) = 1] ≥ |Σ| −k/10 # is at most2 −|Σ|(4/5−o(1))k . We only prove the upper bound for Pr F ∼U
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Public Key Encryption from High-Corruption Constraint Satisfaction Problems
A public-key encryption scheme with quasi-exponential security is constructed from the conjectured intractability of high-corruption LARP-CSP and kXOR problems, supported by lower bounds and a new error-correcting code.