c © Y. Manabe & T. Okamoto This work is licensed under the Creative Commons Attribution License. A Cryptographic Moving-Knife Cake-Cutting Protocol

Abstract

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 pro-tocol 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 se-cure auction protocol. The number of cuts is n − 1 where n is the number of players, which is the minimum.

Similar works

Full text

thumbnail-image
oai:CiteSeerX.psu:10.1.1.750.9602Last time updated on 10/30/2017

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.