default search action
Fumitaka Hoshino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j6]Masayuki Abe, Fumitaka Hoshino
, Miyako Ohkubo:
Fast and Scalable Bilinear-Type Conversion Method for Large Scale Crypto Schemes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(1): 251-269 (2019) - [j5]Masayuki Abe, Fumitaka Hoshino
Opcount: A Pseudo-Code Performance Estimation System for Pairing-Based Cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1285-1292 (2019) - 2016
- [c9]Masayuki Abe, Fumitaka Hoshino
Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming. CRYPTO (3) 2016: 387-415 - [i2]Masayuki Abe, Fumitaka Hoshino, Miyako Ohkubo:
Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion using Integer Programming. IACR Cryptol. ePrint Arch. 2016: 570 (2016) - 2013
- [j4]Atsushi Fujioka
id-eCK Secure ID-Based Authenticated Key Exchange on Symmetric and Asymmetric Pairing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1139-1155 (2013) - 2010
- [c8]Fumitaka Hoshino
Anonymizable Signature and Its Construction from Pairings. Pairing 2010: 62-77
2000 – 2009
- 2009
- [c7]Koutarou Suzuki, Fumitaka Hoshino
Relinkable Ring Signature. CANS 2009: 518-536 - 2007
- [i1]Gen Takahashi, Fumitaka Hoshino, Tetsutaro Kobayashi:
Efficient GF(3m) Multiplication Algorithm for eta T Pairing. IACR Cryptol. ePrint Arch. 2007: 463 (2007) - 2006
- [j3]Taiichi Saito, Fumitaka Hoshino
Candidate One-Way Functions on Non-Supersingular Elliptic Curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 144-150 (2006) - [c6]Fumitaka Hoshino
Compressed Jacobian Coordinates for OEF. VIETCRYPT 2006: 147-156 - 2003
- [j2]Fumitaka Hoshino, Masayuki Abe, Tetsutaro Kobayashi:
Lenient/Strict Batch Verification in Several Groups. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(1): 64-72 (2003) - [j1]Tetsutaro Kobayashi, Fumitaka Hoshino, Kazumaro Aoki:
A Cyclic Window Algorithm for Elliptic Curves over OEF. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(1): 121-128 (2003) - 2001
- [c5]Kazumaro Aoki, Fumitaka Hoshino
A Cyclic Window Algorithm for ECC Defined over Extension Fields. ICICS 2001: 62-73 - [c4]Fumitaka Hoshino
Lenient/Strict Batch Verification in Several Groups. ISC 2001: 81-94 - [c3]Kazumaro Aoki, Fumitaka Hoshino
Elliptic Curve Arithmetic Using SIMD. ISC 2001: 235-247 - [c2]Masayuki Abe, Fumitaka Hoshino
Remarks on Mix-Network Based on Permutation Networks. Public Key Cryptography 2001: 317-324
1990 – 1999
- 1999
- [c1]Tetsutaro Kobayashi, Hikaru Morita, Kunio Kobayashi, Fumitaka Hoshino
Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic. EUROCRYPT 1999: 176-189
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-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: