A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra-Reference-Cited by-同舟云学术

A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra

Published: Issue: Volume: Page:613-630
ISSN:
Container-title:Advances in Cryptology - CRYPTO 2007
language:
Short-container-title:

Author:

Cramer Ronald,Kiltz Eike,Padró Carles

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74143-5_34.pdf

Reference22 articles.

1. Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in a constant number of rounds interaction. In: 8th ACM PODC, Edmonton, Alberta, Canada, August 14–16, 1989, pp. 201–209 (1989)

2. Lecture Notes in Computer Science;D. Beaver,2000

3. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: 22nd ACM STOC, Baltimore, Maryland, USA, May 14–16, 1990, pp. 503–513. ACM Press, New York (1990)

4. Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. SIAM J. Comput. 21(1), 54–58 (1992)

5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: 20th ACM STOC, Chicago, Illinois, USA, May 2–4, 1988, pp. 1–10. ACM Press, New York (1988)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Secure Multi-Party Linear Algebra with Perfect Correctness;IACR Communications in Cryptology;2024-04-09

2. A Practical Approach to the Secure Computation of the Moore–Penrose Pseudoinverse over the Rationals;Applied Cryptography and Network Security;2020

3. New Protocols for Secure Equality Test and Comparison;Applied Cryptography and Network Security;2018

4. Entangled cloud storage;Future Generation Computer Systems;2016-09

5. Secure linear system computation in the presence of malicious adversaries;Science China Information Sciences;2014-08-17