29 citations · 41 across the 7 of their papers we have counts for
6 papers
Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation
Samarth Tiwari, Michelle Yeo, Zeta Avarikioti +3
Payment channel networks (PCNs) are one of the most prominent solutions to the limited transaction throughput of blockchains. Nevertheless, PCNs suffer themselves from a throughput…
Deterministic Self-Adjusting Tree Networks Using Rotor Walks
Chen Avin, Marcin Bienkowski, Iosif Salem +3
We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications…
HIDE & SEEK: Privacy-Preserving Rebalancing on Payment Channel Networks
Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem +3
Payment channels effectively move the transaction load off-chain thereby successfully addressing the inherent scalability problem most cryptocurrencies face. A major drawback of pa…
LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks
Krzysztof Pietrzak, Iosif Salem, Stefan Schmid +1
Payment channel networks are a promising approach to improve the scalability of cryptocurrencies: they allow to perform transactions in a peer-to-peer fashion, along multi-hop rout…
An Online Matching Model for Self-Adjusting ToR-to-ToR Networks
Chen Avin, Chen Griner, Iosif Salem +1
This is a short note that formally presents the matching model for the theoretical study of self-adjusting networks as initially proposed in [1].
Practically-Self-Stabilizing Vector Clocks in the Absence of Execution Fairness
Iosif Salem, Elad Michael Schiller
Vector clock algorithms are basic wait-free building blocks that facilitate causal ordering of events. As wait-free algorithms, they are guaranteed to complete their operations wit…