[go: up one dir, main page]

Bouman et al., 2018 - Google Patents

New protocols for secure linear algebra: Pivoting-free elimination and fast block-recursive matrix decomposition

Bouman et al., 2018

View PDF
Document ID
1479998868911491576
Author
Bouman N
De Vreede N
Publication year
Publication venue
Cryptology ePrint Archive

External Links

Snippet

Cramer and Damg\aa {} rd were the first to propose a constant-rounds protocol for securely solving a linear system of unknown rank over a finite field in multiparty computation (MPC). For $ m $ linear equations and $ n $ unknowns, and for the case $ m\leq n $, the …
Continue reading at eprint.iacr.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
    • G06F2207/7219—Countermeasures against side channel or fault attacks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor

Similar Documents

Publication Publication Date Title
Hsiao Statistical inference for a model with both random cross-sectional and time effects
Salinas et al. Efficient secure outsourcing of large-scale linear systems of equations
Yang et al. All in the XL family: Theory and practice
Mari et al. Positive Wigner functions render classical simulation of quantum computation efficient
Liu et al. The hardness of LPN over any integer ring and field for PCG applications
Atallah Faster image template matching in the sum of the absolute value of differences measure
Kayal Efficient algorithms for some special cases of the polynomial equivalence problem
Bao et al. Approximation of invariant measures for regime-switching diffusions
Bogdanov et al. Bounded indistinguishability and the complexity of recovering secrets
US7864077B2 (en) System and method for encoding a signal using compressed sensor measurements
Bouman et al. New protocols for secure linear algebra: Pivoting-free elimination and fast block-recursive matrix decomposition
EP4167213B1 (en) Secret computation method, secret computation system, secret computation apparatus, and program
Ding et al. Efficient and secure outsourcing of large-scale linear system of equations
Maghrebi et al. On the use of independent component analysis to denoise side-channel measurements
Tjell et al. Privacy preserving recursive least squares solutions
Cipolloni et al. Out-of-time-ordered correlators for Wigner matrices
Zhang et al. Secure outsourcing evaluation for sparse decision trees
Cristiani et al. Fit the joint moments: how to attack any masking scheme
Bouillaguet et al. Practical cryptanalysis of pseudorandom correlation generators based on quasi-Abelian syndrome decoding
EP4236193B1 (en) Inner products with secure multi-party computations
US7584396B1 (en) System and method for decoding a signal using compressed sensor measurements
Jimenez et al. Privacy preserving distance computation using somewhat-trusted third parties
Bouman et al. A practical approach to the secure computation of the Moore–Penrose pseudoinverse over the rationals
Park et al. Resource-efficient shadow tomography using equatorial stabilizer measurements
Saunders et al. Matrix rank certification