Maki Yoshida
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Maki Yoshida has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Satoshi Obana
Hosei University
5 shared publications Toru Fujiwara
Graduate School of Information Science and Technology, Osaka University
4 shared publications- Toru Fujiwara
Graduate School of Information Science and Technology, Osaka University
4 shared publications Shingo Okamura
2 shared publications- Sumio Morioka
Interstellar Technologies Inc
2 shared publications Itsuki Suzuki
Osaka University
1 shared publication
Latest Publications
- 13 June 2024
- Published by Springer Nature
- p. 499-508
Feasibility Study with Actual Space Rockets Towards Information Theoretically Secure Radio Communication
- 13 June 2024
- Published by Springer Nature
- p. 499-508
Feasibility Study with Actual Space Rockets Towards Information Theoretically Secure Radio Communication
- 26 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 20, 649-653
Hybrid Multiplicative Non-perfect Secret Sharing
A secret sharing scheme is said to be d-multiplicative if the scheme allows the players to multiply shared d secrets by locally converting their shares into an additive sharing of the product. This paper considers the most general setting where d secrets are independently shared by different adversary structures (hybrid) and a partial information can be leaked (non-perfect) and presents a necessary and sufficient condition for d-multiplication to be possible. In particular, even for the extreme case that the i-th secret is known by all but the i-th player who has partial information on the secret (e.g., all but one bit), d-multiplication is impossible.
- 26 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 20, 649-653
Hybrid Multiplicative Non-perfect Secret Sharing
A secret sharing scheme is said to be d-multiplicative if the scheme allows the players to multiply shared d secrets by locally converting their shares into an additive sharing of the product. This paper considers the most general setting where d secrets are independently shared by different adversary structures (hybrid) and a partial information can be leaked (non-perfect) and presents a necessary and sufficient condition for d-multiplication to be possible. In particular, even for the extreme case that the i-th secret is known by all but the i-th player who has partial information on the secret (e.g., all but one bit), d-multiplication is impossible.
- 11 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (5) , 3233-3245
Verifiably Multiplicative Secret Sharing
- 11 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (5) , 3233-3245
Verifiably Multiplicative Secret Sharing
- Open Access
- 9 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (1) , 436-443
Optimal Uniform Secret Sharing
An important problem in secret sharing schemes is minimizing the share size. For (k, n)-threshold schemes and (k, L, n)-ramp schemes, constructions that minimize the share size are known. This paper presents optimal constructions for a more general class of access structures in which subsets with the same cardinality have the same amount of information about the secret. We refer to schemes with such uniform access structures as uniform secret sharing. We first derive a tight lower bound for share entropy and then present an optimal construction. Our lower bound exceeds that previously reported. The optimal construction encodes the secret value using one or more ramp schemes.
- 9 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (1) , 436-443
Open AccessOptimal Uniform Secret Sharing
An important problem in secret sharing schemes is minimizing the share size. For (k, n)-threshold schemes and (k, L, n)-ramp schemes, constructions that minimize the share size are known. This paper presents optimal constructions for a more general class of access structures in which subsets with the same cardinality have the same amount of information about the secret. We refer to schemes with such uniform access structures as uniform secret sharing. We first derive a tight lower bound for share entropy and then present an optimal construction. Our lower bound exceeds that previously reported. The optimal construction encodes the secret value using one or more ramp schemes.
- Open Access
- 26 March 2018
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (8) , 1793-1805
On the (in)efficiency of non-interactive secure multiparty computation
- 26 March 2018
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (8) , 1793-1805
Open AccessOn the (in)efficiency of non-interactive secure multiparty computation
- 10 March 2016
- Published by Springer Nature
- p. 185-193
On the (In)Efficiency of Non-Interactive Secure Multiparty Computation
- 10 March 2016
- Published by Springer Nature
- p. 185-193
On the (In)Efficiency of Non-Interactive Secure Multiparty Computation
- 1 January 2016
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E99.A (6) , 1216-1221
Efficient Usage of Cover Free Families in Broadcast Encryption
- 1 January 2016
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E99.A (6) , 1216-1221
Efficient Usage of Cover Free Families in Broadcast Encryption
- Open Access
- 1 January 2015
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E98.D (1) , 58-64
Individual Restoration of Tampered Pixels for Statistical Fragile Watermarking
- 1 January 2015
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E98.D (1) , 58-64
Open AccessIndividual Restoration of Tampered Pixels for Statistical Fragile Watermarking