Proactive Secret Sharing with a Dishonest Majority

Eldefrawy, Karim; Lampkins, Joshua; Ostrovsky, Rafail; Yung, Moti

doi:10.1007/978-3-319-44618-9_28

Cited by 12 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this approach only helps with hiring new keepers but does not contribute to the security of the system in the sense that the threshold always remains that of the smaller set. Also, more complex secret redistribution and proactive secret sharing techniques with different security properties can be adopted in the spirit of [104,40,61,43].…”

Section: Dkg In Fairblockmentioning

confidence: 99%

FairBlock: Preventing Blockchain Front-Running with Minimal Overheads

Momeni

Gorbunov

Zhang

2023

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

This thesis consists of material all of which I authored or co-authored: see Statement of Contributions included in the thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners.I understand that my thesis may be made electronically available to the public. I am also grateful to my thesis readers: Alfred Menezes and Mohammad Hajiabadi for offering their time and invaluable perspectives on this thesis. v Dedication This is dedicated to the one I love, my lovely family, and loved ones in PS752. vi

show abstract

Section: Dkg In Fairblockmentioning

confidence: 99%

FairBlock: Preventing Blockchain Front-Running with Minimal Overheads

Momeni

Gorbunov

Zhang

2023

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

show abstract

“…First fo all, clients are not able to verify whether the number of Byzantines exceeds t and hence understand if the message obtained is correct. Secondly, Secret Sharing protocols operating in a synchronous distributed system with Byzantines (active adversaries) correctly work with a small number of Byzantines and have high complexity (f < n/2 − 1 and O(n 4 ) in [27]).…”

Section: Related Workmentioning

confidence: 99%

“…Recent Proactive Secret Sharing protocols, e.g. [27], show that Secret sharing can be applied also to synchronous networks. Even if Proactive Secret Sharing can guarantee the privacy of the data (this is out of the scope of the paper) against up to n − 2 passive adversaries, the solution has some limitations.…”

Section: Related Workmentioning

confidence: 99%

Building Regular Registers with Rational Malicious Servers and Anonymous Clients

Pozzo

Bonomi

Lazzeretti

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The paper addresses the problem of emulating a regular register in a synchronous distributed system where clients invoking read() and write() operations are anonymous while server processes maintaining the state of the register may be compromised by rational adversaries (i.e., a server might behave as rational malicious Byzantine process). We first model our problem as a Bayesian game between a client and a rational malicious server where the equilibrium depends on the decisions of the malicious server (behave correctly and not be detected by clients vs returning a wrong register value to clients with the risk of being detected and then excluded by the computation). We prove such equilibrium exists and finally we design a protocol implementing the regular register that forces the rational malicious server to behave correctly.

show abstract