default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitsuru Tada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i2]Asuka Wakasugi, Mitsuru Tada:
A proposal for quantum GRS algorithm and the cryptanalysis for ROLLO and RQC. IACR Cryptol. ePrint Arch. 2023: 994 (2023)- 2022
- [c13]Kazumune Tanabe, Mitsuru Tada:
Aggregate message authentication codes for DAG structures. ICSPIS 2022: 5-10 - [i1]Asuka Wakasugi, Mitsuru Tada:
Security analysis for BIKE, Classic McEliece and HQC against the quantum ISD algorithms. IACR Cryptol. ePrint Arch. 2022: 1771 (2022) - 2021
- [c12]Mitsuru Tada:
Attribute sharing systems of the star type. ICSPIS 2021: 33-36 - 2020
- [c11]Yuta Ishii, Mitsuru Tada:
Structurally aggregate message authentication codes. ISITA 2020: 339-343 - [c10]Naoya Shiratori, Mitsuru Tada:
Delegatable proof of knowledge systems. ISITA 2020: 363-367
2010 – 2019
- 2018
- [c9]Yuto Ehara, Mitsuru Tada:
How to generate transparent random numbers using blockchain. ISITA 2018: 169-173
2000 – 2009
- 2008
- [j5]Shunichi Hayashi, Mitsuru Tada:
A Digital Signature Scheme Based on NP-Complete Lattice Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(5): 1253-1264 (2008) - 2007
- [j4]Shunichi Hayashi, Mitsuru Tada:
New NP-Complete Problems Associated with Lattices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 941-948 (2007) - 2005
- [j3]Kei Kawauchi, Mitsuru Tada:
On the Security and the Efficiency of Multi-Signature Schemes Based on a Trapdoor One-Way Permutation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1274-1282 (2005) - 2003
- [j2]Mitsuru Tada:
A Secure Multisignature Scheme with Signing Order Verifiability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(1): 73-88 (2003) - [c8]Kei Kawauchi, Mitsuru Tada:
On the Extract Security of Multi-signature Schemes Based on RSA. ACISP 2003: 336-349 - 2002
- [c7]Mitsuru Tada:
An Order-Specified Multisignature Scheme Secure against Active Insider Attacks. ACISP 2002: 328-345 - [c6]Takeshi Okamoto, Mitsuru Tada, Atsuko Miyaji
:
An Improved Fast Signature Scheme without Online Multiplication. Financial Cryptography 2002: 152-167 - 2001
- [c5]Ayako Maeda, Atsuko Miyaji, Mitsuru Tada:
Efficient and Unconditionally Secure Verifiable Threshold Changeable Scheme. ACISP 2001: 403-416 - [c4]Kei Kawauchi, Hiroshi Minato, Atsuko Miyaji, Mitsuru Tada:
A Multi-signature Scheme with Signers' Intentions Secure against Active Attacks. ICISC 2001: 328-340 - [c3]Takeshi Okamoto, Mitsuru Tada, Atsuko Miyaji:
Efficient "on the Fly" Signature Schemes Based on Integer Factoring. INDOCRYPT 2001: 275-286 - 2000
- [c2]Mike Burmester, Yvo Desmedt, Hiroshi Doi, Masahiro Mambo, Eiji Okamoto, Mitsuru Tada, Yuko Yoshifuji:
A Structured ElGamal-Type Multisignature Scheme. Public Key Cryptography 2000: 466-483
1990 – 1999
- 1999
- [c1]Takeshi Okamoto, Mitsuru Tada, Eiji Okamoto:
Extended Proxy Signatures for Smart Cards. ISW 1999: 247-258 - 1997
- [j1]Mitsuru Tada, Makoto Tatsuta:
The function ëa/mû\lfloor a/m\rfloor in sharply bounded arithmetic. Arch. Math. Log. 37(1): 51-57 (1997)
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-05-08 21:47 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:
