A Cryptographic Moving-Knife Cake-Cutting Protocol

A Cryptographic Moving-Knife Cake-Cutting Protocol

This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus...

Full description

Bibliographic Details
Main Authors: Yoshifumi Manabe, Tatsuaki Okamoto
Format: Article
Language:English
Published: Open Publishing Association 2012-02-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1202.4507v1
id doaj-1f0b85dc0d3f48bfb9a966e02db989f8
record_format Article
spelling doaj-1f0b85dc0d3f48bfb9a966e02db989f82020-11-24T20:53:55ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-02-0178Proc. IWIGP 2012152310.4204/EPTCS.78.2A Cryptographic Moving-Knife Cake-Cutting Protocol Yoshifumi ManabeTatsuaki OkamotoThis paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the moving-knife protocol can be executed asynchronously by a discrete protocol using a secure auction protocol. The number of cuts is n-1 where n is the number of players, which is the minimum.http://arxiv.org/pdf/1202.4507v1
collection DOAJ
language English
format Article
sources DOAJ
author Yoshifumi Manabe
Tatsuaki Okamoto
spellingShingle Yoshifumi Manabe
Tatsuaki Okamoto
A Cryptographic Moving-Knife Cake-Cutting Protocol
Electronic Proceedings in Theoretical Computer Science
author_facet Yoshifumi Manabe
Tatsuaki Okamoto
author_sort Yoshifumi Manabe
title A Cryptographic Moving-Knife Cake-Cutting Protocol
title_short A Cryptographic Moving-Knife Cake-Cutting Protocol
title_full A Cryptographic Moving-Knife Cake-Cutting Protocol
title_fullStr A Cryptographic Moving-Knife Cake-Cutting Protocol
title_full_unstemmed A Cryptographic Moving-Knife Cake-Cutting Protocol
title_sort cryptographic moving-knife cake-cutting protocol
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2012-02-01
description This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the moving-knife protocol can be executed asynchronously by a discrete protocol using a secure auction protocol. The number of cuts is n-1 where n is the number of players, which is the minimum.
url http://arxiv.org/pdf/1202.4507v1
work_keys_str_mv AT yoshifumimanabe acryptographicmovingknifecakecuttingprotocol
AT tatsuakiokamoto acryptographicmovingknifecakecuttingprotocol
AT yoshifumimanabe cryptographicmovingknifecakecuttingprotocol
AT tatsuakiokamoto cryptographicmovingknifecakecuttingprotocol
_version_ 1716795821096173568

Similar Items