default search action
Masayuki Yoshino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Hirotomo Shinoki, Hisayoshi Sato, Masayuki Yoshino:
Fully Secure Searchable Encryption from PRFs, Pairings, and Lattices. IACR Cryptol. ePrint Arch. 2024: 1632 (2024) - 2021
- [j7]Hironori Washizaki, Tian Xia, Natsumi Kamata, Yoshiaki Fukazawa, Hideyuki Kanuka, Takehisa Kato, Masayuki Yoshino, Takao Okubo, Shinpei Ogata, Haruhiko Kaiya, Atsuo Hazeyama, Takafumi Tanaka, Nobukazu Yoshioka, G. Priyalakshmi:
Systematic Literature Review of Security Pattern Research. Inf. 12(1): 36 (2021) - 2020
- [c18]Masayuki Yoshino, Ken Naganuma, Noboru Kunihiro, Hisayoshi Sato:
Practical Query-based Order Revealing Encryption from Symmetric Searchable Encryption. AsiaJCIS 2020: 16-23 - [c17]Ken Naganuma, Masayuki Yoshino, Atsuo Inoue, Yukinori Matsuoka, Mineaki Okazaki, Noboru Kunihiro:
Post-Quantum zk-SNARK for Arithmetic Circuits using QAPs. AsiaJCIS 2020: 32-39 - [c16]Ken Naganuma, Takayuki Suzuki, Masayuki Yoshino, Kenta Takahashi, Yosuke Kaga, Noboru Kunihiro:
New Secret Key Management Technology for Blockchains from Biometrics Fuzzy Signature. AsiaJCIS 2020: 54-58
2010 – 2019
- 2019
- [c15]Masayuki Yoshino, Takayuki Suzuki, Ken Naganuma, Hisayoshi Sato:
Definition and Efficient Construction of Encrypted k-anonymization Scheme. ICISSP 2019: 293-300 - 2018
- [c14]Ken Naganuma, Masayuki Yoshino, Hisayoshi Sato, Nishio Yamada, Takayuki Suzuki, Noboru Kunihiro:
Decentralized Netting Protocol over Consortium Blockchain. ISITA 2018: 174-177 - [c13]Sota Onozawa, Noboru Kunihiro, Masayuki Yoshino, Ken Naganuma:
Inference Attacks on Encrypted Databases Based on Order Preserving Assignment Problem. IWSEC 2018: 35-47 - [c12]Tian Xia, Hironori Washizaki, Takehisa Kato, Haruhiko Kaiya, Shinpei Ogata, Eduardo B. Fernández, Hideyuki Kanuka, Masayuki Yoshino, Dan Yamamoto, Takao Okubo, Nobukazu Yoshioka, Atsuo Hazeyama:
Cloud Security and Privacy Metamodel - Metamodel for Security and Privacy Knowledge in Cloud Services. MODELSWARD 2018: 379-386 - 2017
- [c11]Ken Naganuma, Masayuki Yoshino, Hisayoshi Sato, Takayuki Suzuki:
Auditable Zerocoin. EuroS&P Workshops 2017: 59-63 - 2015
- [j6]Dai Watanabe, Masayuki Yoshino:
Key Update Mechanism Using All-or-Nothing Transform for Network Storage of Encrypted Data. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 162-170 (2015) - 2013
- [j5]Masayuki Yoshino, Noboru Kunihiro:
Random Sampling Reduction with Precomputation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(1): 150-157 (2013) - [c10]Dai Watanabe, Masayuki Yoshino:
Key Update Mechanism for Network Storage of Encrypted Data. CloudCom (1) 2013: 493-498 - [c9]Ken Naganuma, Hisayoshi Sato, Masayuki Yoshino, Yoshinori Sato:
How to Evaluate Contents Popularity over Oblivious Transfer. SITIS 2013: 693-698 - 2012
- [c8]Masayuki Yoshino, Noboru Kunihiro:
Improving GGH cryptosystem for large error vector. ISITA 2012: 416-420 - [c7]Ken Naganuma, Masayuki Yoshino, Hisayoshi Sato:
Upper bound of the shortest vector coefficients and its applications. ISITA 2012: 426-430 - [c6]Masayuki Yoshino, Noboru Kunihiro, Ken Naganuma, Hisayoshi Sato:
Symmetric Inner-Product Predicate Encryption Based on Three Groups. ProvSec 2012: 215-234 - 2011
- [c5]Masayuki Yoshino, Ken Naganuma, Hisayoshi Satoh:
Symmetric Searchable Encryption for Database Applications. NBiS 2011: 657-662 - 2010
- [j4]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Recursive Double-Size Modular Multiplications from Euclidean and Montgomery Multipliers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(1): 180-187 (2010)
2000 – 2009
- 2009
- [j3]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Faster Double-Size Bipartite Multiplication out of Montgomery Multipliers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 1851-1858 (2009) - [j2]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Bipartite modular multiplication with twice the bit-length of multipliers. Int. J. Inf. Sec. 8(1): 13-23 (2009) - [c4]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients. CT-RSA 2009: 340-356 - 2008
- [j1]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Montgomery Multiplication with Twice the Bit-Length of Multipliers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 203-210 (2008) - [c3]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
A Black Hen Lays White Eggs. CARDIS 2008: 74-88 - 2007
- [c2]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Double-Size Bipartite Modular Multiplication. ACISP 2007: 230-244 - 2006
- [c1]Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume:
Unbridle the Bit-Length of a Crypto-coprocessor with Montgomery Multiplication. Selected Areas in Cryptography 2006: 188-202
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint