On the (limited) power of non-equivocation

DOI10.1145/2332432.2332490zbMath1301.68065OpenAlexW2075331051MaRDI QIDQ2933805

No author found.

Publication date: 5 December 2014

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

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

zbMATH Keywords

non-equivocationtransferable authenticationtrusted hardware

Mathematics Subject Classification ID

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 (1)

Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing

This page was built for publication: On the (limited) power of non-equivocation