Minimum separation layout for cmos circuits realizing tree-shape monotone decreasing logic circuits. - Yoshifumi Manabe; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1986)

Fault-Tolerant Routings in a kappa-Connected Network. - Makoto Imase; Yoshifumi Manabe (Inf. Process. Lett., 1988)

Global states monitoring algorithm for distributed system. - Kenji Moriyasu; Terunao Soneoka; Yoshifumi Manabe (Syst. Comput. Jpn., 1991)

Debugging Dynamic Distributed Programs Using Global Predicates. - Yoshifumi Manabe; Shigemi Aoyagi (SPDP, 1992)

Gloabl Condtions in Debugging Distributed Programs. - Yoshifumi Manabe; Makoto Imase (J. Parallel Distributed Comput., 1992)

A truant failure detection algorithm for multi-policy distributed systems. - Yoshifumi Manabe; Shigemi Aoyagi (ISADS, 1995)

A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks. - Yoshifumi Manabe; Shigemi Aoyagi (IEEE Real Time Technology and Applications Symposium, 1995)

Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II. - Terunao Soneoka; Makoto Imase; Yoshifumi Manabe (Discret. Appl. Math., 1996)

A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling. - Yoshifumi Manabe; Shigemi Aoyagi (Real Time Syst., 1998)

k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion. - Yoshifumi Manabe; Roberto Baldoni; Michel Raynal; Shigemi Aoyagi (Theor. Comput. Sci., 1998)

(h-k)-Arbiter for h-out of-k Mutual Exclusion Problem. - Yoshifumi Manabe; Naka Tajima (ICDCS, 1999)

A Distributed Consistent Global Checkpoint Algorithm for Distributed Mobile Systems. - Yoshifumi Manabe (ICPADS, 2001)

A Quorum-Based Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking. - Yoshifumi Manabe; JaeHyrk Park (ICPADS, 2004)

(h, k)-Arbiters for h-out-of-k mutual exclusion problem. - Yoshifumi Manabe; Naka Tajima (Theor. Comput. Sci., 2004)

A Byzantine Fault-Tolerant Mutual Exclusion Algorithm and Its Application to Byzantine Fault-Tolerant Storage Systems. - Joong Man Kim; Yoshifumi Manabe (ICDCS Workshops, 2005)

On the Equivalence of Several Security Notions of Key Encapsulation Mechanism. - Waka Nagao; Yoshifumi Manabe; Tatsuaki Okamoto (IACR Cryptol. ePrint Arch., 2006)

A Universally Composable Secure Channel Based on the KEM-DEM Framework. - Waka Nagao; Yoshifumi Manabe; Tatsuaki Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

An Efficient Anonymous Credential System. - Norio Akagi; Yoshifumi Manabe; Tatsuaki Okamoto (Financial Cryptography, 2008)

Relationship of Three Cryptographic Channels in the UC Framework. - Waka Nagao; Yoshifumi Manabe; Tatsuaki Okamoto (ProvSec, 2008)

Anonymous return route information for onion based mix-nets. - Yoshifumi Manabe; Tatsuaki Okamoto (SecureComm, 2008)

On the Equivalence of Several Security Notions of KEM and DEM. - Waka Nagao; Yoshifumi Manabe; Tatsuaki Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Universally Composable Identity-Based Encryption. - Ryo Nishimaki; Yoshifumi Manabe; Tatsuaki Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

An optimistic fair exchange protocol and its security in the universal composability framework. - Yusuke Okada; Yoshifumi Manabe; Tatsuaki Okamoto (Int. J. Appl. Cryptogr., 2008)

Meta-Envy-Free Cake-Cutting Protocols. - Yoshifumi Manabe; Tatsuaki Okamoto (MFCS, 2010)

Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security. - Susumu Kiyoshima; Yoshifumi Manabe; Tatsuaki Okamoto (IWSEC, 2012)

A Cryptographic Moving-Knife Cake-Cutting Protocol - Yoshifumi Manabe; Tatsuaki Okamoto (IWIGP, 2012)

Meta-envy-free Cake-cutting and Pie-cutting Protocols. - Yoshifumi Manabe; Tatsuaki Okamoto (J. Inf. Process., 2012)

