Secure linear system computation in the presence of malicious adversaries

DOI10.1007/S11432-014-5160-2MaRDI QIDQ2335946zbMATH OpenOpenAlexFDO

Authors Bo Zhang, Fangguo Zhang

Publication date 18 November 2019

Published in Science China Information Sciences (Search for Journal in Brave)

Full work available at URL http://engine.scichina.com/doi/10.1007/s11432-014-5160-2

zbMATH Keywords

cut-and-chooselinear system computationnoisy codingoblivious transfersecure two-party computation

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) Cryptography (94A60)

Recommendations

• Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
• scientific article; zbMATH DE number 6402149
• Secure Linear Algebra Using Linearly Recurrent Sequences
• Theory of Cryptography
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations

Cites work

• A Framework for Efficient and Composable Oblivious Transfer
• A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
• Efficient oblivious transfer protocols
• Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
• Efficient Two-Party Secure Computation on Committed Inputs
• Foundations of Cryptography
• scientific article; zbMATH DE number 3887879 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1842488 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions
• Secure Arithmetic Computation with No Honest Majority
• Secure Linear Algebra Using Linearly Recurrent Sequences
• Secure two-party computation via cut-and-choose oblivious transfer
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Security and composition of multiparty cryptographic protocols
• Theory of Cryptography
• Two-output secure computation with malicious adversaries

Cited in

(4)

• A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
• Maliciously secure matrix multiplication with applications to private deep learning
• Non-black-Box Computation of Linear Regression Protocols with Malicious Adversaries
• Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries

This page was built for publication: Secure linear system computation in the presence of malicious adversaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2335946)