2015Unpublished venueRequires access

Generic Constructions for Signcryption with Non-interactive Non-repudiation

Jia Fan, Lijun Zhang

Open publisher page 0 citations

Abstract

Non-interactive non-repudiation is a very important property of signcryption which enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we construct the generic "Sign-then-Encrypt" and "Encrypt-then-Sign" compositions for signcryption with non-interactive non-repudiation by making use of a normal digital signature primitive as well as a primitive called public key encryption with non-interactive opening. We then analyze the security of both types of compositions.

About this research paper

What this paper is about

Non-interactive non-repudiation is a very important property of signcryption which enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we construct the generic "Sign-then-Encrypt" and "Encrypt-then-Sign" compositions for signcryption with non-interactive non-repudiation by making use of a normal digital signature primitive as well as a primitive called public key encryption with non-interactive opening. We then analyze the security of both types of compositions.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Non-interactive non-repudiation is a very important property of signcryption which enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we construct the generic "Sign-then-Encrypt" and "Encrypt-then-Sign" compositions for signcryption with non-interactive non-repudiation by making use of a normal digital signature primitive as well as a primitive called public key encryption with non-interactive opening. We then analyze the security of both types of compositions.

Key concepts: Signcryption, Non-repudiation, Digital signature, Computer science, Construct (python library), Encryption, Sign (mathematics), Public-key cryptography

Related papers

Back to paper searchBrowse research topicsOriginal source
Generic Constructions for Signcryption with Non-interactive Non-repudiation — Research Paper | ScholarLens