Homomorphic rank sort using surrogate polynomials
type: Item
instance of: scholarly article
title: Homomorphic rank sort using surrogate polynomials
zbMATH Open document ID: 1454.94058
DOI: 10.1007/978-3-030-25283-0_17
author: Gizem S. Çetin
author: Berk Sunar
publication date: 2020-03-02T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7176324
zbMATH Keywords: private computation
zbMATH Keywords: encrypted computing
zbMATH Keywords: fully homomorphic encryption
zbMATH Keywords: homomorphic sorting
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-030-25283-0 17
OpenAlex ID: W2798340061
Recommended article: Efficient linear-time ranking and unranking of derangements
Recommended article: Depth optimized efficient homomorphic sorting
Recommended article: Homogeneous polynomials with two sets computing their symmetric tensor rank
Recommended article: On ranks of polynomials
Recommended article: Polynomial-Time Algorithm for Sorting by Generalized Translocations
Recommended article: Stack-sortable permutations and polynomials
Recommended article: A rank question for homogeneous polynomials
Recommended article: Decomposition of homogeneous polynomials with low rank
Recommended article: Linear-Time Ranking of Permutations
Recommended article: A linear time randomizing algorithm for searching ranked functions
description: scientific article; zbMATH DE number 7176324