Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
From MaRDI portal
Publication:3003397
DOI10.1007/978-3-642-20465-4_25zbMath1291.68037OpenAlexW2126484007MaRDI QIDQ3003397
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_25
Related Items (23)
Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ Secure parameterized pattern matching ⋮ Compact and Efficient UC Commitments Under Atomic-Exchanges ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Structure-Preserving Smooth Projective Hashing ⋮ On the security of functional encryption in the generic group model ⋮ Enhanced Security of Attribute-Based Signatures ⋮ A bivariate polynomial-based cryptographic hard problem and its applications ⋮ Fast two-party signature for upgrading ECDSA to two-party scenario easily ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ All-but-many encryption ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ Fast secure two-party ECDSA signing ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Deterministic Encoding into Twisted Edwards Curves ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments ⋮ UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens ⋮ On black-box complexity of universally composable security in the CRS model
Uses Software
This page was built for publication: Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
