All-but-many encryption. A new framework for fully-equipped UC commitments

DOI10.1007/978-3-662-45608-8_23zbMATH Open1317.94108OpenAlexW436176431MaRDI QIDQ2936622FDOQ2936622

Authors: Eiichiro Fujisaki 

Publication date: 6 January 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_23

Recommendations

• All-but-many encryption
• Efficient non-interactive universally composable string-commitment schemes
• scientific article; zbMATH DE number 1942445
• Analysis and improvement of Lindell's UC-secure commitment schemes
• On the complexity of UC commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (8)

• SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
• All-but-many encryption
• On the complexity of additively homomorphic UC commitments
• Improving practical UC-secure commitments based on the DDH assumption
• Compact selective opening security from LWE
• On the (Non-)Equivalence of UC Security Notions
• Standard security does not imply indistinguishability under selective opening
• Public-key encryption with simulation-based selective-opening security and compact ciphertexts

This page was built for publication: All-but-many encryption. A new framework for fully-equipped UC commitments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936622)