· Referred Journal papers
o Y. Manabe
and T. Okamoto: ``Meta-envy-free Cake-cutting and Pie-cutting Protocols,''
Journal of Information Processing, accepted(2012).
o
W.
Nagao, Y. ManabeCand
T. Okamoto: ``On the equivalence of several security notions of KEM and
DEM,''IEICE Transactions on Fundamentals, Vol.E91-A, No.1, pp.283-297, (Jan.
2008).[PDF]
o
R.
Nishimaki, Y. Manabe, and
T. Okamoto: ``Universally Composable Identity-based
Encryption,'' IEICE Transactions on Fundamentals, Vol.E91-A, No.1, pp.262-271,
(Jan. 2008).[PDF]
o
Y.
Okada, Y. Manabe, and T. Okamoto: ``An optimistic
fair exchange protocol and its security in the universal composability
framework,'' International Journal of Applied Cryptography (IJACT), Vol.1,
No.1, pp.70-77(2008).[PDF]
o
W.
Nagao, Y. ManabeCand T. Okamoto: hA Universally Composable Secure
Channel Based on the KEM-DEM Frameworkh, IEICE Transactions on Fundamentals,
Vol.E89-A, No.1, pp.28-38, (Jan. 2006). [PDF]
o Y. Manabe, and N. Tajima: ``(h,k)-Arbiters of h-out-of-k Mutual Exclusion Problem, '' Theoretical Computer Science, Vol.310, No.1-3 (2004).
o S.-C. Sung, and Y. Manabe: ``Coterie for Generalized Mutual Exclusion Problem,'' IEICE Transactions on Information and Systems, Vol. E82-D, No. 5, pp.968-972 (May 1999). [PDF]
o Y. Manabe and S. Aoyagi: ``A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling,'' Real-Time Systems, Vol.14, No.2, pp.171-181 (Mar. 1998).
o Y. Manabe, R. Baldoni, M. Raynal, and S. Aoyagi: ``k-Arbiter: A safe and general scheme for h-out of-k mutual exclusion,'' Theoretical Computer Science, Vol. 193, No. 1-2, pp. 97-112 (Feb. 1998).
o T. Soneoka, M. Imase, and Y. Manabe: ``Design of a d-connected digraph with a minimum number of edges and quasiminimal diameter II'', Discrete Applied Mathematics, Vol.64, No. 3, pp.267--279 (Feb 1996).
o
Y.
Manabe and M. Imase:
``Global Conditions in Debugging Distributed Programs,'' Journal of Parallel
and Distributed Computing, Vol.15, No.1, pp.62-69(May 1992).
also in: Jeffery J. P. Tsai and Steve J. H. Yang
(Eds.) ``Monitoring and Debugging of Distributed Real-Time Systems'',
pp.331-338, IEEE Computer Society press (1995) ISBN0-8186-6537-8.
o K. Moriyasu, T. Soneoka, and Y. Manabe: "Global State Monitoring Algorithm for Distributed System", Systems and Computers in Japan, Scripta Technica,Inc., Vol.22, No.14 (Apr. 1992).
o Y. Manabe, M. Imase, and T. Soneoka: ``Reliable and Efficient Fixed Routings on Digraphs,'' Trans. of IEICE, Vol. E-71, No. 12, pp. 1212-1220 (Dec. 1988). [PDF]
o T. Soneoka, Y. Manabe, M. Imase, and M. Inoue: ``The optimum design of highly reliable duplex networks,'' Transactions of IEICE, Vol. J70-A, No. 2, pp.252-260 (Feb. 1987) (In Japanese).
o Y. Manabe, K. Hagihara, and N. Tokura: ``Minimum Separation layout for CMOS circuits realizing tree-shape monotone decreasing logic circuit,'' Transactions of IEICE, Vol. J68-D, No. 9, pp. 1571-1579 (Sep. 1985) (In Japanese).
o Y. Manabe, K. Hagihara, and N. Tokura: ``The minimum bisection widths of the cube-connected cycles graph and cube graph,'' Transactions of IEICE, Vol. J67-D, No. 6, pp.647-654 (June 1984) (In Japanese).
o Y. Manabe, K. Hagihara, and N. Tokura: ``The minimum track number of the narrower channel in the single-row single-layer routing,'' Transaction of IEICE, Vol. J67-A, No.5, pp.503-510 (May 1984) (In Japanese).
· Refereed Letters
o M. Imase and Y. Manabe: ``Fault Tolerant Routings in a k-connected Networks'', Information Processing Letters Vol. 28, pp.171-175 (July 1988).
· Refereed Conference papers
o
Y.
Manabe and T. Okamoto: `` A Cryptographic
Moving-knife Cake-Cutting Protocol,ff International Workshop on Interactions,
Games and Protocols (iWIGP2012) (Mar. 2012).[PDF]
o
T.
Mitsunaga, Y. Manabe, and
T. Okamoto: `` A Secure M + 1st Price Auction Protocol based on Bit Slice
Circuits,ff IWSEC2011, LNCS Vol. 7038, pp.51-64 (Nov. 2011).[PDF]
o
T.
Mitsunaga, Y. Manabe, and
T. Okamoto: ``Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption,ff IWSEC2010, LNCS Vol. 6434,
pp.149-163 (Nov. 2010).[PDF]
o
Y. Manabe, and T. Okamoto: ``Meta-envy-free
Cake Cutting Protocols,ff
MFCS 2010, LNCS Vol. 6281, pp.501-512 (Aug. 2010).[PDF]
o
T. Mitsunaga,
Y. Manabe, and T. Okamoto: ``Insatabity
of a punishment strategy in correlated equilibria,ff
Workshop on Algorithmic Game Theory: Dynamics and Convergence in Distributed
Systems (AlgoGT 2010) (July 2010).[PDF]
o
W. Nagao,
Y. Manabe, and T. Okamoto: ``Relationship
of Three Cryptographic Channels in the UC Framework,ff ProvSec
2008, LNCS Vol. 5324, pp.268-282 (Oct. 2008).[PDF]
o
Y. Manabe, and T. Okamoto: ``Anonymous
return route information for onion based mix-nets,ff Workshop on
Applications of Private and Anonymous Communications (Sep. 2008).[PDF]
o
N.
Akagi, Y. Manabe, and T.
Okamoto: ``An Efficient Anonymous Credential System, "Financial
Cryptography and Data Security 2008, LNCS Vol. 5143, pp. 272-286 (Feb. 2008).[PDF]
o R. Nishimaki, Y. Manabe, and T. Okamoto: ``Universally Composable Identity-based Encryption,'' Proc. of Vietcrypt 2006, LNCS 4341, pp.337-353 (Oct. 2006).
o J. M. Kim and Y. Manabe:``Distributed Byzantine Mutual Exclusion Algorithm and Application to Byzantine Storage Systems, '' 4th International Workshop on Assurance in Distributed Systems and Networks (ADSN) (June 2005). [PDF]
o W. Nagao, Y. Manabe, and T. Okamoto: ``A Universally Composable Secure Channel Based on the KEM-DEM Framework,'' TCC 2005, LNCS 3378, pp.426-444 (Feb. 2005)
o W. Nagao, Y. Manabe, and T. Okamoto: ``On the Security of Hybrid Public-Key Encryption,'' Int. Conf. on Cybernetics and Information Technologies, Systems and Applications (CITSA 2004), Vol.1, pp.28-33(July 2004).
o Y. Manabe and J. Park:``A Quorum-Based Extended Group Mutual Exclusion Algorithm without Unnecessary Blocking, '' 10th Int. Conf. on Parallel and Distributed Systems, pp.341-348 (2004). [PDF]
o Y. Manabe: ``A Distributed Consistent Global Checkpoint Algorithm for Distributed Mobile Systems,'' 8th Int. Conf. on Parallel and Distributed Systems, pp.125-132 (June 2001).[PDF]
o Y. Manabe: ``A Consistent Global Checkpoint Algorithm for Distributed Systems with a Forbidden Process,'' 13th Int. Conf. on Information Networking, (Jan. 1999). [PDF]
o Y. Manabe and N. Tajima: ``(h,k)-arbiters for h-out of-k mutual exclusion problem,'' 19th Int. Conf. on Distributed Computing Systems pp.216-223 (June 1999).[PDF]
o Y. Manabe: ``A Distributed Consistent Global Checkpoint Algorithm with a Minimum Number of Checkpoints,'' 12th Int. Conf. on Information Networking, pp.549-554 (Jan. 1998). [PDF]
o Y. Manabe: ``A Distributed First and Last Consistent Global Checkpoint Algorithm,'' Proc. of 12th Int. Conf. on Information Networking, pp.475-480 (Jan. 1998).[PDF]
o S.-C. Sung and Y. Manabe: ``On Coterie for Generalized Distributed Resource Allocation Algorithm,'' Proc. of IPSJ International Symposium on Information Systems and Technologies for Network Society, pp. 356-359 (Sep. 1997), World Scientific Publishing, ISBN 981-02-3294-2.
o R. Baldoni, Y. Manabe, M. Raynal, and S. Aoyagi: ``Quorum-based Solutions to the h-out of-k Mutual Exclusion Problem in Distributed Systems,'' Proc. of 4th Workshop on Parallel Systems and Algorithms, pp.99-108 (Apr. 1996), World Scientific Publishing, ISBN 981-02-3044-3.
o Y. Manabe and S. Aoyagi: ``A Feasibility Decision Algorithm for Rate-Monotonic Scheduling of Periodic Real-Time Tasks'', IEEE 1st Real-Time Technology and Applications Symp., pp.212--218 (May 1995).[PDF]
o Y. Manabe and S. Aoyagi: ``A Truant Failure Detection Algorithm for Multi-Policy Distributed Systems,'' 2nd Int. Symp. on Autonomous Decentralized Systems, pp.297-303(Apr. 1995). [PDF]
o Y. Manabe and S. Aoyagi: ``Debugging Dynamic Distributed Programs Using Global Predicates,'' 4th IEEE Symp. on Parallel and Distributed Processing, pp.402-407(Dec. 1992).[PDF]
o T. Soneoka, Y. Manabe, and M. Imase:``A Design of Reliable Networks Using Node Redundancy'', 19th Southeastern Conference on Combinatorics, Graph Theory, and Computing(Feb. 1988), also in Congressus Numerantium Vol. 67 (Dec. 1988).
o M. Imase, T. Soneoka, and Y. Manabe:``A Fault Tolerant Routing in Networks'', ICIAM '87 (1987).
(Notice on Copyright)
IEICE TransactionsF@copyright(C)1984-2008 IEICE [IEICE Transactions Onlne]
IEEE: ©1992-2004, IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder
Lecture Notes on Computer Science: Copyright Springer-Verlag GmbH Berlin Heidelberg. The original publication is available at www.springerlink.com
Back to Yoshifumi Manabe's home page.