Results 111 to 120 of about 1,402 (165)
Some of the next articles are maybe not open access.
Indifferentiability of 8-Round Feistel Networks
Annual International Cryptology Conference, 2016We prove that a balanced 8-round Feistel network is indifferentiable from a random permutation, improving on previous 10-round results by Dachman-Soled et al. and Dai et al. Our simulator achieves security $$Oq^8/2^n$$, similarly to the security of Dai et al. For further comparison, Dachman-Soled et al.
Yuanxi Dai, John Steinberger
openaire +2 more sources
The suffix-free-prefix-free hash function construction and its indifferentiability security analysis [PDF]
International Journal of Information Security, 2012 In this paper, we observe that in the seminal work on indifferentiability analysis of iterated hash functions by Coron et al. and in subsequent works, the initial value (IV) of hash functions is fixed.
Nasour Bagheri, Praveen Gauravaram
exaly +4 more sources
Sequential Indifferentiability of 7-Round Misty Structures
Lecture Notes in Computer ScienceJiayi Ai, Chun Guo
exaly +2 more sources
On the Relationship Between Public Key Primitives via Indifferentiability
Lecture Notes in Computer ScienceShuang Hu +3 more
exaly +2 more sources
Indifferentiability of SKINNY-HASH Internal Functions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2021Akinori HOSOYAMADA, Tetsu IWATA
exaly +2 more sources
Indifferentiability of the Sum of Random Permutations Toward Optimal Security
IEEE Transactions on Information Theory, 2017Jooyoung Lee
exaly +2 more sources
Crooked Indifferentiability of Enveloped XOR Revisited
International Conference on Cryptology in India, 2021Rishiraj Bhattacharyya +2 more
openaire +2 more sources
Sequential Indifferentiability of Confusion-Diffusion Networks
International Conference on Cryptology in India, 2021Qi Da, Shanjie Xu, Chun Guo
openaire +2 more sources
Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability
IACR Cryptology ePrint Archive, 2020It is convenient and common for schemes in the random oracle model to assume access to multiple random oracles (ROs), leaving to implementations the task—we call it oracle cloning—of constructing them from a single RO.
M. Bellare, Hannah Davis, Felix Günther
semanticscholar +1 more source
Indifferentiability of SKINNY-HASH Internal Functions
IACR Cryptology ePrint Archive, 2020We provide a formal proof for the indifferentiability of SKINNY-HASH internal function from a random oracle. SKINNY-HASH is a family of function-based sponge hash functions, and it was selected as one of the second round candidates of the NIST lightweight
Akinori Hosoyamada, Tetsu Iwata
semanticscholar +1 more source