Verifiably encrypted signatures (VES) have been widely used in various applications, such as signing contract, fair exchange and so on. However, most of them do not provide deterable function and with the development of quantum computers, they face new challenges. Verifiably encrypted double authentication preventing signatures (VEDAPS) with deterable function, have a property of punishing misbehavior parties by extracting their secret keys. In this paper, we propose a concrete VEDAPS based on Ring-SIS problem and Ring-LWE problem. Security analysis shows that our proposed scheme satisfies security properties including completeness, opacity, unforgeability and punishability in the random oracle model. Theory and parameter analyses demonstrate that our construction has reasonable efficiency for real applications.
CITATION STYLE
Liu, J., & Yu, Y. (2019). Lattice Based Verifiably Encrypted Double Authentication Preventing Signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11928 LNCS, pp. 581–595). Springer. https://doi.org/10.1007/978-3-030-36938-5_36
Mendeley helps you to discover research relevant for your work.