搜索结果: 1-15 共查到“军事学 indifferentiability”相关记录37条 . 查询时间(0.245 秒)
Quantum Lazy Sampling and Game-Playing Proofs for Quantum Indifferentiability
game-playing proofs QROM indifferentiability
2019/4/28
Game-playing proofs constitute a powerful framework for classical cryptographic security arguments, most notably applied in the context of indifferentiability. An essential ingredient in such proofs i...
Indifferentiability for Public Key Cryptosystems
Indifferentiability Composition Public key encryption Random oracle model
2019/4/11
We initiate the study of indifferentiability for public key encryption and other public key primitives. Our main results are definitions and constructions of public key cryptosystems that are indiffer...
How to Record Quantum Queries, and Applications to Quantum Indifferentiability
quantum indifferentiability
2018/3/23
The quantum random oracle model (QROM) has become the standard model in which to prove the post-quantum security of random-oracle-based constructions. Unfortunately, none of the known proof techniques...
We study the indifferentiability of classical constructions in the quantum setting, such as the Sponge construction or Feistel networks. (But the approach easily generalizes to other constructions, to...
Context-Restricted Indifferentiability: Generalizing UCE and Implications on the Soundness of Hash-Function Constructions
Indifferentiability UCE hash functions
2017/5/27
Understanding how hash functions can be used in a sound manner within cryptographic protocols, as well as how they can be constructed in a sound manner from compression functions, are two important pr...
Five Rounds are Sufficient and Necessary for the Indifferentiability of Iterated Even-Mansour
block cipher ideal cipher iterated Even-Mansour
2017/2/20
We prove that the 5-round iterated Even-Mansour (IEM) construction (which captures the high-level structure of the class of key-alternating ciphers) with a non-idealized key-schedule (such as the triv...
This work revisits the following question: in the ideal cipher model, can a cascade of several ideal (κ,n)(κ,n)-blockciphers realize 22κ22κ independent nn-bit random permutations, i.e. an ideal (2κ,n)...
Indifferentiability of 3-Round Even-Mansour with Random Oracle Key Derivation
blockcipher ideal cipher indifferentiability
2016/12/9
We revisit the Even-Mansour (EM) scheme with random oracle key derivation previously considered by Andreeva et al. (CRYPTO 2013). For this scheme, Andreeva et al. provided an indifferentiability (from...
From Indifferentiability to Constructive Cryptography (and Back)
indifferentiability of systems Constructive Cryptography
2016/12/9
The concept of indifferentiability of systems, a generalized form of indistinguishability, was proposed in 2004 to provide a simplified and generalized explanation of impossibility results like the no...
Indifferentiability Results and Proofs for Some Popular Cryptographic Constructions
Indifferentiability Random oracle Hash functions
2016/1/8
The notion of indifferentiability, which is a stronger version of the classic notion of indistinguishability,
was introduced by Maurer et al. in [MRH03]. Indifferentiability, among other things, give...
On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
block cipher ideal cipher indifferentiability
2016/1/6
Feistel constructions have been shown to be indifferentiable from random permutations at STOC 2011. Whereas how to properly mix the keys into an un-keyed Feistel construction without appealing to doma...
Indifferentiability of Confusion-Diffusion Networks
symmetric-key cryptography block ciphers substitution-permutation networks
2015/12/29
We show the first positive results for the indifferentiability security of the confusiondiffusion
networks (which are extensively used in the design of block ciphers and hash functions).
In particul...
A Synthetic Indifferentiability Analysis of Interleaved Double-Key Even-Mansour Ciphers
blockcipher ideal cipher indifferentiability
2015/12/23
Iterated Even-Mansour scheme (IEM) is a generalization of
the basic 1-round proposal (ASIACRYPT ’91). The scheme can use one
key, two keys, or completely independent keys.
We prove that a (balanced) 10-round Feistel network is indifferentiable from a random permutation. In a previous seminal result, Holenstein et al. had established indifferentiability of Feistel at 14 ...
A Note on the Indifferentiability of the 10-Round Feistel Construction
block cipher Feistel construction indifferentiability
2015/12/23
Holenstein et al. (STOC 2011) have shown that the Feistel construction with fourteen
rounds and public random round functions is indifferentiable from a random permutation. In the
same paper, they p...