( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computational Indistinguishability Between Quantum States and Its Cryptographic Application.

, , , и . EUROCRYPT, том 3494 из Lecture Notes in Computer Science, стр. 268-284. Springer, (2005)

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.

Takeshi Morita

Takeshi Morita

Takeshi Imamura

Takeshi Omori

Takeshi Yasui

 

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

Reducing Complexity Assumptions for Oblivious Transfer., и . IACR Cryptology ePrint Archive, (2008)Typed pattern languages and their learnability.. EuroCOLT, том 904 из Lecture Notes in Computer Science, стр. 367-379. Springer, (1995)Private Comparison Protocol and Its Application to Range Queries., , , и . IDCS, том 10794 из Lecture Notes in Computer Science, стр. 128-141. Springer, (2017)Universal Test for Quantum One-Way Permutations., , , и . MFCS, том 3153 из Lecture Notes in Computer Science, стр. 839-850. Springer, (2004)Multiple Linear Cryptanalysis of a Reduced Round RC6., , и . FSE, том 2365 из Lecture Notes in Computer Science, стр. 76-88. Springer, (2002)Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication., и . ISIT, стр. 2614-2618. IEEE, (2018)Decision Tree Learning Systems with Switching Evaluators.. AI, том 1081 из Lecture Notes in Computer Science, стр. 349-361. Springer, (1996)Fully Secure Lattice-Based Group Signatures with Verifier-Local Revocation., и . AINA, стр. 795-802. IEEE Computer Society, (2017)Perfectly Secure Message Transmission Against Rational Timid Adversaries., , и . GameSec, том 11199 из Lecture Notes in Computer Science, стр. 127-144. Springer, (2018)Universal test for quantum one-way permutations., , , и . Theor. Comput. Sci., 345 (2-3): 370-385 (2005)