A note on secure multiparty computation via higher residue symbols

DOI10.1515/jmc-2020-0013zbMath1468.94395OpenAlexW3081173147MaRDI QIDQ2040551

Ignacio Cascudo, Reto Schnyder

Publication date: 14 July 2021

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

Full work available at URL: https://doi.org/10.1515/jmc-2020-0013

zbMATH Keywords

secure multiparty computationpower residue symbolcyclotomic rings

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Fast secure comparison for medium-sized integers and its application in binarized neural networks
• A minimal model for secure computation (extended abstract)
• The Problem of Catalan
• How to share a secret
• Secure Multiparty Computation and Secret Sharing
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Theory of Cryptography

This page was built for publication: A note on secure multiparty computation via higher residue symbols