From post

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.

 

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

Approximated Two Choices in Randomized Load Balancing., и . ISAAC, том 3341 из Lecture Notes in Computer Science, стр. 545-557. Springer, (2004)Hard Functions for Low-Degree Polynomials over Prime Fields., , и . MFCS, том 6907 из Lecture Notes in Computer Science, стр. 120-131. Springer, (2011)Computational Indistinguishability Between Quantum States and Its Cryptographic Application., , , и . EUROCRYPT, том 3494 из Lecture Notes in Computer Science, стр. 268-284. Springer, (2005)General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction., , , и . Comput. J., 60 (5): 711-728 (2017)Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems., , и . MFCS, том 83 из LIPIcs, стр. 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes., , и . IWSEC, том 9836 из Lecture Notes in Computer Science, стр. 195-211. Springer, (2016)Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability., , и . IWSEC, том 7631 из Lecture Notes in Computer Science, стр. 123-137. Springer, (2012)On the Power of Quantum Encryption Keys., и . PQCrypto, том 5299 из Lecture Notes in Computer Science, стр. 165-180. Springer, (2008)Universal test for quantum one-way permutations., , , и . Theor. Comput. Sci., 345 (2-3): 370-385 (2005)Security of Encryption Schemes in Weakened Random Oracle Models., , , и . Public Key Cryptography, том 6056 из Lecture Notes in Computer Science, стр. 403-419. Springer, (2010)