Private multiplication over finite fields
From MaRDI portal
Recommendations
- Private Computations over the Integers
- Secure multiplication of shared secrets in the exponent
- Randomness complexity of private circuits for multiplication
- Partially homomorphic encryption schemes over finite fields
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Finite fields, Gröbner bases and modular secret sharing
- Verifiable private polynomial evaluation
- Private computation of polynomials over networks
- scientific article; zbMATH DE number 1612523
- Bettertimes. Privacy-assured outsourced multiplications for additively homomorphic encryption on finite fields
Cited in
(10)- Private Computations over the Integers
- Secure and efficient software masking on superscalar pipelined processors
- Exploiting algebraic structures in probing security
- Unifying freedom and separation for tight probing-secure composition
- Fast verification of masking schemes in characteristic two
- Randomness complexity of private circuits for multiplication
- Random probing security: verification, composition, expansion and new constructions
- Dynamic random probing expansion with quasi linear asymptotic complexity
- Packed multiplication: how to amortize the cost of side-channel masking?
- New instantiations of the CRYPTO 2017 masking schemes
This page was built for publication: Private multiplication over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675211)
