Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting

DOI10.1515/jmc-2021-0054zbMath1495.68053OpenAlexW4297999087MaRDI QIDQ2079218

Srinivas Vivek, Deepak Kumaraswamy, Shyam Murthy

Publication date: 29 September 2022

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2021-0054

zbMATH Keywords

sortingpolynomial reconstructionsomewhat homomorphic encryptionlow-depth circuit

Mathematics Subject Classification ID

Searching and sorting (68P10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Uses Software

• SageMath
• UCI-ml
• ANewDsc
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Fixed-point arithmetic in SHE schemes
• On the security of homomorphic encryption on approximate numbers
• Cryptanalysis of a protocol for efficient sorting on SHE encrypted data
• Homomorphic rank sort using surrogate polynomials
• TFHE: fast fully homomorphic encryption over the torus
• Homomorphic encryption for arithmetic of approximate numbers
• Learning Polynomials with Queries: The Highly Noisy Case
• Oblivious transfer and polynomial evaluation
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Depth Optimized Efficient Homomorphic Sorting
• Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
• Computing Real Roots of Real Polynomials ... and now For Real!
• Order-Preserving Symmetric Encryption
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Spanning Trees—Short or Small
• Fully homomorphic encryption using ideal lattices
• When Newton meets Descartes

This page was built for publication: Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting