Loading...
Please wait, while we are loading the content...
Similar Documents
Constant-round non-malleable commitments from any one-way function (2011)
| Content Provider | CiteSeerX |
|---|---|
| Author | Lin, Huijia Pass, Rafael |
| Description | In STOC We show unconditionally that the existence of commitment schemes implies the existence of constant-round non-malleable commitments; earlier protocols required additional assumptions such as collision resistant hash functions or subexponential one-way functions. Our protocol also satisfies the stronger notions of concurrent non-malleability and robustness. As a corollary, we establish that constant-round non-malleable zero-knowledge arguments for NP can be based on one-way functions and constant-round secure multi-party computation can be based on enhanced trapdoor permutations; also here, earlier protocols additionally required either collision-resistant hash functions or subexponential one-way functions. |
| File Format | |
| Language | English |
| Publisher Date | 2011-01-01 |
| Access Restriction | Open |
| Subject Keyword | Concurrent Non-malleability Constant-round Non-malleable Zero-knowledge Argument Additional Assumption Subexponential One-way Function One-way Function Commitment Scheme Collision Resistant Hash Function Constant-round Secure Multi-party Computation Constant-round Non-malleable Commitment Enhanced Trapdoor Permutation Collision-resistant Hash Function |
| Content Type | Text |
| Resource Type | Article |
