Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models

2018 ◽  
pp. 693-721 ◽  
Author(s):  
Sandro Coretti ◽  
Yevgeniy Dodis ◽  
Siyao Guo
Keyword(s):  
Random Permutation ◽  
Uniform Bounds ◽  
Generic Group ◽  
Ideal Cipher

scholarly journals Security of Symmetric Primitives against Key-Correlated Attacks

2019 ◽  
pp. 193-230
Author(s):  
Aisling Connolly ◽  
Pooya Farshim ◽  
Georg Fuchsbauer
Keyword(s):  
Natural Transformation ◽  
Random Oracle Model ◽  
Random Permutation ◽  
Random Oracle ◽  
Dependent Data ◽  
Authenticated Encryption ◽  
Ideal Cipher ◽  
Permutation Model ◽  
Ideal Cipher Model ◽  
The Ideal

We study the security of symmetric primitives against key-correlated attacks (KCA), whereby an adversary can arbitrarily correlate keys, messages, and ciphertexts. Security against KCA is required whenever a primitive should securely encrypt key-dependent data, even when it is used under related keys. KCA is a strengthening of the previously considered notions of related-key attack (RKA) and key-dependent message (KDM) security. This strengthening is strict, as we show that 2-round Even–Mansour fails to be KCA secure even though it is both RKA and KDM secure. We provide feasibility results in the ideal-cipher model for KCAs and show that 3-round Even–Mansour is KCA secure under key offsets in the random-permutation model. We also give a natural transformation that converts any authenticated encryption scheme to a KCA-secure one in the random-oracle model. Conceptually, our results allow for a unified treatment of RKA and KDM security in idealized models of computation.

scholarly journals Block Cipher in the Ideal Cipher Model: A Dedicated Permutation Modeled as a Black-Box Public Random Permutation

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1485
Author(s):  
Yasir Nawaz ◽  
Lei Wang
Keyword(s):  
Block Cipher ◽  
Random Permutation ◽  
Secret Key ◽  
Pseudorandom Permutation ◽  
Ideal Cipher ◽  
Xor Operation ◽  
Beyond Birthday Bound ◽  
Symmetric Key Cryptography ◽  
Ideal Cipher Model ◽  
The Ideal

Designing a secure construction has always been a fascinating area for the researchers in the field of symmetric key cryptography. This research aimed to make contributions to the design of secure block cipher in the ideal cipher model whose underlying primitive is a family of n − b i t to n − b i t random permutations indexed by secret key. Our target construction of a secure block ciphers denoted as E [ s ] is built on a simple XOR operation and two block cipher invocations, under the assumptions that the block cipher in use is a pseudorandom permutation. One out of these two block cipher invocations produce a subkey that is derived from the secret key. It has been accepted that at least two block cipher invocations with XOR operations are required to achieve beyond birthday bound security. In this paper, we investigated the E [ s ] instances with the advanced proof technique and efficient block cipher constructions that bypass the birthday-bound up to 2 n provable security was achieved. Our study provided new insights to the block cipher that is beyond birthday bound security.

Asymptotics with remainder term for moments of the total cycle number of random A-permutation

2021 ◽  
Vol 31 (1) ◽  
pp. 51-60
Author(s):  
Arsen L. Yakymiv
Keyword(s):  
Remainder Term ◽  
Random Permutation ◽  
Natural Numbers ◽  
Cycle Number ◽  
Fixed Set ◽  
Cycle Lengths

Abstract Dedicated to the memory of Alexander Ivanovich Pavlov. We consider the set of n-permutations with cycle lengths belonging to some fixed set A of natural numbers (so-called A-permutations). Let random permutation τ n be uniformly distributed on this set. For some class of sets A we find the asymptotics with remainder term for moments of total cycle number of τ n .

scholarly journals Stability of the Non-abelian X-ray Transform in Dimension $$\ge 3$$

2021 ◽  
Author(s):  
Jan Bohr
Keyword(s):  
Stability Estimate ◽  
Scattering Data ◽  
Regularity Conditions ◽  
Uniform Bounds ◽  
Ray Transform ◽  
Shallow Layer ◽  
Matrix Potential ◽  
Novel Method ◽  
Statistical Consistency ◽  
Appl Math

AbstractNon-abelian X-ray tomography seeks to recover a matrix potential $$\Phi :M\rightarrow {\mathbb {C}}^{m\times m}$$ Φ : M → C m × m in a domain M from measurements of its so-called scattering data $$C_\Phi $$ C Φ at $$\partial M$$ ∂ M . For $$\dim M\ge 3$$ dim M ≥ 3 (and under appropriate convexity and regularity conditions), injectivity of the forward map $$\Phi \mapsto C_\Phi $$ Φ ↦ C Φ was established in (Paternain et al. in Am J Math 141(6):1707–1750, 2019). The present article extends this result by proving a Hölder-type stability estimate. As an application, a statistical consistency result for $$\dim M =2$$ dim M = 2 (Monard et al. in Commun Pure Appl Math, 2019) is generalised to higher dimensions. The injectivity proof in (Paternain et al. in Am J Math 141(6):1707–1750, 2019) relies on a novel method by Uhlmann and Vasy (Invent Math 205(1):83–120, 2016), which first establishes injectivity in a shallow layer below $$\partial M$$ ∂ M and then globalises this by a layer stripping argument. The main technical contribution of this paper is a more quantitative version of these arguments, in particular, proving uniform bounds on layer depth and stability constants.

Sign in / Sign up

Export Citation Format

Share Document