Completed
It is impossible for an allocator to be private and live unless the number of processes is bounded a priori
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Private Resource Allocators and Their Applications
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 When an application consumes resources...
- 3 Attack on anonymous messengers [WPES '18]
- 4 Other examples of resource allocation
- 5 Allocation indistinguishability
- 6 Avoiding trivial allocators
- 7 Easy to distinguish FIFO allocator
- 8 Easy to distinguish Random allocator
- 9 Giving up work conservation is not enough
- 10 It is impossible for an allocator to be private and live unless the number of processes is bounded a priori
- 11 Slot-based allocator (bounded universe)
- 12 Random w/ dummies (bounded active proc.)
- 13 In many settings it is hard to bound #active processes due to, e.g., sybils
- 14 Diff. private allocator (bounded active honest)
- 15 Comparison of PRA efficiency
- 16 Our paper also describes