An Epistemic Approach to Compositional Reasoning about Anonymity and Privacy. - Yasuyuki Tsukada; Hideki Sakurada; Ken Mano; Yoshifumi Manabe (TARK, 2013)

Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. - Susumu Kiyoshima; Yoshifumi Manabe; Tatsuaki Okamoto (IACR Cryptol. ePrint Arch., 2013)

Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption. - Takuho Mitsunaga; Yoshifumi Manabe; Tatsuaki Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

An Efficient Edge-Based Authentication for Network Coding against Entropy Attacks. - Ryo Iguchi; Yoshifumi Manabe (ICDCS Workshops, 2014)

A privacy-preserving collaborative filtering protocol considering updates. - Yuji Mochizuki; Yoshifumi Manabe (APSITT, 2015)

An allocation algorithm of indivisible goods. - Kohei Shimizu; Yoshifumi Manabe (APSITT, 2015)

A Double-Private epsilon-Fuzzy Matching Protocol. - Yuta Urushiyama; Yoshifumi Manabe (ICITCS, 2015)

A Cryptographic Moving-Knife Cake-Cutting Protocol with High Social Surplus. - Yoshifumi Manabe; Risako Otsuka; Tatsuaki Okamoto (J. Inf. Process., 2015)

Game-Theoretic Security of Commitment Protocols under a Realistic Cost Model. - Tsuyoshi Komatsubara; Yoshifumi Manabe (AINA, 2016)

On compositional reasoning about anonymity and privacy in epistemic logic. - Yasuyuki Tsukada; Hideki Sakurada; Ken Mano; Yoshifumi Manabe (Ann. Math. Artif. Intell., 2016)

A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits. - Takuho Mitsunaga; Yoshifumi Manabe; Tatsuaki Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Efficient Card-Based Cryptographic Protocols for the Millionaires' Problem Using Private Input Operations. - Hibiki Ono; Yoshifumi Manabe (AsiaJCIS, 2018)

Card-Based Cryptographic Protocols with the Minimum Number of Cards Using Private Operations. - Hibiki Ono; Yoshifumi Manabe (FPS, 2018)

Privacy-Preserving Group Matching Protocol. - Takuya Ibaraki; Yoshifumi Manabe (J. Comput., 2018)

Card-Based Cryptographic Protocols with the Minimum Number of Rounds Using Private Operations. - Hibiki Ono; Yoshifumi Manabe (DPM/CBT@ESORICS, 2019)

Secure Card-Based Cryptographic Protocols Using Private Operations Against Malicious Players. - Yoshifumi Manabe; Hibiki Ono (SECITC, 2020)

A Three-Player Envy-Free Discrete Division Protocol for Mixed Manna. - Yuki Okano; Yoshifumi Manabe (TPNC, 2020)

Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations. - Yoshifumi Manabe; Hibiki Ono (IWOCA, 2021)

Minimum Round Card-Based Cryptographic Protocols Using Private Operations. - Hibiki Ono; Yoshifumi Manabe (Cryptogr., 2021)

Card-Based Cryptographic Logical Computations Using Private Operations. - Hibiki Ono; Yoshifumi Manabe (New Gener. Comput., 2021)

Many-to-many perfect matching. - Musashi Takanezawa; Yoshifumi Manabe (AISS, 2022)

Card-Based Zero-Knowledge Proof for the Nearest Neighbor Property: Zero-Knowledge Proof of ABC End View. - Takuro Fukasawa; Yoshifumi Manabe (SPACE, 2022)

Card-Based Cryptographic Protocols with Malicious Players Using Private Operations. - Yoshifumi Manabe; Hibiki Ono (New Gener. Comput., 2022)

Free-XOR in Card-Based Garbled Circuits. - Yoshifumi Manabe; Kazumasa Shinagawa (CANS, 2023)

Malicious Player Card-Based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations. - Tomoya Morooka; Yoshifumi Manabe; Kazumasa Shinagawa (ISPEC, 2023)

Card-Based Secure Evaluation of Decision Trees. - Yoshifumi Manabe; Naoki Kobayashi (CRiSIS, 2024)

Card-Based Cryptographic Protocols for Three-Input Functions with a Standard Deck of Cards Using Private Operations. - Naoki Kobayashi; Yoshifumi Manabe (ESORICS Workshops (1), 2024)

Card-Based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations. - Yoshifumi Manabe; Hibiki Ono (New Gener. Comput., 2024)