A provably secure polynomial approximation scheme for the distributed lottery problem (extended abstract)
Andrei Broder · 1985
Article A provably secure polynomial approximation scheme for the distributed lottery problem (extended abstract) Share on Author: Andrei Z. Broder DEC - Systems Research Center, 130 Lytton Avenue, Palo Alto, CA DEC - Systems Research Center, 130 Lytton Avenue, Palo Alto, CAView Profile Authors Info & Claims PODC '85: Proceedings of the fourth annual ACM symposium on Principles of distributed computingAugust 1985 Pages 136–148https://doi.org/10.1145/323596.323608Online:01 August 1985Publication History 3citation259DownloadsMetricsTotal Citations3Total Downloads259Last 12 Months0Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access