Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
From MaRDI portal
Publication:1690213
DOI10.1007/978-3-319-70500-2_24zbMath1410.94058OpenAlexW2766318018MaRDI QIDQ1690213
Ivan Visconti, Michele Ciampi, Luisa Siniscalchi, Rafail Ostrovsky
Publication date: 19 January 2018
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/57155332/Delayed_Input_Non_Malleable_Zero_Knowledge_and_Multi_Party_Coin_Tossing_in_Four_Rounds.pdf
Related Items (7)
Round-optimal multi-party computation with identifiable abort ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Oblivious sampling with applications to two-party \(k\)-means clustering ⋮ Round-optimal secure multi-party computation ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
This page was built for publication: Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
