Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era

Juan Garay; Aggelos Kiayias; Rafail M. Ostrovsky; Giorgos Panagiotakos; Vassilis Zikas

Conference ProceedingsOPEN ACCESS

Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era

Garay J
Kiayias A
Ostrovsky R
et al.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2020) 12106 LNCS 129-158

DOI: 10.1007/978-3-030-45724-2_5

8Citations

24Readers

Abstract

Traditional bounds on synchronous Byzantine agreement (BA) and secure multi-party computation (MPC) establish that in absence of a private correlated-randomness setup, such as a PKI, protocols can tolerate up to t

Cite

CITATION STYLE

APA

Garay, J., Kiayias, A., Ostrovsky, R. M., Panagiotakos, G., & Zikas, V. (2020). Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12106 LNCS, pp. 129–158). Springer. https://doi.org/10.1007/978-3-030-45724-2_5

Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era

Abstract

Cite

Register to see more suggestions