A polynomial-time universal security amplifier in the class of block ciphers

Pliam, John O.

doi:10.4310/cis.2001.v1.n2.a4

Cited by 1 publication

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It remains then to show t has full support on the double coset. But z has full support on S M [13], and by Thm. 2 each z i z so it cannot have fewer permutations on each of the left cosets λ i S M .…”

Section: Propositionmentioning

confidence: 93%

“…Specifically, we show in Sect. 3, that nonadaptive chosen-plaintext attack (ncpa) advantage [11,17] as well as conditional guesswork [13] are such metrics. This is depicted in the two rightmost diagrams in Fig.…”

Section: Motivationmentioning

confidence: 99%

“…To facilitate such a comparison, we exploit special properties of a polynomialtime cipher which achieves every permutation (given enough key construction data or equivalently a private random function oracle). This construction from [13] called a universal security amplifier was originally put forth to decided whether any efficient block cipher possessed a property of the one-time pad, namely that when composed with a non-perfect cipher was strictly more secure.…”

Section: A Resource-bounded Example Of Extreme Expansionmentioning

confidence: 99%

See 2 more Smart Citations

Alternating Product Ciphers: A Case for Provable Security Comparisons

Pliam

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We formally study iterated block ciphers that alternate between two sequences of independent and identically distributed (i.i.d.) rounds. It is demonstrated that, in some cases the effect of alternating increases security, while in other cases the effect may strictly decrease security relative to the corresponding product of one of its component sequences. As this would appear to contradict conventional wisdom based on the ideal cipher approximation, we introduce new machinery for provable security comparisons. The comparisons made here simultaneously establish a coherent ordering of security metrics ranging from key-recovery cost to computational indistinguishability.

show abstract

Section: Propositionmentioning

confidence: 93%

Section: Motivationmentioning

confidence: 99%

Section: A Resource-bounded Example Of Extreme Expansionmentioning

confidence: 99%

See 1 more Smart Citation