default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuto Kawahara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j4]Junichi Tomida
, Yuto Kawahara, Ryo Nishimaki:
Fast, compact, and expressive attribute-based encryption. Des. Codes Cryptogr. 89(11): 2577-2626 (2021)- 2020
- [c7]Junichi Tomida, Yuto Kawahara, Ryo Nishimaki:
Fast, Compact, and Expressive Attribute-Based Encryption. Public Key Cryptography (1) 2020: 3-33
2010 – 2019
- 2019
- [i3]Junichi Tomida, Yuto Kawahara, Ryo Nishimaki:
Fast, Compact, and Expressive Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2019: 966 (2019) - 2018
- [j3]Kazuki Yoneyama, Reo Yoshida, Yuto Kawahara, Tetsutaro Kobayashi, Hitoshi Fuji, Tomohide Yamamoto:
Exposure-Resilient Identity-Based Dynamic Multi-Cast Key Distribution. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(6): 929-944 (2018) - [j2]Kazuki Yoneyama, Reo Yoshida, Yuto Kawahara, Tetsutaro Kobayashi, Hitoshi Fuji, Tomohide Yamamoto:
Multi-cast key distribution: scalable, dynamic and provably secure construction. Int. J. Inf. Sec. 17(5): 513-532 (2018) - 2017
- [c6]Yutaro Kiyomura, Akiko Inoue, Yuto Kawahara, Masaya Yasuda, Tsuyoshi Takagi, Tetsutaro Kobayashi:
Secure and Efficient Pairing at 256-Bit Security Level. ACNS 2017: 59-79 - 2016
- [c5]Kazuki Yoneyama, Reo Yoshida, Yuto Kawahara, Tetsutaro Kobayashi, Hitoshi Fuji, Tomohide Yamamoto:
Multi-cast Key Distribution: Scalable, Dynamic and Provably Secure Construction. ProvSec 2016: 207-226 - [i2]Kazuki Yoneyama, Reo Yoshida, Yuto Kawahara, Tetsutaro Kobayashi, Hitoshi Fuji, Tomohide Yamamoto:
Multi-Cast Key Distribution: Scalable, Dynamic and Provably Secure Construction. IACR Cryptol. ePrint Arch. 2016: 833 (2016) - 2013
- [c4]Tadanori Teruya, Kazutaka Saito, Naoki Kanayama, Yuto Kawahara, Tetsutaro Kobayashi, Eiji Okamoto:
Constructing Symmetric Pairings over Supersingular Elliptic Curves with Embedding Degree Three. Pairing 2013: 97-112 - 2011
- [j1]Yuto Kawahara, Tetsutaro Kobayashi, Gen Takahashi, Tsuyoshi Takagi:
Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(1): 150-155 (2011)
2000 – 2009
- 2008
- [c3]Yuto Kawahara, Kazumaro Aoki, Tsuyoshi Takagi:
Faster Implementation of eta-T Pairing over GF(3m) Using Minimum Number of Logical Instructions for GF(3)-Addition. Pairing 2008: 282-296 - 2007
- [c2]Masaaki Shirase, Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto:
Universal etaT Pairing Algorithm over Arbitrary Extension Degree. WISA 2007: 1-15 - 2006
- [c1]Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto:
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java. CIS 2006: 396-405 - [i1]Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto:
Efficient Implementation of Tate Pairing on a Mobile Phone using Java. IACR Cryptol. ePrint Arch. 2006: 299 (2006)
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 2025-01-09 12:51 CET 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:
