activity
20142026
most citedUsing GANs for Sharing Networked Time Series Data: Challenges, Initial Promise, and Open Questions

198 citations · 479 across the 26 of their papers we have counts for

collaborators
Showing cs.CRShow all

13 papers · 1 filter

cs.CR2026

Holding Agents Accountable with Verifiable Agent Insurance

Cheng Hua, Taro Tsuchiya, Nicolas Christin +1

While AI agents are useful for many tasks, they regularly misbehave in destructive ways, such as deleting important data. While prior work has focused on preventing such misbehavio…

cs.CR2023

Summary Statistic Privacy in Data Sharing

Zinan Lin, Shuaiqi Wang, Vyas Sekar +1

We study a setting where a data holder wishes to share data with a receiver, without revealing certain summary statistics of the data distribution (e.g., mean, standard deviation).…

cs.CR2022

Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and Protection

Alexander Goldberg, Giulia Fanti, Nihar B. Shah

There are a number of forums where people participate under pseudonyms. One example is peer review, where the identity of reviewers for any paper is confidential. When participatin…

cs.CR2022★ 26 cited

Strategic Latency Reduction in Blockchain Peer-to-Peer Networks

Weizhao Tang, Lucianna Kiffer, Giulia Fanti +1

Most permissionless blockchain networks run on peer-to-peer (P2P) networks, which offer flexibility and decentralization at the expense of performance (e.g., network latency). Hist…

cs.CR2019★ 21 cited

SquirRL: Automating Attack Analysis on Blockchain Incentive Mechanisms with Deep Reinforcement Learning

Charlie Hou, Mingxun Zhou, Yan Ji +4

Incentive mechanisms are central to the functionality of permissionless blockchains: they incentivize participants to run and secure the underlying consensus protocol. Designing in…

cs.CR2019★ 2 cited

Barracuda: The Power of -polling in Proof-of-Stake Blockchains

Giulia Fanti, Jiantao Jiao, Ashok Makkuva +3

A blockchain is a database of sequential events that is maintained by a distributed group of nodes. A key consensus problem in blockchains is that of determining the next block (da…

cs.CR2019★ 29 cited

Privacy-Utility Tradeoffs in Routing Cryptocurrency over Payment Channel Networks

Weizhao Tang, Weina Wang, Giulia Fanti +1

Payment channel networks (PCNs) are viewed as one of the most promising scalability solutions for cryptocurrencies today. Roughly, PCNs are networks where each node represents a us…

cs.CR2018

Compounding of Wealth in Proof-of-Stake Cryptocurrencies

Giulia Fanti, Leonid Kogan, Sewoong Oh +3

Proof-of-stake (PoS) is a promising approach for designing efficient blockchains, where block proposers are randomly chosen with probability proportional to their stake. A primary…

cs.CR2018★ 8 cited

Dandelion++: Lightweight Cryptocurrency Networking with Formal Anonymity Guarantees

Giulia Fanti, Shaileshh Bojja Venkatakrishnan, Surya Bakshi +4

Recent work has demonstrated significant anonymity vulnerabilities in Bitcoin's networking stack. In particular, the current mechanism for broadcasting Bitcoin transactions allows…

cs.CR2017★ 25 cited

Anonymity Properties of the Bitcoin P2P Network

Giulia Fanti, Pramod Viswanath

Bitcoin is a popular alternative to fiat money, widely used for its perceived anonymity properties. However, recent attacks on Bitcoin's peer-to-peer (P2P) network demonstrated tha…

cs.CR2017★ 13 cited

Dandelion: Redesigning the Bitcoin Network for Anonymity

Shaileshh Bojja Venkatakrishnan, Giulia Fanti, Pramod Viswanath

Bitcoin and other cryptocurrencies have surged in popularity over the last decade. Although Bitcoin does not claim to provide anonymity for its users, it enjoys a public perception…

cs.CR2015

Hiding the Rumor Source

Giulia Fanti, Peter Kairouz, Sewoong Oh +2

Anonymous social media platforms like Secret, Yik Yak, and Whisper have emerged as important tools for sharing ideas without the fear of judgment. Such anonymous platforms are also…

cs.CR2015

Building a RAPPOR with the Unknown: Privacy-Preserving Learning of Associations and Data Dictionaries

Giulia Fanti, Vasyl Pihur, Úlfar Erlingsson

Techniques based on randomized response enable the collection of potentially sensitive data from clients in a privacy-preserving manner with strong local differential privacy guara…