Cryptographically Secure Multiparty Computation and Distributed Auctions Using Homomorphic Encryption

Cryptographically Secure Multiparty Computation and Distributed Auctions Using Homomorphic Encryption

Blog Article

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 Toys 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 Dice 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.