Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity

DOI10.1007/978-3-642-21518-6_4MaRDI QIDQ3019915zbMATH OpenOpenAlexFDO

Authors Huafei Zhu, Feng Bao

Publication date 29 July 2011

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21518-6_4

zbMATH Keywords

adaptive securitynon-committing encryptionsuniversal composability

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Constant ciphertext-rate non-committing encryption from standard assumptions
• scientific article; zbMATH DE number 1759794
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• Efficient completely non-malleable public key encryption
• Optimal-rate non-committing encryption
• Completely Non-malleable Encryption Revisited
• A framework for unconditionally secure public-key encryption (with possible decryption errors)
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
• Efficient completely non-malleable and RKA secure public key encryptions
• From single-bit to multi-bit public-key encryption via non-malleable codes

Cited in

(3)

• Cryptography with constant input locality
• An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption
• scientific article; zbMATH DE number 1759794 (Why is no real title available?)

This page was built for publication: Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity

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