Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation

DOI10.1007/978-3-642-32928-9_24zbMath1365.68294OpenAlexW340586133MaRDI QIDQ2912810

Ching-Hua Yu, Bo-Yin Yang

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32928-9_24

zbMATH Keywords

data privacytwo-party computationprobabilistically correct algorithmsecure arithmetic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

\( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ Encryption Switching Protocols

This page was built for publication: Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation