Cryptology City
Search
Search
Dark mode
Light mode
Explorer
Cryptology City
Home
❯
Barriers
81 items under this folder.
C
I
N
C
coNP ⊆ AM collapses the polynomial hierarchy
I
IP ⊆ AM collapses the polynomial hierarchy
N
No algebraic reduction from DLOG to Schnorr signatures in the standard model
No algebraic reduction from non-interactive assumptions to optimally short structure-preserving signatures
No algebraic reduction from OMDL to two-round MuSig
No deterministic reduction from NP to OWP
No fixed-construction reduction from CCA1 security to CCA2 security
No fixed-construction reduction from CDH to DDH
No fixed-construction reduction from CPA security to CCA1 security
No fixed-construction reduction from CPA security to circular security of symmetric-key bit encryption
No fixed-construction reduction from CPA Security to IND$-CPA Security
No fixed-construction reduction from Fiat-Shamir + GKR to SNARK
No fixed-construction reduction from Fiat-Shamir + Hash function to DS
No fixed-construction reduction from Fiat-Shamir to NIZK
No fixed-construction reduction from HE to IND-CCA2 Security
No fixed-construction reduction from IND-CPA security to circular security for key cycles (iO)
No fixed-construction reduction from IND-CPA security to circular security for key cycles (LWE)
No fixed-construction reduction from IND-CPA security to circular security of bit encryption
No fixed-construction reduction from IND-sHIBE-CPA Security (Selective) to IND-HIBE-CPA Security
No fixed-construction reduction from selective to adaptive CP-ABE security
No free reduction from MIP* to MIP
No fully-black-box reduction from bounded-round assumptions to OMDL
No fully-black-box reduction from bounded-round assumptions to Schnorr identification under concurrent attack
No fully-black-box reduction from CRHF to average-case-hard SZK
No fully-black-box reduction from DDH to IBE
No fully-black-box reduction from Falsifiable assumption to SNARK
No fully-black-box reduction from iO + OWF to domain-invariant OWP
No fully-black-box reduction from iO + OWP to average-case-hard SZK
No fully-black-box reduction from iO + OWP to CRHF
No fully-black-box reduction from length-increasing injective OWF to OWP
No fully-black-box reduction from NP to one-round sublinear cPIR
No fully-black-box reduction from NP to size-verifiable OWF
No fully-black-box reduction from OIHF to OT
No fully-black-box reduction from OT to PKE
No fully-black-box reduction from OT to TDP
No fully-black-box reduction from OWF to four-message ZK arguments
No fully-black-box reduction from OWF to OWP
No fully-black-box reduction from OWF to passive-server SK-DEPIR
No fully-black-box reduction from PKE to injective TDF
No fully-black-box reduction from PKE to OT
No fully-black-box reduction from PKE to TDP
No fully-black-box reduction from PPAD hardness + OWF to KE
No fully-black-box reduction from PPAD hardness to OWF
No fully-black-box reduction from TDP to enhanced TDP
No fully-black-box reduction from TDP to VRF
No fully-black-box reduction from two-round OT to two-round semi-honest MPC
No Karp reduction from NP to GapSVP for γ ≥ √(n/log n) unless coNP ⊆ AM
No Karp reduction from NP to GapSVP for γ ≥ c√n unless NP = coNP
No non-adaptive reduction from NP to average-case NP hardness
No oracle-free-encoding reduction from ROM to public-key DEPIR with a sublinear key
No polynomially-preserving fully-black-box reduction from enhanced TDP to one-round sublinear cPIR
No polynomially-preserving fully-black-box reduction from TDP to one-round sublinear cPIR
No reduction from AGM to GGM
No reduction from authenticated channels to Byzantine broadcast
No reduction from authenticated channels to fair coin flipping
No reduction from authenticated channels to fair MPC
No reduction from authenticated channels to UC MPC
No reduction from iO to statistical iO
No reduction from NP to compact FHE
No reduction from NP to OWF
No reduction from ORAM to sub-square-root one-round balls-and-bins ORAM
No reduction from ORAM to sublogarithmic-overhead balls-and-bins ORAM
No reduction from ORAM to sublogarithmic-overhead ORAM
No reduction from ROM to KE
No reduction from ZKP to Argument systems
No relativizing reduction from AM to PP
No relativizing reduction from BQP to NP
No relativizing reduction from KE to PKE
No relativizing reduction from KE to TDP
No relativizing reduction from OWF to OT
No relativizing reduction from OWF to PKE
No relativizing reduction from OWP to CRHF
No relativizing reduction from OWP to KE
No relativizing reduction from QMA to QCMA
No shielding black-box reduction from CPA-secure PKE to CCA1-secure PKE
No single-instance reduction from DLOG to Schnorr signatures in the non-programmable ROM
No straight-line reduction from FAC to low-exponent RSA
No tight algebraic reduction from DLOG to Schnorr signatures in the ROM
No tight generic reduction from DLOG to Schnorr signatures
No tight simple reduction from non-interactive assumptions to BLS signatures
No tight simple reduction from non-interactive assumptions to Waters signatures