Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security

DOI10.1007/978-3-642-25385-0_25zbMath1227.94044OpenAlexW2138230193MaRDI QIDQ3102203

Benoît Libert, Mark Manulis, Marc Fischlin

Publication date: 2 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_25

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Skipping the \(q\) in group signatures ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ All-but-many encryption ⋮ An algebraic framework for Diffie-Hellman assumptions ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Removing Erasures with Explainable Hash Proof Systems ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption

This page was built for publication: Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security