default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaki Yoshida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c28]Maki Yoshida:
On the Communication Complexity of Private Function Sharing and Computation. ISIT 2023: 258-263- [c27]Maki Yoshida, Sumio Morioka, Satoshi Obana:
Secure Communication via GNSS-based Key Synchronization. WIPHAL 2023 - 2022
- [c26]Nobuyasu Shiga, Satoshi Yasuda, Kouki Yonaga, Kenichi Takizawa, Maki Yoshida:
Virtual Wiretap Channel Based on Wireless Two-way Interferometry. GLOBECOM 2022: 6188-6193 - [c25]Maki Yoshida, Sumio Morioka
, Satoshi Obana:
On Cryptographic Algorithms and Key Length for Delayed Disclosure Authentication of GNSS. ICL-GNSS 2022: 1-6 - [c24]Maki Yoshida:
Hybrid Multiplicative Non-perfect Secret Sharing. ISIT 2022: 649-653 - 2021
- [c23]Maki Yoshida:
Hybrid Multiplicative Secret Sharing. ITW 2021: 1-5 - [i3]Akinori Kawachi, Maki Yoshida:
Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2021: 1037 (2021) - 2020
- [c22]Satoshi Obana, Maki Yoshida:
Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing. ICETE (2) 2020: 322-329 - [c21]Maki Yoshida, Satoshi Obana:
Compact Verifiably Multiplicative Secret Sharing. ISITA 2020: 437-441
2010 – 2019
- 2019
- [j12]Maki Yoshida, Toru Fujiwara, Marc P. C. Fossorier:
Optimal Uniform Secret Sharing. IEEE Trans. Inf. Theory 65(1): 436-443 (2019) - [j11]Maki Yoshida, Satoshi Obana:
Verifiably Multiplicative Secret Sharing. IEEE Trans. Inf. Theory 65(5): 3233-3245 (2019) - 2018
- [j10]Maki Yoshida, Satoshi Obana:
On the (in)efficiency of non-interactive secure multiparty computation. Des. Codes Cryptogr. 86(8): 1793-1805 (2018) - [i2]Maki Yoshida, Satoshi Obana:
Flaws in a Verifiably Multiplicative Secret Sharing Scheme from ICITS 2017. IACR Cryptol. ePrint Arch. 2018: 83 (2018) - 2017
- [c20]Maki Yoshida, Satoshi Obana:
Verifiably Multiplicative Secret Sharing. ICITS 2017: 73-82 - 2016
- [j9]Maki Yoshida, Toru Fujiwara:
Efficient Usage of Cover Free Families in Broadcast Encryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1216-1221 (2016) - [c19]Satoshi Obana, Maki Yoshida:
An Efficient Construction of Non-Interactive Secure Multiparty Computation. CANS 2016: 604-614 - [c18]Hideki Sakurada, Kazuki Yoneyama, Yoshikazu Hanatani, Maki Yoshida:
Analyzing and Fixing the QACCE Security of QUIC. SSR 2016: 1-31 - 2015
- [j8]Maki Yoshida, Kazuya Ohkita, Toru Fujiwara:
Individual Restoration of Tampered Pixels for Statistical Fragile Watermarking. IEICE Trans. Inf. Syst. 98-D(1): 58-64 (2015) - [j7]Maki Yoshida, Toru Fujiwara:
On the Impossibility of d-Multiplicative Non-perfect Secret Sharing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(2): 767-770 (2015) - [c17]Maki Yoshida, Satoshi Obana:
On the (In)Efficiency of Non-Interactive Secure Multiparty Computation. ICISC 2015: 185-193 - 2014
- [c16]Hironobu Tozuka, Maki Yoshida, Toru Fujiwara:
Salt-and-pepper image watermarking system for IHC evaluation criteria. IWIHC@AsiaCCS 2014: 31-36 - [e1]Maki Yoshida, Koichi Mouri:
Advances in Information and Computer Security - 9th International Workshop on Security, IWSEC 2014, Hirosaki, Japan, August 27-29, 2014. Proceedings. Lecture Notes in Computer Science 8639, Springer 2014, ISBN 978-3-319-09842-5 [contents] - 2013
- [i1]Maki Yoshida, Satoshi Obana:
Detection of Cheaters in Non-interactive Polynomial Evaluation. IACR Cryptol. ePrint Arch. 2013: 32 (2013) - 2012
- [c15]Maki Yoshida, Toru Fujiwara, Marc P. C. Fossorier:
Optimum General Threshold Secret Sharing. ICITS 2012: 187-204 - [c14]Seigo Ikeda, Maki Yoshida, Toru Fujiwara:
New hybrid additive-multiplicative watermarking with better tradeoff between image quality and detection accuracy. ISITA 2012: 797-801 - [c13]Itsuki Suzuki, Maki Yoshida, Toru Fujiwara:
Generic Construction of GUC Secure Commitment in the KRK Model. IWSEC 2012: 244-260 - 2011
- [j6]Maki Yoshida, Toru Fujiwara:
Toward Digital Watermarking for Cryptographic Data. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(1): 270-272 (2011) - 2010
- [j5]Maki Yoshida, Shigeo Mitsunari, Toru Fujiwara:
The Vector Decomposition Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(1): 188-193 (2010)
2000 – 2009
- 2009
- [j4]Maki Yoshida, Toru Fujiwara:
Flexible Timed-Release Encryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 222-225 (2009) - [c12]Maki Yoshida, Toru Fujiwara:
Watermarking Cryptographic Data. IIH-MSP 2009: 40-43 - [c11]Kazuya Ohkita, Maki Yoshida, Itaru Kitamura, Toru Fujiwara:
Improving Capability of Locating Tampered Pixels of Statistical Fragile Watermarking. IWDW 2009: 279-293 - 2008
- [c10]Mohamed Layouni, Maki Yoshida, Shingo Okamura:
Efficient Multi-authorizer Accredited Symmetrically Private Information Retrieval. ICICS 2008: 387-402 - [c9]Kazuhiro Haramura, Maki Yoshida, Toru Fujiwara:
Anonymous Fingerprinting for Predelivery of Contents. ICISC 2008: 134-151 - [c8]Maki Yoshida, Toru Fujiwara:
Expiration Dated Fingerprinting. IIH-MSP 2008: 147-150 - 2007
- [j3]Satoshi Nakayama, Maki Yoshida, Shingo Okamura, Toru Fujiwara:
A Private and Consistent Data Retrieval Scheme with Log-Squared Communication. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 204-215 (2007) - [j2]Takaaki Fujita, Maki Yoshida, Toru Fujiwara:
A New Scheme to Realize the Optimum Watermark Detection for the Additive Embedding Scheme with the Spatial Domain. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 216-225 (2007) - [c7]Maki Yoshida, Itaru Kitamura, Toru Fujiwara:
A New Scheme for Optimum Decoding of Additive Watermarks Embedded in Spatial Domain. IIH-MSP 2007: 16-19 - [c6]Maki Yoshida, Toru Fujiwara:
Secure Construction for Nonlinear Function Threshold Ramp Secret Sharing. ISIT 2007: 1041-1045 - 2006
- [c5]Maki Yoshida, Takaaki Fujita, Toru Fujiwara:
A New Optimum Detection Scheme for Additive Watermarks Embedded in Spatial Domain. IIH-MSP 2006: 101-104 - [c4]Maki Yoshida, Toru Fujiwara:
On the Security of Tag-KEM for Signcryption. WCAN@ICALP 2006: 83-91 - 2005
- [j1]Shingo Okamura, Yoshiyuki Konishi, Maki Yoshida, Toru Fujiwara:
Unlinkable Delivery System for Interactive Dramas. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 262-269 (2005) - [c3]Maki Yoshida, Shigeo Mitsunari, Toru Fujiwara:
A Timed-Release Key Management Scheme for Backward Recovery. ICISC 2005: 3-14 - [c2]Shingo Okamura, Maki Yoshida, Toru Fujiwara:
Coin-based Anonymous Fingerprinting Scheme with Automatic Identification of Redistributors. ISSA 2005: 1-12 - 2001
- [c1]Maki Yoshida, Toru Fujiwara:
Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem. IMACC 2001: 27-37
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-04-25 05:58 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:
