Example: bachelor of science
Protocols for Secure Computations (extended abstract)
successful cheating becomes vanishingly small, without revealing the values of i and j? We will show that this is possible in Section 3.3. (Note that this is a stronger re-quirement than the verifiability requirement used in the mental poker protocol in Shamir et. al. [5].) We have two other solutions to the millionaires’ prob-
Tags:
Information
Domain:
Source:
Link to this page: