Maki Yoshida

Orcid: 0000-0002-1267-0058

According to our database1, Maki Yoshida authored at least 42 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Towards Optimal Non-interactive Secure Multiparty Computation for Abelian Programs.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Secure Communication via GNSS-based Key Synchronization.
Proceedings of Work-in-Progress in Hardware and Software for Location Computation (WIPHAL 2023), 2023

On the Communication Complexity of Private Function Sharing and Computation.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Hybrid Multiplicative Non-perfect Secret Sharing.
Proceedings of the IEEE International Symposium on Information Theory, 2022

On Cryptographic Algorithms and Key Length for Delayed Disclosure Authentication of GNSS.
Proceedings of the 2022 International Conference on Localization and GNSS, 2022

Virtual Wiretap Channel Based on Wireless Two-way Interferometry.
Proceedings of the IEEE Global Communications Conference, 2022

2021
Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets.
IACR Cryptol. ePrint Arch., 2021

Hybrid Multiplicative Secret Sharing.
Proceedings of the IEEE Information Theory Workshop, 2021

2020
Compact Verifiably Multiplicative Secret Sharing.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing.
Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, 2020

2019
Verifiably Multiplicative Secret Sharing.
IEEE Trans. Inf. Theory, 2019

Optimal Uniform Secret Sharing.
IEEE Trans. Inf. Theory, 2019

2018
Flaws in a Verifiably Multiplicative Secret Sharing Scheme from ICITS 2017.
IACR Cryptol. ePrint Arch., 2018

On the (in)efficiency of non-interactive secure multiparty computation.
Des. Codes Cryptogr., 2018

2016
Efficient Usage of Cover Free Families in Broadcast Encryption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Analyzing and Fixing the QACCE Security of QUIC.
Proceedings of the Security Standardisation Research - Third International Conference, 2016

An Efficient Construction of Non-Interactive Secure Multiparty Computation.
Proceedings of the Cryptology and Network Security - 15th International Conference, 2016

2015
Individual Restoration of Tampered Pixels for Statistical Fragile Watermarking.
IEICE Trans. Inf. Syst., 2015

On the Impossibility of <i>d</i>-Multiplicative Non-perfect Secret Sharing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2014
Salt-and-pepper image watermarking system for IHC evaluation criteria.
Proceedings of the 1st international workshop on Information hiding and its criteria for evaluation, 2014

2013
Detection of Cheaters in Non-interactive Polynomial Evaluation.
IACR Cryptol. ePrint Arch., 2013

2012
Generic Construction of GUC Secure Commitment in the KRK Model.
Proceedings of the Advances in Information and Computer Security, 2012

New hybrid additive-multiplicative watermarking with better tradeoff between image quality and detection accuracy.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

Optimum General Threshold Secret Sharing.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2011
Toward Digital Watermarking for Cryptographic Data.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

2010
The Vector Decomposition Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

2009
Flexible Timed-Release Encryption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Improving Capability of Locating Tampered Pixels of Statistical Fragile Watermarking.
Proceedings of the Digital Watermarking, 8th International Workshop, 2009

Watermarking Cryptographic Data.
Proceedings of the Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2009), 2009

2008
Expiration Dated Fingerprinting.
Proceedings of the 4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2008), 2008

Anonymous Fingerprinting for Predelivery of Contents.
Proceedings of the Information Security and Cryptology, 2008

Efficient Multi-authorizer Accredited Symmetrically Private Information Retrieval.
Proceedings of the Information and Communications Security, 10th International Conference, 2008

2007
A Private and Consistent Data Retrieval Scheme with Log-Squared Communication.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

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., 2007

Secure Construction for Nonlinear Function Threshold Ramp Secret Sharing.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A New Scheme for Optimum Decoding of Additive Watermarks Embedded in Spatial Domain.
Proceedings of the 3rd International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007), 2007

2006
On the Security of Tag-KEM for Signcryption.
Proceedings of the Second Workshop on Cryptography for Ad-hoc Networks, 2006

A New Optimum Detection Scheme for Additive Watermarks Embedded in Spatial Domain.
Proceedings of the Second International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2006), 2006

2005
Unlinkable Delivery System for Interactive Dramas.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Coin-based Anonymous Fingerprinting Scheme with Automatic Identification of Redistributors.
Proceedings of the ISSA 2005 New Knowledge Today Conference, 29 June, 2005

A Timed-Release Key Management Scheme for Backward Recovery.
Proceedings of the Information Security and Cryptology, 2005

2001
Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem.
Proceedings of the Cryptography and Coding, 2001


  Loading...