Amanote Research

Amanote Research

    RegisterSign In

Byzantine Set-Union Consensus Using Efficient Set Reconciliation

Eurasip Journal on Information Security - United Kingdom
doi 10.1186/s13635-017-0066-3
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer Science ApplicationsSignal Processing
Date

July 27, 2017

Authors
Florian DoldChristian Grothoff
Publisher

Springer Science and Business Media LLC


Related search

Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers

2013English

Efficient Alias Set Analysis Using SSA Form

2009English

Set Reconciliation With Nearly Optimal Communication Complexity

English

Efficient Top-Down Set-Sharing Analysis Using Cliques

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Disjoint Set Union With Randomized Linking

2013English

Constant-Round Multi-Party Private Set Union Using Reversed Laurent Series

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Efficient Private Matching and Set Intersection

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Decentralized Context Broker Using Byzantine Fault Tolerant Consensus

Ledger
2019English

Re: Developing a Set of Consensus Indicators to Support Maternity Service Quality Improvement: Using Core Outcome Set Methodology Including a Delphi Process

BJOG: An International Journal of Obstetrics and Gynaecology
GynecologyObstetrics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy