acm-header
Sign In

Communications of the ACM

ACM TechNews

Breakthrough in Cryptography Could Result in More Secure Computing


View as: Print Mobile App Share:
A representation of cryptographic security, part of which has been broken.

A newly developed protocol is said to be the fastest known way to implement Multi-Party Computation, in which two or more people can compute any function of their choosing based on secret inputs.

Credit: ThinkDigit.com

Researchers at the University of Bristol and Aarhus University have developed the SPDZ protocol, which they say is the fastest known protocol to implement a theoretical idea called Multi-Party Computation.

This theory enables two or more people to compute any function of their choosing on their secret inputs, without revealing their inputs to either party. The researchers say the SPDZ protocol turns Multi-Party Computation from a theoretical tool into a practical reality.

The SPDZ protocol enables researchers to compute complex functions in a secure manner, enabling possible applications in the finance, pharmaceutical, and chemical industries where computation often needs to be performed on secret data.

"We have demonstrated our protocol to various groups and organizations across the world, and everyone is impressed by how fast we can actually perform secure computations," says Bristol professor Nigel Smart. "Only a few years ago, such a theoretical idea becoming reality was considered Alice in Wonderland style over ambitious hope."

From Bristol University
View Full Article

Abstracts Copyright © 2013 Information Inc., Bethesda, Maryland, USA


 

No entries found

Sign In for Full Access
» Forgot Password? » Create an ACM Web Account