On the Complexity of UC Commitments

DOI10.1007/978-3-642-55220-5_37zbMath1328.68027OpenAlexW2122828120MaRDI QIDQ5418722

Hoeteck Wee, Yuval Ishai, Ranjit Kumaresan, Juan A. Garay

Publication date: 27 May 2014

Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_37

zbMATH Keywords

oblivious transferuniversal composabilityUC commitments

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (6)

Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ All-but-many encryption ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments

This page was built for publication: On the Complexity of UC Commitments