all InfoSec news
Efficient Multiparty Protocols Using Generalized Parseval's Identity and the Theta Algebra. (arXiv:2208.09852v2 [cs.CR] UPDATED)
Oct. 18, 2022, 1:20 a.m. | Giorgio Sonnino, Alberto Sonnino
cs.CR updates on arXiv.org arxiv.org
We propose a protocol able to show publicly addition and multiplication on
secretly shared values. To this aim we developed a protocol based on the use of
masks and on the FMPC (Fourier Multi-Party Computation). FMPC is a novel
multiparty computation protocol of arithmetic circuits based on secret-sharing,
capable to compute addition and multiplication of secrets with no
communication. We achieve this task by introducing the first generalisation of
Parseval's identity for Fourier series applicable to an arbitrary number of …
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Information Security Engineers
@ D. E. Shaw Research | New York City
Security Solution Architect
@ Civica | London, England, United Kingdom
Information Security Officer (80-100%)
@ SIX Group | Zurich, CH
Cloud Information Systems Security Engineer
@ Analytic Solutions Group | Chantilly, Virginia, United States
SRE Engineer & Security Software Administrator
@ Talan | Mexico City, Spain