A Cryptographic Moving-Knife Cake-Cutting Protocol

Details A Cryptographic Moving-Knife Cake-Cutting Protocol A Cryptographic Moving-Knife Cake-Cutting Protocol

2012-02-21

arxiv.org/abs/1202.4507v1

EPTCS 78, 2012, pp. 15-23

Computer Science

Computer Science and Game Theory

In Proceedings IWIGP 2012, arXiv:1202.4229

Scientific paper

10.4204/EPTCS.78.2

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.

Affiliated with

Also associated with

No associations

Rating

A Cryptographic Moving-Knife Cake-Cutting Protocol does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Cryptographic Moving-Knife Cake-Cutting Protocol, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Cryptographic Moving-Knife Cake-Cutting Protocol will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-422395