A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
[CRYPTO 2016] showed that subexponentially strong one-way permutations are sufficient with just 3 rounds. ... The round complexity of commitment schemes in the standalone setting is well understood. ... The work of 1st, 3rd and 4th authors has been done in part while visiting UCLA. ...doi:10.1007/978-3-319-63715-0_5 fatcat:h52fqyyw5rabhc6morvtmmm6oa