default search action
Tadanori Teruya
Person information
- unicode name: 照屋 唯紀
- affiliation: National Institute of Advanced Industrial Science and Technology (AIST), Cyber Physical Security Research Center, Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Ryu Ishii, Kyosuke Yamashita, Zihao Song, Yusuke Sakai, Tadanori Teruya, Takahiro Matsuda, Goichiro Hanaoka, Kanta Matsuura, Tsutomu Matsumoto:
Constraints and Evaluations on Signature Transmission Interval for Aggregate Signatures with Interactive Tracing Functionality. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(4): 619-633 (2024) - [c21]Takashi Yagawa, Tadanori Teruya, Kuniyasu Suzaki, Hirotake Abe:
Delegating Verification for Remote Attestation Using TEE. EuroS&P Workshops 2024: 186-192 - 2023
- [j11]Kyosuke Yamashita, Ryu Ishii, Yusuke Sakai, Tadanori Teruya, Takahiro Matsuda, Goichiro Hanaoka, Kanta Matsuura, Tsutomu Matsumoto:
Fault-Tolerant Aggregate Signature Schemes against Bandwidth Consumption Attack. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(9): 1177-1188 (2023) - [c20]Ryuya Hayashi, Taiki Asano, Junichiro Hayata, Takahiro Matsuda, Shota Yamada, Shuichi Katsumata, Yusuke Sakai, Tadanori Teruya, Jacob C. N. Schuldt, Nuttapong Attrapadung, Goichiro Hanaoka, Kanta Matsuura, Tsutomu Matsumoto:
Signature for Objects: Formalizing How to Authenticate Physical Data and More. FC (1) 2023: 182-199 - 2022
- [j10]Ryu Ishii, Kyosuke Yamashita, Yusuke Sakai, Tadanori Teruya, Takahiro Matsuda, Goichiro Hanaoka, Kanta Matsuura, Tsutomu Matsumoto:
Aggregate Signature Schemes with Traceability of Devices Dynamically Generating Invalid Signatures. IEICE Trans. Inf. Syst. 105-D(11): 1845-1856 (2022) - [c19]Ryu Ishii, Kyosuke Yamashita, Zihao Song, Yusuke Sakai, Tadanori Teruya, Goichiro Hanaoka, Kanta Matsuura, Tsutomu Matsumoto:
Constraints and Evaluations on Signature Transmission Interval for Aggregate Signatures with Interactive Tracing Functionality. ADIoT 2022: 51-71 - [c18]Nuttapong Attrapadung, Hiraku Morita, Kazuma Ohara, Jacob C. N. Schuldt, Tadanori Teruya, Kazunari Tozawa:
Secure Parallel Computation on Privately Partitioned Data and Applications. CCS 2022: 151-164 - 2021
- [j9]Tadanori Teruya:
A Note on Subgroup Security in Discrete Logarithm-Based Cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(1): 104-120 (2021) - [c17]Ryu Ishii, Kyosuke Yamashita, Yusuke Sakai, Takahiro Matsuda, Tadanori Teruya, Goichiro Hanaoka, Kanta Matsuura, Tsutomu Matsumoto:
Aggregate Signature with Traceability of Devices Dynamically Generating Invalid Signatures. ACNS Workshops 2021: 378-396 - [c16]Nuttapong Attrapadung, Goichiro Hanaoka, Takahiro Matsuda, Hiraku Morita, Kazuma Ohara, Jacob C. N. Schuldt, Tadanori Teruya, Kazunari Tozawa:
Oblivious Linear Group Actions and Applications. CCS 2021: 630-650 - 2020
- [j8]Hiraku Morita, Nuttapong Attrapadung, Tadanori Teruya, Satsuya Ohata, Koji Nuida, Goichiro Hanaoka:
Constant-Round Client-Aided Two-Server Secure Comparison Protocol and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(1): 21-32 (2020) - [j7]Naohisa Nishida, Tatsumi Oba, Yuji Unagami, Jason Paul Cruz, Naoto Yanai, Tadanori Teruya, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka:
Efficient Secure Neural Network Prediction Protocol Reducing Accuracy Degradation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(12): 1367-1380 (2020) - [i6]Daiki Hayashida, Kenichiro Hayasaka, Tadanori Teruya:
Efficient Final Exponentiation via Cyclotomic Structure for Pairings over Families of Elliptic Curves. IACR Cryptol. ePrint Arch. 2020: 875 (2020)
2010 – 2019
- 2019
- [j6]Hiromasa Kitai, Jason Paul Cruz, Naoto Yanai, Naohisa Nishida, Tatsumi Oba, Yuji Unagami, Tadanori Teruya, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka:
MOBIUS: Model-Oblivious Binarized Neural Networks. IEEE Access 7: 139021-139034 (2019) - [c15]Yoshitatsu Matsuda, Tadanori Teruya, Kenji Kashiwabara:
Efficient Estimation of Number of Short Lattice Vectors in Search Space under Randomness Assumption. APKC@AsiaCCS 2019: 13-22 - 2018
- [c14]Tadanori Teruya:
A Note on Subgroup Security in Pairing-Based Cryptography. APKC@AsiaCCS 2018: 35-43 - [c13]Nuttapong Attrapadung, Goichiro Hanaoka, Shigeo Mitsunari, Yusuke Sakai, Kana Shimizu, Tadanori Teruya:
Efficient Two-level Homomorphic Encryption in Prime-order Bilinear Groups and A Fast Implementation in WebAssembly. AsiaCCS 2018: 685-697 - [c12]Hiraku Morita, Nuttapong Attrapadung, Tadanori Teruya, Satsuya Ohata, Koji Nuida, Goichiro Hanaoka:
Constant-Round Client-Aided Secure Comparison Protocol. ESORICS (2) 2018: 395-415 - [c11]Tadanori Teruya:
An Observation on the Randomness Assumption over Lattices. ISITA 2018: 311-315 - [c10]Ryo Kato, Naohisa Nishida, Ryo Hirano, Tatsumi Oba, Yuji Unagami, Shota Yamada, Tadanori Teruya, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka:
Embedding Lemmas for Functional Encryption. ISITA 2018: 712-716 - [c9]Tadanori Teruya, Kenji Kashiwabara, Goichiro Hanaoka:
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem. Public Key Cryptography (1) 2018: 437-460 - [i5]Hiromasa Kitai, Jason Paul Cruz, Naoto Yanai, Naohisa Nishida, Tatsumi Oba, Yuji Unagami, Tadanori Teruya, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka:
MOBIUS: Model-Oblivious Binarized Neural Networks. CoRR abs/1811.12028 (2018) - [i4]Tadanori Teruya, Kenji Kashiwabara, Goichiro Hanaoka:
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem. IACR Cryptol. ePrint Arch. 2018: 44 (2018) - [i3]Yoshitatsu Matsuda, Tadanori Teruya, Kenji Kashiwabara:
Estimation of the Success Probability of Random Sampling by the Gram-Charlier Approximation. IACR Cryptol. ePrint Arch. 2018: 815 (2018) - 2016
- [j5]Hiroshi Onuki, Tadanori Teruya, Naoki Kanayama, Shigenori Uchiyama:
The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets. JSIAM Lett. 8: 9-12 (2016) - [c8]Nuttapong Attrapadung, Goichiro Hanaoka, Tsutomu Matsumoto, Tadanori Teruya, Shota Yamada:
Attribute Based Encryption with Direct Efficiency Tradeoff. ACNS 2016: 249-266 - [c7]Tadanori Teruya, Yoshiki Aoki, Jun Sakuma:
Fairy ring: Ubiquitous secure multiparty computation framework for smartphone applications. ISITA 2016: 708-712 - [c6]Hiroshi Onuki, Tadanori Teruya, Naoki Kanayama, Shigenori Uchiyama:
Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation. IWSEC 2016: 319-334 - 2015
- [j4]Eric Zavattoni, Luis J. Dominguez Perez, Shigeo Mitsunari, Ana H. Sánchez-Ramírez, Tadanori Teruya, Francisco Rodríguez-Henríquez:
Software Implementation of an Attribute-Based Encryption Scheme. IEEE Trans. Computers 64(5): 1429-1441 (2015) - [c5]Yusuke Kanbara, Tadanori Teruya, Naoki Kanayama, Takashi Nishide, Eiji Okamoto:
Software Implementation of a Pairing Function for Public Key Cryptosystems. ICITCS 2015: 1-5 - [c4]Tadanori Teruya, Koji Nuida, Kana Shimizu, Goichiro Hanaoka:
On Limitations and Alternatives of Privacy-Preserving Cryptographic Protocols for Genomic Data. IWSEC 2015: 242-261 - 2014
- [j3]Naoki Kanayama, Yang Liu, Eiji Okamoto, Kazutaka Saito, Tadanori Teruya, Shigenori Uchiyama:
Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(1): 300-302 (2014) - [j2]Yang Liu, Naoki Kanayama, Kazutaka Saito, Tadanori Teruya, Shigenori Uchiyama, Eiji Okamoto:
Computing fixed argument pairings with the elliptic net algorithm. JSIAM Lett. 6: 69-72 (2014) - [i2]Eric Zavattoni, Luis J. Dominguez Perez, Shigeo Mitsunari, Ana H. Sánchez-Ramírez, Tadanori Teruya, Francisco Rodríguez-Henríquez:
Software implementation of an Attribute-Based Encryption scheme. IACR Cryptol. ePrint Arch. 2014: 401 (2014) - 2013
- [c3]Tadanori Teruya, Jun Sakuma:
Round-Efficient Private Stable Matching from Additive Homomorphic Encryption. ISC 2013: 69-86 - [c2]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]Naoki Kanayama, Tadanori Teruya, Eiji Okamoto:
Scalar Multiplication on Pairing Friendly Elliptic Curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1285-1292 (2011) - 2010
- [c1]Jean-Luc Beuchat, Jorge Enrique González-Díaz, Shigeo Mitsunari, Eiji Okamoto, Francisco Rodríguez-Henríquez, Tadanori Teruya:
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves. Pairing 2010: 21-39 - [i1]Jean-Luc Beuchat, Jorge Enrique González-Díaz, Shigeo Mitsunari, Eiji Okamoto, Francisco Rodríguez-Henríquez, Tadanori Teruya:
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves. IACR Cryptol. ePrint Arch. 2010: 354 (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-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint