( en | de | ru )

 

Disambiguation of "Sakai, Yusuke"

Author of the publication

copydeleteadd this publication to your clipboard
Equivalence between Non-Malleability against Replayable CCA and Other RCCA-Security Notions.

, , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 104-A (1): 89-103 (2021)

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. You can also use the button next to the name to display some publications already assigned to the person.

Hajime Sakai

Winfried Sakai

Noriyuki Sakai

Yusuke Sugihara

Asato Sakai

 

Other publications of authors with the same name

Group signature implies public-key encryption with non-interactive opening., , , and . Int. J. Inf. Sec., 13 (1): 51-62 (2014)Universal Automatic Phonetic Transcription into the International Phonetic Alphabet., , , and . CoRR, (2023)Practical Public-Key Encryption Scheme Tightly Secure in the Random Oracle Model., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 103-A (1): 165-172 (2020)Shortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology., , , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 102-A (9): 1101-1117 (2019)Generic Construction of Adaptively Secure Anonymous Key-Policy Attribute-Based Encryption from Public-Key Searchable Encryption., , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 103-A (1): 107-113 (2020)Cryptanalysis of Aggregate Γ-Signature and Practical Countermeasures in Application to Bitcoin., , , , , and . IACR Cryptol. ePrint Arch., (2020)Transliteration for Low-Resource Code-Switching Texts: Building an Automatic Cyrillic-to-Latin Converter for Tatar., , and . CALCS@NAACL, page 133-140. Association for Computational Linguistics, (2021)Privacy-Preserving Verifiable CNNs., , , , , , , , and . ACNS (2), volume 14584 of Lecture Notes in Computer Science, page 373-402. Springer, (2024)A group signature scheme with unbounded message-dependent opening., , , and . AsiaCCS, page 517-522. ACM, (2013)Practical Round-Optimal Blind Signatures in the ROM from Standard Assumptions., , and . ASIACRYPT (2), volume 14439 of Lecture Notes in Computer Science, page 383-417. Springer, (2023)