From post

Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the ^2 Method.

, и . EUROCRYPT (1), том 10820 из Lecture Notes in Computer Science, стр. 387-412. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

On an extremal hypergraph problem related to combinatorial batch codes., и . Discret. Appl. Math., (2014)Combinatorial Batch Codes: A Lower Bound and Optimal Constructions, , и . CoRR, (2011)Note on an Extremal Hypergraph Problem Related to Combinatorial Batch Codes, и . CoRR, (2012)Combinatorial batch codes: A lower bound and optimal constructions., , и . Adv. Math. Commun., 6 (2): 165-174 (2012)Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the ^2 Method., и . EUROCRYPT (1), том 10820 из Lecture Notes in Computer Science, стр. 387-412. Springer, (2018)On Some Permutation Binomials of the Form $x^2^n-1k+1 +ax$ over $F_2^n$ : Existence and Count., , и . WAIFI, том 7369 из Lecture Notes in Computer Science, стр. 236-246. Springer, (2012)Revisiting Variable Output Length XOR Pseudorandom Function., и . IACR Trans. Symmetric Cryptol., 2018 (1): 314-335 (2018)A Note on the Chi-square Method : A Tool for Proving Cryptographic Security., и . IACR Cryptology ePrint Archive, (2019)Derandomized Construction of Combinatorial Batch Codes.. FCT, том 9210 из Lecture Notes in Computer Science, стр. 269-282. Springer, (2015)Luby-Rackoff Backwards with More Users and More Security., и . ASIACRYPT (3), том 13092 из Lecture Notes in Computer Science, стр. 345-375. Springer, (2021)