Efficient Non-interactive Universally Composable String-Commitment Schemes

DOI10.1007/978-3-642-04642-1_3zbMath1267.94128OpenAlexW1487521202MaRDI QIDQ3651577

Ryo Nishimaki, Keisuke Tanaka, Eiichiro Fujisaki

Publication date: 11 December 2009

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04642-1_3

zbMATH Keywords

homomorphismuniversal composabilityall-but-one trapdoor functionsnon-interactive string commitment

Mathematics Subject Classification ID

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

Related Items (4)

More constructions of lossy and correlation-secure trapdoor functions ⋮ All-but-many encryption ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ General Construction of Chameleon All-But-One Trapdoor Functions

This page was built for publication: Efficient Non-interactive Universally Composable String-Commitment Schemes