Leakage-resilient coin tossing (Englisch)
Freier Zugriff
- Neue Suche nach: Boyle, Elette
- Neue Suche nach: Goldwasser, Shafi
- Neue Suche nach: Boyle, Elette
- Neue Suche nach: Goldwasser, Shafi
-
ISBN:
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Leakage-resilient coin tossing
-
Beteiligte:Boyle, Elette ( Autor:in ) / Goldwasser, Shafi ( Autor:in )
-
Verlag:
- Neue Suche nach: Spring Berlin/Heidelberg
-
Erscheinungsdatum:2011
-
Anmerkungen:Proceedings 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011.
Boyle, Elette, Shafi Goldwasser, and Yael Tauman Kalai. “Leakage-Resilient Coin Tossing.” Distributed Computing. Ed. David Peleg. Vol. 6950. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 181-196. © 2011 Springer -
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and ResultsPelc, Andrzej et al. | 2011
- 16
-
Fast and Scalable RendezvousingAfek, Yehuda / Hakimi, Michael / Morrison, Adam et al. | 2011
- 32
-
Beeping a Maximal Independent SetAfek, Yehuda / Alon, Noga / Bar-Joseph, Ziv / Cornejo, Alejandro / Haeupler, Bernhard / Kuhn, Fabian et al. | 2011
- 51
-
Trading Bit, Message, and Time Complexity of Distributed AlgorithmsSchneider, Johannes / Wattenhofer, Roger et al. | 2011
- 66
-
Combinatorial Algorithms for Distributed Graph ColoringBarenboim, Leonid / Elkin, Michael et al. | 2011
- 82
-
Physical Expander in Virtual Tree OverlayIzumi, Taisuke / Gradinariu Potop-Butucaru, Maria / Valero, Mathieu et al. | 2011
- 97
-
Sub-logarithmic Test-and-Set against a Weak AdversaryAlistarh, Dan / Aspnes, James et al. | 2011
- 110
-
Tight Space Bounds for ℓ-ExclusionTaubenfeld, Gadi et al. | 2011
- 125
-
SMV: Selective Multi-Versioning STMPerelman, Dmitri / Byshevsky, Anton / Litmanovich, Oleg / Keidar, Idit et al. | 2011
- 141
-
Brief Announcement: Leaderless Byzantine PaxosLamport, Leslie et al. | 2011
- 143
-
Brief Announcement: When You Don’t Trust Clients: Byzantine Proposer Fast PaxosMarzullo, Keith / Meling, Hein / Mei, Alessandro et al. | 2011
- 145
-
Brief Announcement: On the Meaning of Solving a Task with a Failure DetectorDelporte-Gallet, Carole / Fauconnier, Hugues / Gafni, Eli / Kuznetsov, Petr et al. | 2011
- 147
-
Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable CommunicationChristoforou, Evgenia / Fernández Anta, Antonio / Georgiou, Chryssis / Mosteiro, Miguel A. et al. | 2011
- 150
-
Maximum Metric Spanning Tree Made Byzantine TolerantDubois, Swan / Masuzawa, Toshimitsu / Tixeuil, Sébastien et al. | 2011
- 165
-
Performing Dynamically Injected Tasks on Processes Prone to Crashes and RestartsGeorgiou, Chryssis / Kowalski, Dariusz R. et al. | 2011
- 181
-
Leakage-Resilient Coin TossingBoyle, Elette / Goldwasser, Shafi / Kalai, Yael Tauman et al. | 2011
- 197
-
Brief Announcement: Composition Games for Distributed Systems: The EU Grants GamesKutten, Shay / Lavi, Ron / Trehan, Amitabh et al. | 2011
- 200
-
Brief Announcement: Distributed Approximations for the Semi-matching ProblemCzygrinow, Andrzej / Hanćkowiak, Michal / Krzywdziński, Krzysztof / Szymańska, Edyta / Wawrzyniak, Wojciech et al. | 2011
- 202
-
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks:Farach-Colton, Martín / Fernández Anta, Antonio / Milani, Alessia / Mosteiro, Miguel A. / Zaks, Shmuel et al. | 2011
- 205
-
Brief Announcement: Bridging the Theory-Practice Gap in Multi-commodity Flow RoutingSen, Siddhartha / Ihm, Sunghwan / Ousterhout, Kay / Freedman, Michael J. et al. | 2011
- 208
-
DISC 2011 Invited Lecture by Dahlia Malkhi: Going beyond PaxosBalakrishnan, Mahesh / Malkhi, Dahlia / Prabhakaran, Vijayan / Wobber, Ted et al. | 2011
- 211
-
Byzantizing Paxos by RefinementLamport, Leslie et al. | 2011
- 225
-
Unbounded Contention Resolution in Multiple-Access ChannelsFernández Anta, Antonio / Mosteiro, Miguel A. / Ramón Muñoz, Jorge et al. | 2011
- 237
-
Deterministic and Energy-Optimal Wireless SynchronizationBarenboim, Leonid / Dolev, Shlomi / Ostrovsky, Rafail et al. | 2011
- 252
-
Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless BroadcastDolev, Shlomi / Gilbert, Seth / Khabbazian, Majid / Newport, Calvin et al. | 2011
- 268
-
Leader Election Using Loneliness DetectionGhaffari, Mohsen / Lynch, Nancy / Sastry, Srikanth et al. | 2011
- 283
-
Optimal Random Sampling from Distributed Streams RevisitedTirthapura, Srikanta / Woodruff, David P. et al. | 2011
- 298
-
Parsimonious Flooding in Geometric Random-WalksClementi, Andrea E. F. / Silvestri, Riccardo et al. | 2011
- 311
-
Misleading Stars: What Cannot Be Measured in the Internet?Pignolet, Yvonne Anne / Schmid, Stefan / Tredan, Gilles et al. | 2011
- 326
-
Brief Announcement: A Randomized Algorithm for Label Assignment in Dynamic NetworksWalraed-Sullivan, Meg / Niranjan Mysore, Radhika / Marzullo, Keith / Vahdat, Amin et al. | 2011
- 328
-
Brief Announcement: ΔΩ: Specifying an Eventual Leader Service for Dynamic SystemsLarrea, Mikel / Raynal, Michel et al. | 2011
- 330
-
Brief Announcement: The BG-Simulation for Byzantine Mobile RobotsIzumi, Taisuke / Bouzid, Zohir / Tixeuil, Sébastien / Wada, Koichi et al. | 2011
- 332
-
DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robotsWidmayer, Peter et al. | 2011
- 333
-
Locality and Checkability in Wait-Free ComputingFraigniaud, Pierre / Rajsbaum, Sergio / Travers, Corentin et al. | 2011
- 348
-
The Contest between Simplicity and Efficiency in Asynchronous Byzantine AgreementLewko, Allison et al. | 2011
- 363
-
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer RegistersAspnes, James et al. | 2011
- 374
-
Structured Derivation of Semi-Synchronous AlgorithmsAttiya, Hagit / Borran, Fatemeh / Hutle, Martin / Milosevic, Zarko / Schiper, André et al. | 2011
- 389
-
Byzantine Agreement Using Partial AuthenticationBansal, Piyush / Gopal, Prasant / Gupta, Anuj / Srinathan, Kannan / Vasishta, Pranav Kumar et al. | 2011
- 404
-
On Approximate Distance Labels and Routing Schemes with Affine StretchAbraham, Ittai / Gavoille, Cyril et al. | 2011
- 416
-
The Complexity of Data Aggregation in Directed NetworksKuhn, Fabian / Oshman, Rotem et al. | 2011
- 432
-
Black Hole Search with Finite Automata Scattered in a Synchronous TorusChalopin, Jérémie / Das, Shantanu / Labourel, Arnaud / Markou, Euripides et al. | 2011
- 447
-
Synchronous Rendezvous for Location-Aware AgentsCollins, Andrew / Czyzowicz, Jurek / Gąsieniec, Leszek / Kosowski, Adrian / Martin, Russell et al. | 2011
- 460
-
Toward a Formal Semantic Framework for Deterministic Parallel ProgrammingLu, Li / Scott, Michael L. et al. | 2011
- 475
-
CAFÉ: Scalable Task Pools with Adjustable Fairness and ContentionBasin, Dmitry / Fan, Rui / Keidar, Idit / Kiselov, Ofer / Perelman, Dmitri et al. | 2011
- 489
-
Oblivious CollaborationAfek, Yehuda / Babichenko, Yakov / Feige, Uriel / Gafni, Eli / Linial, Nati / Sudakov, Benny et al. | 2011