Yohei Watanabe

Yohei Watanabe

Auto-generated profile, based on publicly available information

Yohei Watanabe

The University of Electro-Communications

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 January 2017 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
YWYohei Watanabe
Yohei Watanabe
KEKeita Emura
Keita Emura
JSJae Hong Seo
Jae Hong Seo

23 March 2022 in New Generation Computing
Verified
Journal Article
Open access
PDF file
YAYoshiki Abe
Yoshiki Abe
TNTakeshi Nakai
Takeshi Nakai
YKYoshihisa Kuroki
Yoshihisa Kuroki
SSShinnosuke Suzuki
Shinnosuke Suzuki
YKYuta Koga
Yuta Koga
KOKazuo Ohta
Kazuo Ohta
Card-based cryptography is a variety of secure multiparty computation (MPC). Recently, a new technique called private operations was introduced because the protocol can be implemented with fewer cards than that by using the conventional technique called the shuffle. For example, Nakai et al. showed that if the private operations are available, secure computations of AND and OR operations for two inputs can be realized simultaneously by using four cards, and the protocol is applied to a four-card majority voting protocol with three inputs. This paper shows that only three cards are sufficient to construct a majority voting protocol with three inputs. Specifically, we propose two constructions of three-input majority voting protocols. One is a protocol assuming that players can announce their output, and the other is not allowed. Compared to Nakai et al.’s protocol, the protocol with the announcement is realized without any additional private operations and communications. On the other hand, the second construction requires two more private operations and communications because it removes the assumption on the announcement from the first construction. More importantly, the idea of the second protocol can be extended to an n-input majority voting protocol with n cards, which is the main result of this paper.

18 February 2016
Verified
Book Chapter
Closed access
PDF file
YWYohei Watanabe
Yohei Watanabe
JSJunji Shikata
Junji Shikata

27 April 2021
Verified
Book Chapter
Closed access
PDF file
YWYohei Watanabe
Yohei Watanabe
NYNaoto Yanai
Naoto Yanai
JSJunji Shikata
Junji Shikata

10 July 2023
Verified
Conference Paper
Open access
KYKyosuke Yamashita
Kyosuke Yamashita
KHKeisuke Hara
Keisuke Hara
YWYohei Watanabe
Yohei Watanabe
NYNaoto Yanai
Naoto Yanai
JSJunji Shikata
Junji Shikata
This paper considers the problem of balancing traceability and anonymity in designated verifier signatures (DVS), which are a kind of group-oriented signatures. That is, we propose claimable designated verifier signatures (CDVS), where a signer is able to claim that he/she indeed created a signature later. Ordinal DVS does not provide any traceability, which could indicate too strong anonymity. Thus, adding claimability, which can be seen as a sort of traceability, moderates anonymity. We demonstrate two generic constructions of CDVS from (i) ring signatures, (non-ring) signatures, pseudorandom function, and commitment scheme, and (ii) claimable ring signatures (by Park and Sealfon, CRYPTO’19).

15 May 2021 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
KEKeita Emura
Keita Emura
ATAtsushi Takayasu
Atsushi Takayasu
YWYohei Watanabe
Yohei Watanabe