default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatsuyuki Takashima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Pratish Datta, Tapas Pal
, Katsuyuki Takashima:
Compact FE for unbounded attribute-weighted sums for logspace from SXDH. Des. Codes Cryptogr. 92(10): 3155-3235 (2024)- 2022
- [c31]Pratish Datta, Tapas Pal, Katsuyuki Takashima:
Compact FE for Unbounded Attribute-Weighted Sums for Logspace from SXDH. ASIACRYPT (1) 2022: 126-159 - [i22]Pratish Datta, Tapas Pal, Katsuyuki Takashima:
Compact FE for Unbounded Attribute-Weighted Sums for Logspace from SXDH. IACR Cryptol. ePrint Arch. 2022: 1594 (2022) - 2021
- [j19]Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(1): 25-57 (2021) - [j18]Yuji Hashimoto, Katsuyuki Takashima:
Improved supersingularity testing of elliptic curves. JSIAM Lett. 13: 29-32 (2021) - [c30]Yuta Kambe, Yusuke Aikawa, Momonari Kudo, Masaya Yasuda, Katsuyuki Takashima, Kazuhiro Yokoyama:
Implementation Report of the Kohel-Lauter-Petit-Tignol Algorithm for the Constructive Deuring Correspondence. ICMC 2021: 953-966 - [i21]Toshiyuki Katsura, Katsuyuki Takashima:
Decomposed Richelot isogenies of Jacobian varieties of hyperelliptic curves and generalized Howe curves. CoRR abs/2108.06936 (2021) - 2020
- [j17]Tatsuaki Okamoto, Katsuyuki Takashima:
Decentralized Attribute-Based Encryption and Signatures. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(1): 41-73 (2020) - [j16]Katsuyuki Takashima:
Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(1): 74-106 (2020) - [j15]Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption. IEICE Trans. Inf. Syst. 103-D(7): 1556-1597 (2020) - [c29]Yasuhiko Ikematsu, Ryoya Fukasaku, Momonari Kudo, Masaya Yasuda, Katsuyuki Takashima, Kazuhiro Yokoyama:
Hybrid Meet-in-the-Middle Attacks for the Isogeny Path-Finding Problem. APKC@AsiaCCS 2020: 36-44 - [c28]Tomoki Kawashima, Katsuyuki Takashima, Yusuke Aikawa, Tsuyoshi Takagi:
An Efficient Authenticated Key Exchange from Random Self-reducibility on CSIDH. ICISC 2020: 58-84 - [i20]Toshiyuki Katsura, Katsuyuki Takashima:
Counting superspecial Richelot isogenies and its cryptographic application. CoRR abs/2003.00633 (2020) - [i19]Tomoki Kawashima, Katsuyuki Takashima, Yusuke Aikawa, Tsuyoshi Takagi:
An Efficient Authenticated Key Exchange from Random Self-Reducibility on CSIDH. IACR Cryptol. ePrint Arch. 2020: 1178 (2020)
2010 – 2019
- 2019
- [j14]Tatsuaki Okamoto, Katsuyuki Takashima:
Fully Secure Functional Encryption with a Large Class of Relations from the Decisional Linear Assumption. J. Cryptol. 32(4): 1491-1573 (2019) - [c27]Tomoki Moriya, Katsuyuki Takashima, Tsuyoshi Takagi:
Group Key Exchange from CSIDH and Its Application to Trusted Setup in Supersingular Isogeny Cryptosystems. Inscrypt 2019: 86-98 - [c26]Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs. Public Key Cryptography (1) 2019: 127-158 - [c25]Atsushi Fujioka, Katsuyuki Takashima, Kazuki Yoneyama:
One-Round Authenticated Group Key Exchange from Isogenies. ProvSec 2019: 330-338 - [i18]Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs. IACR Cryptol. ePrint Arch. 2019: 363 (2019) - 2018
- [c24]Junichi Tomida, Katsuyuki Takashima:
Unbounded Inner Product Functional Encryption from Bilinear Maps. ASIACRYPT (2) 2018: 609-639 - [c23]Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption. ASIACRYPT (2) 2018: 640-672 - [c22]Takeshi Koshiba, Katsuyuki Takashima:
New Assumptions on Isogenous Pairing Groups with Applications to Attribute-Based Encryption. ICISC 2018: 3-19 - [c21]Atsushi Fujioka, Katsuyuki Takashima, Shintaro Terada, Kazuki Yoneyama:
Supersingular Isogeny Diffie-Hellman Authenticated Key Exchange. ICISC 2018: 177-195 - [c20]Satoshi Furukawa, Noboru Kunihiro, Katsuyuki Takashima:
Multi-party Key Exchange Protocols from Supersingular Isogenies. ISITA 2018: 208-212 - [i17]Junichi Tomida, Katsuyuki Takashima:
Unbounded Inner Product Functional Encryption from Bilinear Maps. IACR Cryptol. ePrint Arch. 2018: 696 (2018) - [i16]Atsushi Fujioka, Katsuyuki Takashima, Shintaro Terada, Kazuki Yoneyama:
Supersingular Isogeny Diffie-Hellman Authenticated Key Exchange. IACR Cryptol. ePrint Arch. 2018: 730 (2018) - [i15]Atsushi Fujioka, Katsuyuki Takashima, Kazuki Yoneyama:
One-Round Authenticated Group Key Exchange from Isogenies. IACR Cryptol. ePrint Arch. 2018: 1033 (2018) - [i14]Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption. IACR Cryptol. ePrint Arch. 2018: 1093 (2018) - 2017
- [j13]Hikari Tachibana, Katsuyuki Takashima, Tsuyoshi Takagi:
Constructing an efficient hash function from $3$-isogenies. JSIAM Lett. 9: 29-32 (2017) - [c19]Katsuyuki Takashima:
New Proof Techniques for DLIN-Based Adaptively Secure Attribute-Based Encryption. ACISP (1) 2017: 85-105 - [p1]Katsuyuki Takashima:
Efficient Algorithms for Isogeny Sequences and Their Cryptographic Applications. CREST Crypto-Math Project 2017: 97-114 - 2016
- [j12]Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(1): 92-117 (2016) - [i13]Takeshi Koshiba, Katsuyuki Takashima:
Pairing Cryptography Meets Isogeny: A New Framework of Isogenous Pairing Groups. IACR Cryptol. ePrint Arch. 2016: 1138 (2016) - 2015
- [j11]Tatsuaki Okamoto, Katsuyuki Takashima:
Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. Des. Codes Cryptogr. 77(2-3): 725-771 (2015) - [j10]Tatsuaki Okamoto, Katsuyuki Takashima:
Dual Pairing Vector Spaces and Their Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 3-15 (2015) - [c18]Katsuyuki Takashima, Atsushi Takayasu:
Tighter Security for Efficient Lattice Cryptography via the Rényi Divergence of Optimized Orders. ProvSec 2015: 412-431 - [i12]Katsuyuki Takashima:
New Proof Techniques for DLIN-Based Adaptively Secure Attribute-Based Encryption and Their Application. IACR Cryptol. ePrint Arch. 2015: 1021 (2015) - [i11]Katsuyuki Takashima, Atsushi Takayasu:
Tighter Security for Efficient Lattice Cryptography via the Rényi Divergence of Optimized Orders. IACR Cryptol. ePrint Arch. 2015: 1132 (2015) - 2014
- [j9]Yutaro Kiyomura, Noriyasu Iwamoto, Shun'ichi Yokoyama, Kenichiro Hayasaka, Yuntao Wang, Takanori Yasuda, Katsuyuki Takashima, Tsuyoshi Takagi:
Heuristic counting of Kachisa-Schaefer-Scott curves. JSIAM Lett. 6: 73-76 (2014) - [j8]Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model. IEEE Trans. Cloud Comput. 2(4): 409-421 (2014) - [c17]Katsuyuki Takashima:
Recent Topics on Practical Functional Encryption. CANDAR 2014: 21-27 - [c16]Katsuyuki Takashima:
Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption. SCN 2014: 298-317 - [i10]Katsuyuki Takashima:
Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption. IACR Cryptol. ePrint Arch. 2014: 207 (2014) - 2013
- [j7]Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient (Hierarchical) Inner-Product Encryption Tightly Reduced from the Decisional Linear Assumption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(1): 42-52 (2013) - [j6]Reo Yoshida, Katsuyuki Takashima:
Computing a Sequence of 2-Isogenies on Supersingular Elliptic Curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(1): 158-165 (2013) - [c15]Yutaka Kawai, Katsuyuki Takashima:
Predicate- and Attribute-Hiding Inner Product Encryption in a Public Key Setting. Pairing 2013: 113-130 - [c14]Tatsuaki Okamoto, Katsuyuki Takashima:
Decentralized Attribute-Based Signatures. Public Key Cryptography 2013: 125-142 - [i9]Yutaka Kawai, Katsuyuki Takashima:
Fully-Anonymous Functional Proxy-Re-Encryption. IACR Cryptol. ePrint Arch. 2013: 318 (2013) - [i8]Yutaka Kawai, Katsuyuki Takashima:
Predicate- and Attribute-Hiding Inner Product Encryption in a Public Key Setting. IACR Cryptol. ePrint Arch. 2013: 763 (2013) - 2012
- [j5]Mitsuhiro Hattori, Nori Matsuda, Takashi Ito, Yoichi Shibata, Katsuyuki Takashima, Takeshi Yoneda:
Provably-Secure Cancelable Biometrics Using 2-DNF Evaluation. Inf. Media Technol. 7(2): 749-760 (2012) - [j4]Mitsuhiro Hattori, Nori Matsuda, Takashi Ito, Yoichi Shibata, Katsuyuki Takashima, Takeshi Yoneda:
Provably-Secure Cancelable Biometrics Using 2-DNF Evaluation. J. Inf. Process. 20(2): 496-507 (2012) - [c13]Tatsuaki Okamoto, Katsuyuki Takashima:
Fully Secure Unbounded Inner-Product and Attribute-Based Encryption. ASIACRYPT 2012: 349-366 - [c12]Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption. EUROCRYPT 2012: 591-608 - [i7]Tatsuaki Okamoto, Katsuyuki Takashima:
Fully Secure Unbounded Inner-Product and Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2012: 671 (2012) - 2011
- [c11]Tatsuaki Okamoto, Katsuyuki Takashima:
Some Key Techniques on Pairing Vector Spaces. AFRICACRYPT 2011: 380-382 - [c10]Tatsuaki Okamoto, Katsuyuki Takashima:
Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption. CANS 2011: 138-159 - [c9]Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient Attribute-Based Signatures for Non-monotone Predicates in the Standard Model. Public Key Cryptography 2011: 35-52 - [i6]Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption. IACR Cryptol. ePrint Arch. 2011: 543 (2011) - [i5]Tatsuaki Okamoto, Katsuyuki Takashima:
Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption. IACR Cryptol. ePrint Arch. 2011: 648 (2011) - [i4]Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model. IACR Cryptol. ePrint Arch. 2011: 700 (2011) - [i3]Tatsuaki Okamoto, Katsuyuki Takashima:
Decentralized Attribute-Based Signatures. IACR Cryptol. ePrint Arch. 2011: 701 (2011) - 2010
- [c8]Tatsuaki Okamoto, Katsuyuki Takashima:
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption. CRYPTO 2010: 191-208 - [c7]Allison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, Brent Waters:
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption. EUROCRYPT 2010: 62-91 - [i2]Allison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, Brent Waters:
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption. IACR Cryptol. ePrint Arch. 2010: 110 (2010) - [i1]Tatsuaki Okamoto, Katsuyuki Takashima:
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption. IACR Cryptol. ePrint Arch. 2010: 563 (2010)
2000 – 2009
- 2009
- [c6]Tatsuaki Okamoto, Katsuyuki Takashima:
Hierarchical Predicate Encryption for Inner-Products. ASIACRYPT 2009: 214-231 - 2008
- [c5]Katsuyuki Takashima:
Efficiently Computable Distortion Maps for Supersingular Curves. ANTS 2008: 88-101 - [c4]Reo Yoshida, Katsuyuki Takashima:
Simple Algorithms for Computing a Sequence of 2-Isogenies. ICISC 2008: 52-65 - [c3]Tatsuaki Okamoto, Katsuyuki Takashima:
Homomorphic Encryption and Signatures from Vector Decomposition. Pairing 2008: 57-74 - 2007
- [j3]Katsuyuki Takashima:
Scaling Security of Elliptic Curves with Fast Pairing Using Efficient Endomorphisms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 152-159 (2007) - 2006
- [j2]Katsuyuki Takashima:
A New Type of Fast Endomorphisms on Jacobians of Hyperelliptic Curves and Their Cryptographic Application. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 124-133 (2006) - [j1]Katsuyuki Takashima:
Practical Application of Lattice Basis Reduction Algorithm to Side-Channel Analysis on (EC)DSA. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1255-1262 (2006) - 2005
- [c2]Katsuyuki Takashima:
Practical Modifications of Leadbitter et al.'s Repeated-Bits Side-Channel Analysis on (EC)DSA. WISA 2005: 259-270 - 2004
- [c1]Katsuyuki Takashima:
New Families of Hyperelliptic Curves with Efficient Gallant-Lambert-Vanstone Method. ICISC 2004: 279-295
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-12-10 20: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:
