Secure Linear Algebra Using Linearly Recurrent Sequences
From MaRDI portal
Publication:3596387
DOI10.1007/978-3-540-70936-7_16zbMath1129.94028OpenAlexW2126531634WikidataQ59163764 ScholiaQ59163764MaRDI QIDQ3596387
Eike Kiltz, Payman Mohassel, Matthew Franklin, Enav Weinreb
Publication date: 30 August 2007
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_16
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Efficient set operations in the presence of malicious adversaries ⋮ A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals ⋮ Communication-Efficient Private Protocols for Longest Common Subsequence ⋮ Multiparty cardinality testing for threshold private intersection ⋮ Multi-party threshold private set intersection with sublinear communication ⋮ Secure linear system computation in the presence of malicious adversaries
This page was built for publication: Secure Linear Algebra Using Linearly Recurrent Sequences