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.
She also fixes a tuple(F, d,L,Ψ), where (a)F :=F 2, (b)d := 1, (c)L ⊆ {F 2 ∪ ⊥} md is the set of all truth tables for sufficiently small AC0[+]circuits (the symbol ⊥is not used)
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.