Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Danielle Movsowitz-Davidow

dblp:173/8374 · also Danielle Movsowitz · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2023
0000-0003-4475-662XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › utility computing
cloud pricing
0.712023
Deconstructing Alibaba Cloud's Preemptible Instance Pricing · HPDC 2023
Cloud and datacenter computing
resource management
0.212023
Deconstructing Alibaba Cloud's Preemptible Instance Pricing · HPDC 2023
Cloud and datacenter computing › utility computing › cloud pricing
spot market
0.212023
Deconstructing Alibaba Cloud's Preemptible Instance Pricing · HPDC 2023

Methods — techniques the papers use, named apart from their topics

pricing analysis · 0.7
YearPublicationVenuePosition
2023 Privacy-Preserving Transactions with Verifiable Local Differential Privacy
abstract
Differential Privacy (DP) is often presented as a strong privacy-enhancing technology with broad applicability and advocated as a de-facto standard for releasing aggregate statistics on sensitive data. However, in many embodiments, DP introduces a new attack surface: a malicious entity entrusted with releasing statistics could manipulate the results and use the randomness of DP as a convenient smokescreen to mask its nefariousness. Since revealing the random noise would obviate the purpose of introducing it, the miscreant may have a perfect alibi. To close this loophole, we introduce the idea of \textit{Verifiable Differential Privacy}, which requires the publishing entity to output a zero-knowledge proof that convinces an efficient verifier that the output is both DP and reliable. Such a definition might seem unachievable, as a verifier must validate that DP randomness was generated faithfully without learning anything about the randomness itself. We resolve this paradox by carefully mixing private and public randomness to compute verifiable DP counting queries with theoretical guarantees and show that it is also practical for real-world deployment. We also demonstrate that computational assumptions are necessary by showing a separation between information-theoretic DP and computational DP under our definition of verifiability.
Danielle Movsowitz-Davidow, Yacov Manevich, Eran Toch
AFT1
2023 Deconstructing Alibaba Cloud's Preemptible Instance Pricing
Danielle Movsowitz-Davidow, Orna Agmon Ben-Yehuda, Orr Dunkelman
HPDC1
2022 Sharp behavioral changes in preemptible instance pricing
abstract
Alibaba Cloud was the second cloud provider to offer preemptible (spot) instances, and yet their price traces have never been analyzed. We analyzed thousands of price traces collected for over 3 years to find sharp and coordinated behavioral changes in the pricing.
Danielle Movsowitz-Davidow, Orna Agmon Ben-Yehuda, Orr Dunkelman
SYSTOR1