MPC-friendly commitments for publicly verifiable covert security
We address the problem of efficiently verifying a commitment in a two-party computation. This addresses the scenario where a party P1 commits to a value 𝑥 to be used in a subsequent secure computation with another party P2 that wants to receive assurance that P1 did not cheat, i.e. that 𝑥 was indeed...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
Association for Computer Machinery
2021
|