Random oracles in constantipole

DOI10.1145/343477.343531zbMath1314.68074OpenAlexW1963710334MaRDI QIDQ5176778

Victor Shoup, Christian Cachin, Klaus Kursawe

Publication date: 3 March 2015

Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/343477.343531

zbMATH Keywords

asynchronous consensusthreshold signaturesByzantine faultscrytographic common coindual-threshold schemes

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)

Related Items (3)

High-threshold AVSS with optimal communication complexity ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ Low complexity Byzantine-resilient consensus

This page was built for publication: Random oracles in constantipole