Matrix Signatures: From MACs to Digital Signatures in Distributed Systems

Authors:
Amitanand S. Aiyer;Lorenzo Alvisi;Rida A. Bazzi;Allen Clement
Affiliations:
Department of Computer Sciences, University of Texas at Austin,;Department of Computer Sciences, University of Texas at Austin,;School of Computing and Informatics, Arizona State University,;Department of Computer Sciences, University of Texas at Austin,
Venue:
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Year:
2008

Citing 5
Cited 4

Randomized algorithms

Randomized algorithms
Araneola: A Scalable Reliable Multicast System for Dynamic Environments

NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
Peer-to-peer networks based on random transformations of connected regular undirected graphs

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Building low-diameter peer-to-peer networks

IEEE Journal on Selected Areas in Communications
Binomial graph: a scalable and fault-tolerant logical network topology

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
MOMMIE knows best: systematic optimizations for verifiable distributed algorithms

HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
Byzantine fault-tolerance with commutative commands

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
On the (limited) power of non-equivocation

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general implementation for providing the properties of digital signatures using MACs in a system consisting of any number of untrusted clients and nservers, up to fof which are Byzantine. At the heart of the implementation is a novel matrix signaturethat captures the collective knowledge of the servers about the authenticity of a message. Matrix signatures can be generated or verified by the servers in response to client requests and they can be transmitted and exchanged between clients independently of the servers. The implementation requires that no more than one third of the servers be faulty, which we show to be optimal. The implementation places no synchrony requirements on the communication and only require fair channels between clients and servers.