Abstract
At the start of the American Revolution, Paul Revere designed one of the most famous covert signaling protocols in history. Though incredibly simple, it has interesting features that we explore in this paper. We also consider the use of Paul Revere protocols in covert computer communication. The Sleeping Beauty problem is a heavily researched puzzle in the theory of probability that previously only had counterintuitive descriptions and complex analyses. Representing it using Paul Revere protocols in covert computer communication provides a clear, natural explanation and simple resolution of this problem.
The rights of this work are transferred to the extent transferable according to title 17 U.S.C. 105.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arntzenius, F.: Reflections on Sleeping Beauty. Analysis 62(1), 53–62 (2002)
Elga, A.: Self-locating belief and the Sleeping Beauty problem. Analysis 60(2), 143–147 (2000)
Fischer, D.H.: Paul Revere’s Ride. Oxford University Press (1994)
Groisman, B.: The end of sleeping beauty’s nightmare. British Journal for the Philosophy of Science 59(3), 409–416 (2008)
Halpern, J.Y.: Sleeping Beauty reconsidered: Conditioning and reflection in asynchronous systems. In: Gendler, T.S., Hawthorne, J. (eds.) Oxford Studies in Epistemology, vol. 1, ch. 5, pp. 111–142. Oxford University Press (2005)
Moskowitz, I.S., Greenwald, S.J., Kang, M.H.: An analysis of the timed z-channel. IEEE Transactions on Information Theory 44(7), 3162–3168 (1998)
Neal, R.M.: Puzzles of anthropic reasoning resolved using full non-indexical conditioning. Technical Report 0607, Dept. of Statistics, University of Toronto (August 2006), retrieved from http://arxiv.org/abs/math/0608592v1
Ross, J.: Sleeping Beauty, countable additivity, and rational dilemmas. Philosophical Review 119(4), 411–447 (2010)
White, R.: The generalized Sleeping Beauty problem: a challenge for thirders. Analysis 66(2), 114–119 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Syverson, P. (2012). Paul Revere Protocols. In: Christianson, B., Malcolm, J., Stajano, F., Anderson, J. (eds) Security Protocols XX. Security Protocols 2012. Lecture Notes in Computer Science, vol 7622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35694-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-35694-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35693-3
Online ISBN: 978-3-642-35694-0
eBook Packages: Computer ScienceComputer Science (R0)