Private multiplication over finite fields
type: Item
instance of: scholarly article
title: Private multiplication over finite fields
zbMATH Open document ID: 1418.94031
DOI: 10.1007/978-3-319-63697-9_14
author: Sonia Belaïd
author: Fabrice Benhamouda
author: Alain Passelègue
author: Emmanuel Prouff
author: Adrian Thillard
author: Damien Vergnaud
publication date: 2017-10-27T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M07
zbMATH DE Number: 6798808
zbMATH Keywords: side-channel analysis
zbMATH Keywords: probing model
zbMATH Keywords: bilinear complexity
zbMATH Keywords: randomness complexity
zbMATH Keywords: constructions
zbMATH Keywords: lower bounds
zbMATH Keywords: probabilistic method
MaRDI profile type: Publication
full work available at URL: 978-3-319-63697-9 14
OpenAlex ID: W2740740730
Recommended article: Private Computations over the Integers
Recommended article: Secure multiplication of shared secrets in the exponent
Recommended article: Randomness Complexity of Private Circuits for Multiplication
Recommended article: Partially homomorphic encryption schemes over finite fields
Recommended article: An Efficient and Provably Secure Private Polynomial Evaluation Scheme
Recommended article: Finite Fields, Gröbner Bases and Modular Secret Sharing
Recommended article: Verifiable private polynomial evaluation
Recommended article: Private computation of polynomials over networks
Recommended article: Q2721163
Recommended article: BetterTimes
description: scientific article; zbMATH DE number 6798808