@incollection(auction3,
 author       = "Masayuki Abe and Koutarou Suzuki",
 year         = "2002",
 title        = "M+1-st Price Auction Using Homomorphic Encryption",
 editor       = "David Naccache and Pascal Paillier",
 booktitle    = "Public Key Cryptography",
 series       = "Lecture Notes in Computer Science",
 volume       = "2274",
 publisher    = "Springer Berlin / Heidelberg",
 pages        = "395--398",
 doi          = "10.1007/3-540-45664-3\_8",
 note         = "10.1007/3-540-45664-3\_8",
)
@book(book2,
 author       = "S.J. Brams and A.D. Taylor",
 year         = "1996",
 title        = "Fair division: from cake-cutting to dispute resolution",
 publisher    = "Cambridge University Press",
)
@article(commit,
 author       = "Gilles Brassard and David Chaum and Claude Cr\'{e}peau",
 year         = "1988",
 title        = "Minimum disclosure proofs of knowledge",
 journal      = "J. Comput. Syst. Sci.",
 volume       = "37",
 pages        = "156--189",
 doi          = "10.1016/0022-0000(88)90005-0",
)
@article(hardness,
 author       = "Costas Busch and Mukkai S. Krishnamoorthy and Malik Magdon-Ismail",
 year         = "2005",
 title        = "Hardness Results for Cake Cutting",
 journal      = "Bulletin of the EATCS",
 volume       = "86",
 pages        = "85--106",
)
@article(moving,
 author       = "L. E. Dubins and E. H. Spanier",
 year         = "1961",
 title        = "How to Cut A Cake Fairly",
 journal      = "The American Mathematical Monthly",
 volume       = "68",
 number       = "1",
 pages        = "1--17",
 doi          = "10.2307/2311357",
)
@inproceedings(edmonds,
 author       = "Jeff Edmonds and Kirk Pruhs",
 year         = "2006",
 title        = "Cake cutting really is not a piece of cake",
 booktitle    = "Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm",
 series       = "SODA '06",
 publisher    = "ACM",
 address      = "New York, NY, USA",
 pages        = "271--278",
 doi          = "10.1145/1109557.1109588",
)
@misc(comsoc,
 author       = "U. Endriss",
 year         = "2007",
 title        = "Cake-Cutting Procedures",
 url          = "http://staff.science.uva.nl/\textasciitilde ulle/teaching/comsoc/2007/slides/comsoc-cakes.pdf",
)
@article(simpleo0,
 author       = "S. Even and A. Paz",
 year         = "1984",
 title        = "A note on cake cutting",
 journal      = "Discrete Applied Mathematics",
 volume       = "7",
 number       = "3",
 pages        = "285 -- 296",
 doi          = "10.1016/0166-218X(84)90005-2",
)
@article(ZKP,
 author       = "Oded Goldreich and Silvio Micali and Avi Wigderson",
 year         = "1991",
 title        = "Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems",
 journal      = "J. ACM",
 volume       = "38",
 pages        = "690--728",
 doi          = "10.1145/116825.116852",
)
@incollection(simpleo1,
 author       = "H.W. Kuhn",
 year         = "1967",
 title        = "On Games of Fair Division",
 booktitle    = "Essays in Mathematical Economics in Honor of Oskar Morgenstern",
 publisher    = "Princeton University Press",
)
@inproceedings(auction,
 author       = "Kaoru Kurosawa and Wakaha Ogata",
 year         = "2002",
 title        = "Bit-Slice Auction Circuit",
 booktitle    = "Proceedings of the 7th European Symposium on Research in Computer Security",
 series       = "ESORICS '02",
 publisher    = "Springer-Verlag",
 address      = "London, UK, UK",
 pages        = "24--38",
 doi          = "10.1007/3-540-45853-0\_2",
)
@inproceedings(meta,
 author       = "Yoshifumi Manabe and Tatsuaki Okamoto",
 year         = "2010",
 title        = "Meta-envy-free cake-cutting protocols",
 booktitle    = "Proceedings of the 35th international conference on Mathematical foundations of computer science",
 series       = "MFCS'10",
 publisher    = "Springer-Verlag",
 address      = "Berlin, Heidelberg",
 pages        = "501--512",
 doi          = "10.1007/978-3-642-15155-2\_44",
)
@inproceedings(auction2,
 author       = "Takuho Mitsunaga and Yoshifumi Manabe and Tatsuaki Okamoto",
 year         = "2010",
 title        = "Efficient secure auction protocols based on the Boneh-Goh-Nissim encryption",
 booktitle    = "Proceedings of the 5th international conference on Advances in information and computer security",
 series       = "IWSEC'10",
 publisher    = "Springer-Verlag",
 address      = "Berlin, Heidelberg",
 pages        = "149--163",
 doi          = "10.1007/978-3-642-16825-3\_11",
)
@article(minimal,
 author       = "J. Robertson and W. Webb",
 year         = "1991",
 title        = "Minimal Number of Cuts for Fair Division",
 journal      = "Arts. Comb.",
 volume       = "31",
 pages        = "191 -- 197",
)
@book(book,
 author       = "J. Robertson and W. Webb",
 year         = "1998",
 title        = "Cake-cutting algorithms: be fair if you can",
 series       = "Ak Peters Series",
 publisher    = "A.K. Peters",
)
@book(simpleo2,
 author       = "T.L. Saaty",
 year         = "1970",
 title        = "Optimization in integers and related extremal problems",
 series       = "International series in pure and applied mathematics",
 publisher    = "McGraw-Hill",
)
@incollection(sgall,
 author       = "Jiri Sgall and Gerhard Woeginger",
 year         = "2003",
 title        = "A Lower Bound for Cake Cutting",
 editor       = "Giuseppe Di Battista and Uri Zwick",
 booktitle    = "Algorithms - ESA 2003",
 series       = "Lecture Notes in Computer Science",
 volume       = "2832",
 publisher    = "Springer Berlin / Heidelberg",
 pages        = "459--469",
 doi          = "10.1007/978-3-540-39658-1\_42",
)
@article(simpleo3,
 author       = "H. Steinhaus",
 year         = "1948",
 title        = "The Problem of Fair Division",
 journal      = "Econometrica",
 volume       = "16",
 pages        = "101 -- 104",
)
@book(simpleo4,
 author       = "H. Steinhaus",
 year         = "1969",
 title        = "Mathematical Snapshots",
 publisher    = "Oxford University Press",
)