1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DC2024
Linearizability and State-Machine Replication: Is it a match?
Franz J. Hauck, Alexander Heß
Linearizability is a well-known correctness property for concurrent and distributed systems. In the past, it was also used to prove the design and implementation of replicated stat…
cs.NI2021★ 1 cited
Arbitrary Length k-Anonymous Dining-Cryptographers Communication
David Mödinger, Alexander Heß, Franz J. Hauck
Dining-cryptographers networks (DCN) can achieve information-theoretical privacy. Unfortunately, they are not well suited for peer-to-peer networks as they are used in blockchain a…