Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers

DOI10.1016/J.INS.2018.07.046MaRDI QIDQ2200560zbMATH OpenOpenAlexFDO

Authors Lin-Ming Gong, Bo Yang, Tao Xue, Wei Wang, Jin-Guang Chen

Publication date 22 September 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2018.07.046

zbMATH Keywords

online collaborationsecure equivalence test based on rational numbersstandard (ideal/real) modelthreshold cryptosystem with rational numbers

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 2085431
• An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics
• Numerical method for comparison on homomorphically encrypted numbers
• An efficient rational secret sharing scheme based on the Chinese remainder theorem
• Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
• A new construction of threshold cryptosystems based on RSA
• A novel RSA-like cryptosystem based on a generalization of the Rédei rational functions
• scientific article; zbMATH DE number 1894959
• Cryptocomputing with rationals
• A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals

Cites work

• scientific article; zbMATH DE number 1583777 (Why is no real title available?)
• scientific article; zbMATH DE number 1302792 (Why is no real title available?)
• scientific article; zbMATH DE number 2043334 (Why is no real title available?)
• scientific article; zbMATH DE number 1759349 (Why is no real title available?)
• Cryptography made simple
• Efficient verifiable multi-secret sharing scheme based on hash function
• Foundations of Cryptography
• Multiparty proximity testing with dishonest majority from equality testing
• Practical threshold signatures
• Probabilistic public key encryption with equality test
• Provably secure threshold paillier encryption based on hyperplane geometry
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Secure multiparty computation and secret sharing

This page was built for publication: Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200560)