Positional characteristics for efficient number comparison over the homomorphic encryption

DOI10.1134/S0361768819080115zbMath1455.68052OpenAlexW2999062680WikidataQ121727983 ScholiaQ121727983MaRDI QIDQ2217212

Yanyan Li

Publication date: 18 December 2020

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768819080115

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
• Secure cloud computing based on threshold homomorphic encryption
• Residue-to-binary converters based on new Chinese remainder theorems
• Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
• Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
• The Mixed-Radix Chinese Remainder Theorem and Its Applications to Residue Comparison
• A new technique for fast number comparison in the residue number system

This page was built for publication: Positional characteristics for efficient number comparison over the homomorphic encryption