z-logo
open-access-imgOpen Access
Practical generation of common random strings for secure multiparty computations over the Internet
Author(s) -
István Vajda
Publication year - 2020
Publication title -
transactions on networks and communications
Language(s) - English
Resource type - Journals
ISSN - 2054-7420
DOI - 10.14738/tnc.86.9447
Subject(s) - computer science , adversary , protocol (science) , computer security , the internet , string (physics) , cryptography , secure multi party computation , computer network , theoretical computer science , mathematics , world wide web , medicine , alternative medicine , pathology , mathematical physics
It is known that most of the interesting multiparty cryptographic tasks cannot be implemented securely without trusted setup in a general concurrent network environment like the Internet. We need an appropriate trusted third party to solve this problem.  An important trusted setup is a public random string shared by the parties. We present a practical n-bit coin toss protocol for provably secure implementation of such setup. Our idea is inviting external peers into the execution of the protocol to establish an honest majority among the parties. We guarantee security in the presence of an unconditional, static, malicious adversary. Additionally, we present an original practical idea of using live public radio broadcast channels for the generation of common physical random source.  

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here