Results 71 to 80 of about 437 (95)

Indifferentiability Analysis of Symmetric Key Ciphers

open access: yes
The thesis presented here analyses the security of certain selected symmetric key ciphers - The ciphers analyzed are the 2 and 3-round Confusion-Diffusion Network, the 3-round Cascade Cipher with two independent keys, and the Feistel Construction with 7 ...
Paul, Sayantan
core   +1 more source

Indifferentiability of 3-Round Confusion-Diffusion Networks

open access: yes
Substitution-Permutation Networks (SPNs) are a popular and powerful technique for designing block ciphers. Confusion-Diffusion Networks (CDNs), as formalised by Dodis et al. at Eurocrypt’16, treat unkeyed SPNs as a means of extending the domain of public
Nandi, Mridul   +3 more
core   +1 more source

Semi-Supervised Discriminative Classification Robust to Sample-Outliers and Feature-Noises. [PDF]

open access: yesIEEE Trans Pattern Anal Mach Intell, 2019
Adeli E   +6 more
europepmc   +1 more source

The Indifferentiability of the Duplex and its Practical Applications

open access: yes
The Duplex construction, introduced by Bertoni et al. (SAC 2011), is the Swiss Army knife of permutation-based cryptography. It can be used to realise a variety of cryptographic objects—ranging from hash functions and MACs, to authenticated encryption ...
Marc Fischlin   +2 more
core  

Spatiotemporal organization of membrane protein controls bacterial extracellular electron transfer. [PDF]

open access: yesNat Commun
Park Y   +7 more
europepmc   +1 more source

The Impossibility of Post-Quantum Public Indifferentiability for Merkle-Damgard

open access: yes
The Merkle-Damgård construction (in its strengthened form as used in SHA-256 and SHA-512, the untruncated members of SHA-2) is not classically indifferentiable from a Variable-Input-Length (VIL) random oracle because of the length-extension attack ...
Akinori Hosoyamada
core  

On the Indifferentiability of Fugue and Luffa

open access: yesLecture Notes in Computer Science, 2011
Indifferentiability is currently considered to be an important security notion for a cryptographic hash function to instantiate Random Oracles in different security proofs.
Avradip Mandal
exaly   +2 more sources

Reset Indifferentiability From Weakened Random Oracle Salvages One-Pass Hash Functions [PDF]

open access: yesLecture Notes in Computer Science, 2014
Ristenpart et al. showed that the limitation of the indifferentiability theorem of Maurer et al. which does not cover all multi stage security notions but covers only single stage security notions, defined a new concept (reset indifferentiability), and ...
Kazuki Yoneyama, Yusuke Naito
exaly   +4 more sources

Home - About - Disclaimer - Privacy