default search action
Takuya Hayashi 0001
Person information
- affiliation: NICT, National Institute of Information and Communications Technology, Japan
Other persons with the same name
- Takuya Hayashi — disambiguation page
- Takuya Hayashi 0002
— RIKEN Center for Molecular Imaging Science, Japan
- Takuya Hayashi 0003 — Ritsumeikan University, Japan
- Takuya Hayashi 0004 — Tokyo Keiso Company, Ltd., Japan
- Takuya Hayashi 0005 — Nagoya Institute of Technology, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c21]Akira Nakashima
Faster Homomorphic Evaluation of Arbitrary Bivariate Integer Functions via Homomorphic Linear Transformation. WAHC@CCS 2024: 76-86 - 2023
- [c20]Yukimasa Sugizaki
Threshold Fully Homomorphic Encryption Over the Torus. ESORICS (1) 2023: 45-65 - 2021
- [j11]Hiromi Arai, Keita Emura
Privacy-Preserving Data Analysis: Providing Traceability without Big Brother. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(1): 2-19 (2021) - [j10]Yuji Koike, Takuya Hayashi
Virtual Vault: A Practical Leakage Resilient Scheme Using Space-Hard Ciphers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(1): 182-189 (2021) - 2020
- [j9]Keita Emura
A Revocable Group Signature Scheme with Scalability from Simple Assumptions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(1): 125-140 (2020) - [j8]Keita Emura
Group Signatures with Time-Bound Keys Revisited: A New Model, an Efficient Construction, and its Implementation. IEEE Trans. Dependable Secur. Comput. 17(2): 292-305 (2020) - [c19]Yuji Koike, Kosei Sakamoto, Takuya Hayashi
Galaxy: A Family of Stream-Cipher-Based Space-Hard Ciphers. ACISP 2020: 142-159
2010 – 2019
- 2019
- [c18]Takehiro Tezuka, Lihua Wang, Takuya Hayashi
A Fast Privacy-Preserving Multi-Layer Perceptron Using Ring-LWE-Based Homomorphic Encryption. ICDM Workshops 2019: 37-44 - [i9]Keita Emura, Takuya Hayashi:
A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Application to Identity Management. IACR Cryptol. ePrint Arch. 2019: 64 (2019) - 2018
- [j7]Yoshinori Aono, Takuya Hayashi
Efficient Homomorphic Encryption with Key Rotation and Security Update. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(1): 39-50 (2018) - [j6]Le Trieu Phong
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption. IEEE Trans. Inf. Forensics Secur. 13(5): 1333-1345 (2018) - [j5]Keita Emura
Road-to-Vehicle Communications With Time-Dependent Anonymity: A Lightweight Construction and Its Experimental Results. IEEE Trans. Veh. Technol. 67(2): 1582-1597 (2018) - [c17]Sangwook Kim, Masahiro Omori, Takuya Hayashi
Privacy-Preserving Naive Bayes Classification Using Fully Homomorphic Encryption. ICONIP (4) 2018: 349-358 - [c16]Keita Emura
A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation. ISC 2018: 442-460 - 2017
- [j4]Yoshinori Aono, Takuya Hayashi
Input and Output Privacy-Preserving Linear Regression. IEICE Trans. Inf. Syst. 100-D(10): 2339-2347 (2017) - [c15]Le Trieu Phong, Yoshinori Aono, Takuya Hayashi
Privacy-Preserving Deep Learning: Revisited and Enhanced. ATIS 2017: 100-110 - [c14]Yoshinori Aono, Takuya Hayashi
Efficient Key-Rotatable and Security-Updatable Homomorphic Encryption. SCC@AsiaCCS 2017: 35-42 - [c13]Keita Emura
Mis-operation Resistant Searchable Homomorphic Encryption. AsiaCCS 2017: 215-229 - [c12]Keita Emura
Group Signatures with Time-bound Keys Revisited: A New Model and an Efficient Construction. AsiaCCS 2017: 777-788 - [c11]Lihua Wang, Takuya Hayashi
A Generic yet Efficient Method for Secure Inner Product. NSS 2017: 217-232 - [c10]Shohei Kuri, Takuya Hayashi
Privacy preserving extreme learning machine using additively homomorphic encryption. SSCI 2017: 1-8 - [c9]Hiromi Arai, Keita Emura
A Framework of Privacy Preserving Anomaly Detection: Providing Traceability without Big Brother. WPES@CCS 2017: 111-122 - [i8]Le Trieu Phong, Yoshinori Aono, Takuya Hayashi, Lihua Wang, Shiho Moriai:
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2017: 715 (2017) - 2016
- [j3]Yoshinori Aono, Takuya Hayashi
Privacy-Preserving Logistic Regression with Distributed Data Sources via Homomorphic Encryption. IEICE Trans. Inf. Syst. 99-D(8): 2079-2089 (2016) - [c8]Yoshinori Aono, Takuya Hayashi
Scalable and Secure Logistic Regression via Homomorphic Encryption. CODASPY 2016: 142-144 - [c7]Yoshinori Aono, Yuntao Wang
Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator. EUROCRYPT (1) 2016: 789-819 - [c6]Keita Emura, Takuya Hayashi, Shiho Moriai:
Toward securing tire pressure monitoring systems: A case of PRESENT-based implementation. ISITA 2016: 403-407 - [i7]Yoshinori Aono, Takuya Hayashi, Le Trieu Phong, Lihua Wang:
Scalable and Secure Logistic Regression via Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2016: 111 (2016) - [i6]Yoshinori Aono, Yuntao Wang, Takuya Hayashi, Tsuyoshi Takagi:
Improved Progressive BKZ Algorithms and their Precise Cost Estimation by Sharp Simulator. IACR Cryptol. ePrint Arch. 2016: 146 (2016) - 2015
- [c5]Lihua Wang, Takuya Hayashi
POSTER: PRINCESS: A Secure Cloud File Storage System for Managing Data with Hierarchical Levels of Sensitivity. CCS 2015: 1684-1686 - [c4]Keita Emura
A Light-Weight Group Signature Scheme with Time-Token Dependent Linking. LightSec 2015: 37-57 - [i5]Yoshinori Aono, Takuya Hayashi, Le Trieu Phong, Lihua Wang:
Fast and Secure Linear Regression and Biometric Authentication with Security Update. IACR Cryptol. ePrint Arch. 2015: 692 (2015) - 2014
- [j2]Naoyuki Shinohara, Takeshi Shimoyama, Takuya Hayashi
Key Length Estimation of Pairing-Based Cryptosystems Using ηT Pairing over GF(3n). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(1): 236-244 (2014) - [i4]Keita Emura, Takuya Hayashi:
Road-to-Vehicle Communications with Time-Dependent Anonymity: A Light Weight Construction and its Experimental Results. IACR Cryptol. ePrint Arch. 2014: 926 (2014) - 2012
- [j1]Takuya Hayashi
Solving a 676-Bit Discrete Logarithm Problem in GF(36n). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(1): 204-212 (2012) - [c3]Takuya Hayashi
Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397). ASIACRYPT 2012: 43-60 - [c2]Naoyuki Shinohara, Takeshi Shimoyama, Takuya Hayashi
Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing. ISPEC 2012: 228-244 - [i3]Naoyuki Shinohara, Takeshi Shimoyama, Takuya Hayashi, Tsuyoshi Takagi:
Key Length Estimation of Pairing-based Cryptosystems using ηT Pairing. IACR Cryptol. ePrint Arch. 2012: 42 (2012) - [i2]Takuya Hayashi, Takeshi Shimoyama, Naoyuki Shinohara, Tsuyoshi Takagi:
Breaking pairing-based cryptosystems using ηT pairing over GF(397). IACR Cryptol. ePrint Arch. 2012: 345 (2012) - 2010
- [c1]Takuya Hayashi
Solving a 676-Bit Discrete Logarithm Problem in GF(36n). Public Key Cryptography 2010: 351-367 - [i1]Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin'ichiro Matsuo, Masaaki Shirase, Tsuyoshi Takagi:
Solving a 676-bit Discrete Logarithm Problem in GF(36n). IACR Cryptol. ePrint Arch. 2010: 90 (2010)
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-04 21:13 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: