Yohei Watanabe
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
Research Subjects
Yohei Watanabe has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Mitsugu Iwamoto
The University of Electro-Communications
15 shared publications - Junji Shikata
Yokohama National University
7 shared publications - Kyoichi Asano
The University of Electro-Communications
7 shared publications - Takeshi Nakai
Toyohashi University of Technology, Toyohashi-shi, Japan
6 shared publications - Kazuo Ohta
Department of Informatics, The University of Electro-Communications, Tokyo, Japan
4 shared publications - Naoto Yanai
Osaka University, Osaka, Japan
4 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3415-3429
High-throughput Verifiable Distributed OPRF from Gold PRF
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3415-3429
Open AccessHigh-throughput Verifiable Distributed OPRF from Gold PRF
- Open Access
- 14 October 2026
- Published by Springer Nature in New Generation Computing
- Vol. 44 (4) , 31
Single-Shuffle Card-Based Protocols for Any Boolean Circuit with Six Cards per Gate
Card-based protocols perform secure computation using physical playing cards, and their efficiency is primarily evaluated by two metrics: the number of cards and the number of shuffles. In this paper, we present three new card-based protocols that reduce the number of cards. The first protocol supports any Boolean circuit and decreases the number of cards. The second protocol extends the first to a committed-format version, while the third is specialized for Boolean circuits without a branched input, achieving an even smaller number of cards. All the proposed protocols are based on Yao’s garbled-circuit framework, similar to previous single-shuffle card-based protocols. Our main contribution is a novel encoding method that represents the truth table of each Boolean gate with fewer cards than existing schemes. Consequently, our protocols require only six cards per gate in a single-shuffle execution, providing a significant improvement in efficiency over prior work. Furthermore, by incorporating the card-based free-XOR introduced by Manabe–Shinagawa, we can further reduce the number of cards in certain configurations.
- 14 October 2026
- Published by Springer Nature in New Generation Computing
- Vol. 44 (4) , 31
Open AccessSingle-Shuffle Card-Based Protocols for Any Boolean Circuit with Six Cards per Gate
Card-based protocols perform secure computation using physical playing cards, and their efficiency is primarily evaluated by two metrics: the number of cards and the number of shuffles. In this paper, we present three new card-based protocols that reduce the number of cards. The first protocol supports any Boolean circuit and decreases the number of cards. The second protocol extends the first to a committed-format version, while the third is specialized for Boolean circuits without a branched input, achieving an even smaller number of cards. All the proposed protocols are based on Yao’s garbled-circuit framework, similar to previous single-shuffle card-based protocols. Our main contribution is a novel encoding method that represents the truth table of each Boolean gate with fewer cards than existing schemes. Consequently, our protocols require only six cards per gate in a single-shuffle execution, providing a significant improvement in efficiency over prior work. Furthermore, by incorporating the card-based free-XOR introduced by Manabe–Shinagawa, we can further reduce the number of cards in certain configurations.
- 18 July 2026
- Published by Springer Nature
- p. 142-160
Efficient Additive Randomized Encodings for String Oblivious Transfer: A Core Primitive for General Functions
- 18 July 2026
- Published by Springer Nature
- p. 142-160
Efficient Additive Randomized Encodings for String Oblivious Transfer: A Core Primitive for General Functions
- Open Access
- 1 July 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E109.A (7) , 1272-1298
Attribute-Based Anonymous Credentials with Update Broadcast
Attribute-based anonymous credentials (ABC) allow users to prove possession of attributes (e.g., ages and addresses) to verifiers using credentials issued by trusted issuers. When considering updating credentials on attributes, each user has different credentials, and an issuer usually requires the credentials as input to update them. If the issuer could generate a common update token without taking user-specific information like their credential as input and broadcast this token, and each user updates their credential on their own, the issuer can reduce the communication and computation cost when updating. However, existing ABC schemes and their variants do not support this functionality. In this paper, we introduce ABC with update broadcast (ABC-UB), which enables an issuer to update each user's credentials by broadcasting a common update token. Each user can update their credentials using the token on their own. This feature reduces the issuer's communication and computation costs when updating credentials. In addition, the credential size on our ABC-UB scheme is constant, and the update token size is also constant. To construct an ABC-UB scheme, we introduce a new digital signature scheme called unlinkable redactable signature with update broadcast (URS-UB) and construct a concrete URS-UB scheme from pairings. Our URS-UB can generate a common update token without taking existing signatures as input.
- 1 July 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E109.A (7) , 1272-1298
Open AccessAttribute-Based Anonymous Credentials with Update Broadcast
Attribute-based anonymous credentials (ABC) allow users to prove possession of attributes (e.g., ages and addresses) to verifiers using credentials issued by trusted issuers. When considering updating credentials on attributes, each user has different credentials, and an issuer usually requires the credentials as input to update them. If the issuer could generate a common update token without taking user-specific information like their credential as input and broadcast this token, and each user updates their credential on their own, the issuer can reduce the communication and computation cost when updating. However, existing ABC schemes and their variants do not support this functionality. In this paper, we introduce ABC with update broadcast (ABC-UB), which enables an issuer to update each user's credentials by broadcasting a common update token. Each user can update their credentials using the token on their own. This feature reduces the issuer's communication and computation costs when updating credentials. In addition, the credential size on our ABC-UB scheme is constant, and the update token size is also constant. To construct an ABC-UB scheme, we introduce a new digital signature scheme called unlinkable redactable signature with update broadcast (URS-UB) and construct a concrete URS-UB scheme from pairings. Our URS-UB can generate a common update token without taking existing signatures as input.
- Open Access
- 28 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 66465-66476
eFPGA-Based Datapath Redaction for Processor IP Protection
Logic locking and eFPGA-based redaction have emerged as promising security-by-design approaches for protecting hardware intellectual property (IP) in outsourced fabrication. While prior work has focused primarily on application-specific IPs, protecting general-purpose systems—such as processors with customized datapath extensions—remains underexplored. This setting is particularly challenging because workloads are unknown at design time and exhibit diverse tolerance to errors introduced by protection mechanisms, complicating the evaluation of effective IP protection. In this work, we propose PreLock, an eFPGA-based redaction method for securing processor datapath IPs. PreLock replaces selected datapath components with a compact eFPGA fabric, inducing pronounced functional and quality degradation across diverse workloads, including highly error-tolerant applications. We study three operator types and systematically examine the impact of configuration parameters and cost-related metrics that have been largely overlooked in prior studies. We further conduct comprehensive security analyses under multiple attack models to identify configurations that satisfy given security requirements while minimizing implementation cost. Based on these results, we derive principled strategies for configuration tuning and outline future directions toward more effective security-by-design solutions for hardware IP protection.
- 28 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 66465-66476
Open AccesseFPGA-Based Datapath Redaction for Processor IP Protection
Logic locking and eFPGA-based redaction have emerged as promising security-by-design approaches for protecting hardware intellectual property (IP) in outsourced fabrication. While prior work has focused primarily on application-specific IPs, protecting general-purpose systems—such as processors with customized datapath extensions—remains underexplored. This setting is particularly challenging because workloads are unknown at design time and exhibit diverse tolerance to errors introduced by protection mechanisms, complicating the evaluation of effective IP protection. In this work, we propose PreLock, an eFPGA-based redaction method for securing processor datapath IPs. PreLock replaces selected datapath components with a compact eFPGA fabric, inducing pronounced functional and quality degradation across diverse workloads, including highly error-tolerant applications. We study three operator types and systematically examine the impact of configuration parameters and cost-related metrics that have been largely overlooked in prior studies. We further conduct comprehensive security analyses under multiple attack models to identify configurations that satisfy given security requirements while minimizing implementation cost. Based on these results, we derive principled strategies for configuration tuning and outline future directions toward more effective security-by-design solutions for hardware IP protection.
- Open Access
- 1 January 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E109.A (9) , 1649-1663
A Zero-Knowledge Range Argument with Preprocessing: Generic, Concretely Efficient, and Post-Quantum
Range arguments are a type of zero-knowledge proofs that aim to prove that a prover's committed value falls within a specified range for a verifier. Previously, most range arguments were constructed based on the discrete logarithm (DLOG) assumption, and hence, exponentiation operation is required for proof generation and verification. In addition, it is generally known that splitting a zero-knowledge proof protocol into a preprocessing phase and an online phase makes computation after fixing the input efficient. Still, such protocol has yet to be known for range arguments. This paper proposes an efficient range arguments protocol with a preprocessing phase. Our proposal takes a new approach by using arithmetic circuits to express the constraints that the prover must prove. The prover (resp. verifier) can generate (resp. verify) a part of proof based on multiplication and addition operations instead of exponentiation operations. Our range argument is a generic construction that does not rely on any particular mathematical assumptions, which enables us to construct a post-quantum range argument. The implementation evaluation shows that the total computation time for the prover and verifier in the online phase is efficient compared to Bulletproofs, one of the state-of-the-art range proofs. Especially, the prover computation is efficient.
- 1 January 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E109.A (9) , 1649-1663
Open AccessA Zero-Knowledge Range Argument with Preprocessing: Generic, Concretely Efficient, and Post-Quantum
Range arguments are a type of zero-knowledge proofs that aim to prove that a prover's committed value falls within a specified range for a verifier. Previously, most range arguments were constructed based on the discrete logarithm (DLOG) assumption, and hence, exponentiation operation is required for proof generation and verification. In addition, it is generally known that splitting a zero-knowledge proof protocol into a preprocessing phase and an online phase makes computation after fixing the input efficient. Still, such protocol has yet to be known for range arguments. This paper proposes an efficient range arguments protocol with a preprocessing phase. Our proposal takes a new approach by using arithmetic circuits to express the constraints that the prover must prove. The prover (resp. verifier) can generate (resp. verify) a part of proof based on multiplication and addition operations instead of exponentiation operations. Our range argument is a generic construction that does not rely on any particular mathematical assumptions, which enables us to construct a post-quantum range argument. The implementation evaluation shows that the total computation time for the prover and verifier in the online phase is efficient compared to Bulletproofs, one of the state-of-the-art range proofs. Especially, the prover computation is efficient.
- 12 October 2025
- Published by Springer Nature
- p. 294-313
Correcting the Record on Leakage Abuse Attacks: Revisiting the Subgraph Attacks with Sound Evaluation
- 12 October 2025
- Published by Springer Nature
- p. 294-313
Correcting the Record on Leakage Abuse Attacks: Revisiting the Subgraph Attacks with Sound Evaluation
- Open Access
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 25-33
SoK: Searchable Encryption with Differential Privacy
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 25-33
Open AccessSoK: Searchable Encryption with Differential Privacy
- Open Access
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 17-24
Revisiting Relations of Security Notions in Searchable Encryption
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 17-24
Open AccessRevisiting Relations of Security Notions in Searchable Encryption
- 7 July 2025
- Published by Springer Nature
- p. 42-62
Anonymous Credentials with Credential Redaction and Its Application to SSI-Based Plug&Charge for Shared Vehicles
- 7 July 2025
- Published by Springer Nature
- p. 42-62
Anonymous Credentials with Credential Redaction and Its Application to SSI-Based Plug&Charge for Shared Vehicles