1 Hit in 6.9 sec

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions [chapter]

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
2017 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