Abstract
This paper presents a non-committing encryption scheme based on quadratic residue. It is a solution to adaptive security of multiparty computation with non-erasing parties in the cryptographic model. The scheme is more efficient than all previous non-committing encryption schemes. Furthermore, we give security proofs. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Feiyu, L., Wen, C., & Kefei, C. (2006). A non-committing encryption scheme based on quadratic residue. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4263 LNCS, pp. 972–980). Springer Verlag. https://doi.org/10.1007/11902140_101
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
