Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
type: Item
instance of: scholarly article
title: Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
zbMATH Open document ID: 1495.68053
author: Srinivas Vivek
author: Shyam Murthy
author: Deepak Kumaraswamy
published in: Journal of Mathematical Cryptology
publication date: 2022-09-29T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7594486
zbMATH Keywords: polynomial reconstruction
zbMATH Keywords: somewhat homomorphic encryption
zbMATH Keywords: sorting
zbMATH Keywords: low-depth circuit
describes a project that uses: ANewDsc
describes a project that uses: SageMath
describes a project that uses: UCI-ml
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: jmc-2021-0054
OpenAlex ID: W4297999087
cites work: Improved decoding of Reed-Solomon and algebraic-geometry codes
cites work: Oblivious transfer and polynomial evaluation
cites work: Algebraic coding theory
cites work: Learning polynomials with queries: The highly noisy case
cites work: Q3374898
cites work: Fully homomorphic encryption using ideal lattices
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: TFHE: fast fully homomorphic encryption over the torus
cites work: Depth Optimized Efficient Homomorphic Sorting
cites work: Homomorphic rank sort using surrogate polynomials
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Order-Preserving Symmetric Encryption
cites work: Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
cites work: Fixed-point arithmetic in SHE schemes
cites work: Homomorphic encryption for arithmetic of approximate numbers
cites work: On the security of homomorphic encryption on approximate numbers
cites work: Cryptanalysis of a protocol for efficient sorting on SHE encrypted data
cites work: Spanning Trees—Short or Small
cites work: When Newton meets Descartes
cites work: Computing Real Roots of Real Polynomials ... and now For Real!
DOI: 10.1515/JMC-2021-0054
description: scientific article; zbMATH DE number 7594486