scientific article; zbMATH DE number 1842488
From MaRDI portal
Publication:4783722
zbMath1002.94027MaRDI QIDQ4783722
Ronald Cramer, Ivan B. Damgård
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390119
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
characteristic polynomialrankdeterminantsolution spacelinear systems of equationssecure linear algebraconstant round solutions
Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Numerical linear algebra (65F99)
Related Items (10)
Efficient secure multiparty computation of sparse vector dot products ⋮ Broadcast-optimal two round MPC with an honest majority ⋮ Threshold private set intersection with better communication complexity ⋮ Efficient Disjointness Tests for Private Datasets ⋮ On multiparty garbling of arithmetic circuits ⋮ A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ Multiparty cardinality testing for threshold private intersection ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Secure linear system computation in the presence of malicious adversaries
This page was built for publication:
