Shelah's strong hypothesis is that $\mathrm{pp}(\lambda)=\lambda^+$ for all singular cardinals $\lambda$. (For a quick review of the different pcf-theoretic assumptions in the neighborhood of SSH, see here.)

As pointed out by Mohammad, the failure of SSH (past the continuum) is equiconsistent with $o(\kappa)=\kappa^{++}$. This fits naturally with the thesis advanced in **Cardinal arithmetic**, section II.2, and is addressed explicitly in Gitik's original paper on the strength of SCH,

Moti Gitik. *The strength of the failure of the singular cardinal hypothesis*, Ann. Pure Appl. Logic, **51 (3)**, (1991), 215–240. MR1098782 (92f:03060).

Indeed, the main result of the paper is stated in terms of $\mathrm{pp}$ rather than $\mathsf{SCH}$:

**Main theorem.** Assume that $\lnot(\exists\alpha\,o(\alpha)=\alpha^{++})$. Let $\kappa>2^{\aleph_0}$ be a singular cardinal. Then $\mathrm{pp}(\kappa)=\kappa^+$.

Note that (as explained in the paper) what Gitik really means by $\lnot(\exists\alpha\,o(\alpha)=\alpha^{++})$ is that the core model $K$ exists, and that, *in $K$*, no $\alpha$ has Mitchell order $\alpha^{++}$.

See also the introduction to [Sh400] (Chapter IX in the book), where the history of this result is recalled:

Lately Gitik [Gi1] continuing works of Magidor [Mg] and Woodin, show[ed] $\mathsf{ZFC} + o(\kappa) =\kappa^{++}$ is an upper bound for consistency strength of "cardinal
arithmetic non-trivial". Earlier Mitchell proved
$$ ZFC + \kappa=\bigcup_{n<\omega}\kappa_n\ \&\ o(\kappa_{n+ l}) > \kappa_n $$
is a lower bound. When Mitchell visited Jerusalem he tried to convince me to get a complimentary consistency result (probably to show he is right) and I tried to convince him to show that the consistency strength of $\mathrm{pp}(\lambda) >
\lambda^+\ \&\ (\lambda$ singular$)$ is $o(\kappa) =\kappa^{++}$ [...] (to show that I was right in [Sh-b, XIII,95,96)]); but it all comes to nothing. Also Gitik was not convinced and forgot it. But in Spring '89 he succeeded to get $o(\kappa) =\kappa^{++}$
as lower bound, for a closed but distinct problem; in his proof he was
cornered to use $\mathrm{pp}(\lambda) > \lambda^+$ and $(\forall\mu<\lambda)\mu^{\aleph_0}<\lambda,\mathrm{cf}(\mu)=\aleph_0$.

The main recent news with respect to Shelah's pcf hypotheses is that Gitik announced around Summer 2011 that it is consistent to have a progressive set of cardinals $\mathfrak a$ with $|\mathrm{pcf}(\mathfrak a)|>|\mathfrak a|$. A preprint can be found at Gitik's page, as

Moti Gitik. *Short extenders forcing. II*, preprint, July 24, 2013.

That this is impossible is a consequence of SSH, and Gitik (perhaps surprisingly) shows that it can be violated from assumptions at the level of strong cardinals. The specific result is the consistency of the existence of a countable $\mathfrak a$ with $\mathrm{pcf}(\mathfrak a)$ of order type $\omega_1+1$. The assumption required for this is below one strong cardinal (but we need a sequence of cardinals with some -significant- degree of strongness). This also violates Shelah's Weak Hypothesis, as discussed here.

Beyond this, certain specific violations of this statement would require at least the strength of Projective Determinacy (and really, the expectation is that much more is needed, if at all possible). See

Moti Gitik, Ralf Schindler, and Saharon Shelah. *Pcf theory and Woodin cardinals*, in **Logic Colloquium '02**, Zoé Chatzidakis, Peter Koepke, and Wolfram Pohlers, eds., Lecture Notes in Logic, **27**, Assoc. Symbol. Logic, La Jolla, CA, 2006, pp. 172-205.