Yoshifumi Manabe

Orcid: 0000-0002-6312-257X

According to our database1, Yoshifumi Manabe authored at least 53 papers between 1986 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Malicious Player Card-Based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations.
Proceedings of the Information Security Practice and Experience, 2023

Free-XOR in Card-Based Garbled Circuits.
Proceedings of the Cryptology and Network Security - 22nd International Conference, 2023

2022
Card-Based Cryptographic Protocols with Malicious Players Using Private Operations.
New Gener. Comput., 2022

Card-Based Zero-Knowledge Proof for the Nearest Neighbor Property: Zero-Knowledge Proof of ABC End View.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2022

Many-to-many perfect matching.
Proceedings of the 4th International Conference on Advanced Information Science and System, 2022

2021
Card-Based Cryptographic Logical Computations Using Private Operations.
New Gener. Comput., 2021

Minimum Round Card-Based Cryptographic Protocols Using Private Operations.
Cryptogr., 2021

Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Card-Based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2021, 2021

2020
A Three-Player Envy-Free Discrete Division Protocol for Mixed Manna.
Proceedings of the Theory and Practice of Natural Computing - 9th International Conference, 2020

Secure Card-Based Cryptographic Protocols Using Private Operations Against Malicious Players.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2020

2019
Card-Based Cryptographic Protocols with the Minimum Number of Rounds Using Private Operations.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2019

2018
Privacy-Preserving Group Matching Protocol.
J. Comput., 2018

Card-Based Cryptographic Protocols with the Minimum Number of Cards Using Private Operations.
Proceedings of the Foundations and Practice of Security - 11th International Symposium, 2018

Efficient Card-Based Cryptographic Protocols for the Millionaires' Problem Using Private Input Operations.
Proceedings of the 13th Asia Joint Conference on Information Security, 2018

2016
A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

On compositional reasoning about anonymity and privacy in epistemic logic.
Ann. Math. Artif. Intell., 2016

Game-Theoretic Security of Commitment Protocols under a Realistic Cost Model.
Proceedings of the 30th IEEE International Conference on Advanced Information Networking and Applications, 2016

2015
A Cryptographic Moving-Knife Cake-Cutting Protocol with High Social Surplus.
J. Inf. Process., 2015

A Double-Private epsilon-Fuzzy Matching Protocol.
Proceedings of the 5th International Conference on IT Convergence and Security, 2015

An allocation algorithm of indivisible goods.
Proceedings of the 10th Asia-Pacific Symposium on Information and Telecommunication Technologies, 2015

A privacy-preserving collaborative filtering protocol considering updates.
Proceedings of the 10th Asia-Pacific Symposium on Information and Telecommunication Technologies, 2015

2014
An Efficient Edge-Based Authentication for Network Coding against Entropy Attacks.
Proceedings of the 34th International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops), Madrid, Spain, June 30, 2014

2013
Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol.
IACR Cryptol. ePrint Arch., 2013

An Epistemic Approach to Compositional Reasoning about Anonymity and Privacy.
Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), 2013

2012
Meta-envy-free Cake-cutting and Pie-cutting Protocols.
J. Inf. Process., 2012

A Cryptographic Moving-Knife Cake-Cutting Protocol
Proceedings of the Proceedings Second International Workshop on Interactions, 2012

Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security.
Proceedings of the Advances in Information and Computer Security, 2012

2010
Meta-Envy-Free Cake-Cutting Protocols.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2008
An optimistic fair exchange protocol and its security in the universal composability framework.
Int. J. Appl. Cryptogr., 2008

Universally Composable Identity-Based Encryption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

On the Equivalence of Several Security Notions of KEM and DEM.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Anonymous return route information for onion based mix-nets.
Proceedings of the 4th International ICST Conference on Security and Privacy in Communication Networks, 2008

Relationship of Three Cryptographic Channels in the UC Framework.
Proceedings of the Provable Security, Second International Conference, 2008

An Efficient Anonymous Credential System.
Proceedings of the Financial Cryptography and Data Security, 12th International Conference, 2008

2006
A Universally Composable Secure Channel Based on the KEM-DEM Framework.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

On the Equivalence of Several Security Notions of Key Encapsulation Mechanism.
IACR Cryptol. ePrint Arch., 2006

2005
A Byzantine Fault-Tolerant Mutual Exclusion Algorithm and Its Application to Byzantine Fault-Tolerant Storage Systems.
Proceedings of the 25th International Conference on Distributed Computing Systems Workshops (ICDCS 2005 Workshops), 2005

2004
(<i>h, k</i>)-Arbiters for <i>h</i>-out-of-<i>k</i> mutual exclusion problem.
Theor. Comput. Sci., 2004

A Quorum-Based Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking.
Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

2001
A Distributed Consistent Global Checkpoint Algorithm for Distributed Mobile Systems.
Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001

1999
(<i>h-k</i>)-Arbiter for <i>h</i>-out of-<i>k</i> Mutual Exclusion Problem.
Proceedings of the 19th International Conference on Distributed Computing Systems, Austin, TX, USA, May 31, 1999

1998
k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion.
Theor. Comput. Sci., 1998

A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling.
Real Time Syst., 1998

1996
Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II.
Discret. Appl. Math., 1996

1995
A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks.
Proceedings of the 1st IEEE Real-Time Technology and Applications Symposium, 1995

A truant failure detection algorithm for multi-policy distributed systems.
Proceedings of the Second International Symposium on Autonomous Decentralized Systems, 1995

1992
Gloabl Condtions in Debugging Distributed Programs.
J. Parallel Distributed Comput., 1992

Debugging Dynamic Distributed Programs Using Global Predicates.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

1991
Global states monitoring algorithm for distributed system.
Syst. Comput. Jpn., 1991

1988
Fault-Tolerant Routings in a kappa-Connected Network.
Inf. Process. Lett., 1988

1986
Minimum separation layout for cmos circuits realizing tree-shape monotone decreasing logic circuits.
Syst. Comput. Jpn., 1986


  Loading...