Secure linear system computation in the presence of malicious adversaries

DOI10.1007/S11432-014-5160-2zbMath1426.15002OpenAlexW2046260703MaRDI QIDQ2335946

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

oblivious transfercut-and-choosesecure two-party computationlinear system computationnoisy coding

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Secure two-party computation via cut-and-choose oblivious transfer
• Security and composition of multiparty cryptographic protocols
• Two-Output Secure Computation with Malicious Adversaries
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Secure Linear Algebra Using Linearly Recurrent Sequences
• Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
• A Framework for Efficient and Composable Oblivious Transfer
• Secure Arithmetic Computation with No Honest Majority
• A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
• Foundations of Cryptography
• Efficient Two-Party Secure Computation on Committed Inputs
• Theory of Cryptography

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