STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Computing algebraic formulas using a constant number of registers
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Private Simultaneous Messages Protocols with Applications
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Generalizing Cramer's Rule: Solving Uniformly Linear Systems of Equations
SIAM Journal on Matrix Analysis and Applications
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Minimal-latency secure function evaluation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Multiparty computation for interval, equality, and comparison without bit-decomposition protocol
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Secure linear algebra using linearly recurrent sequences
TCC'07 Proceedings of the 4th conference on Theory of cryptography
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Communication efficient secure linear algebra
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Hi-index | 0.00 |
This work deals with the communication complexity of secure multi-party protocols for linear algebra problems. In our model, complexity is measured in terms of the number of secure multiplications required and protocols terminate within a constant number of rounds of communication. Previous work by Cramer and Damgård proposes secure protocols for solving systems Ax = b of m linear equations in n variables over a finite field, with m ≤ n. The complexity of those protocols is n5. We show a new upper bound of m4 + n2m secure multiplications for this problem, which is clearly asymptotically smaller. Our main point, however, is that the advantage can be substantial in case m is much smaller than n. Indeed, if m = √n, for example, the complexity goes down from n5 to n2.5. Our secure protocols rely on some recent advances concerning the computation of the Moore-Penrose pseudo-inverse of matrices over fields of positive characteristic. These computations are based on the evaluation of a certain characteristic polynomial, in combination with variations on a well-known technique due to Mulmuley that helps to control the effects of non-zero characteristic. We also introduce a new method for secure polynomial evaluation that exploits properties of Chebychev polynomials, as well as a new secure protocol for computing the characteristic polynomial of a matrix based on Leverrier's lemma that exploits this new method.