Next Article in Journal
Multi-Factor Authentication: A Survey
Previous Article in Journal
Anomalous Traffic Detection and Self-Similarity Analysis in the Environment of ATMSim
Article Menu

Export Article

Open AccessArticle
Cryptography 2017, 1(3), 25; https://doi.org/10.3390/cryptography1030025

Cryptographically Secure Multiparty Computation and Distributed Auctions Using Homomorphic Encryption

Department of Computer Science, Stanford University, Stanford, CA 94305, USA
*
Author to whom correspondence should be addressed.
Received: 7 October 2017 / Revised: 30 November 2017 / Accepted: 7 December 2017 / Published: 12 December 2017
View Full-Text   |   Download PDF [322 KB, uploaded 13 December 2017]   |  

Abstract

We introduce a robust framework that allows for cryptographically secure multiparty computations, such as distributed private value auctions. The security is guaranteed by two-sided authentication of all network connections, homomorphically encrypted bids, and the publication of zero-knowledge proofs of every computation. This also allows a non-participant verifier to verify the result of any such computation using only the information broadcasted on the network by each individual bidder. Building on previous work on such systems, we design and implement an extensible framework that puts the described ideas to practice. Apart from the actual implementation of the framework, our biggest contribution is the level of protection we are able to guarantee from attacks described in previous work. In order to provide guidance to users of the library, we analyze the use of zero knowledge proofs in ensuring the correct behavior of each node in a computation. We also describe the usage of the library to perform a private-value distributed auction, as well as the other challenges in implementing the protocol, such as auction registration and certificate distribution. Finally, we provide performance statistics on our implementation of the auction. View Full-Text
Keywords: public key cryptography; multiparty computation; homomorphic encryption; zero-knowledge proofs; distributed systems; secure auctions public key cryptography; multiparty computation; homomorphic encryption; zero-knowledge proofs; distributed systems; secure auctions
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Kulshrestha, A.; Rampuria, A.; Denton, M.; Sreenivas, A. Cryptographically Secure Multiparty Computation and Distributed Auctions Using Homomorphic Encryption. Cryptography 2017, 1, 25.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top