International audienceIn this work we propose the first code-based undeniable signature scheme (and more generally the first post-quantum undeniable signature scheme). The verification protocols for our scheme are 3-pass zero-knowledge protocols derived from the Stern authentication protocol. There are two main ideas in our protocol, first we remark that it is possible to obtain a full-time undeniable signature from a one-time undeniable signature simply by signing the one-time public key by a standard signature. Second, we introduce a zero-knowledge variation on the Stern authentication scheme which permits to prove that one or two different syndromes are associated (or not) to the same low weight word. We give a polynomial reduction of th...
In this paper, we present the first concrete example of identity-based undeniable signature with sel...
Today, the role of digital signatures becoming more and more significant. The signature provides aut...
In this paper, we propose a dual version of the first threshold ring signature scheme based on error...
This paper defines a new practical construction for a code-based signature scheme. We introduce a n...
The paper provides a complete description of the digital signature scheme based on the Stern identif...
Devising efficient and secure signature schemes based on coding theory is still considered a challen...
Devising efficient and secure signature schemes based on coding theory is still considered a challen...
This paper defines a new practical construction for a code-based signature scheme. We introduce a ne...
In an age of explosive growth of digital communications and electronic data storage, cryptography pl...
Certificateless cryptography addresses the private key escrow problem in identity-based systems, whi...
In this paper, we propose a dual version of the first identity-based scheme based on error-correctin...
Undeniable signatures are classic digital signatures which are not universally verifiable and can on...
Certificateless cryptosystems overcome the key escrow problem in identity-based cryptography. Mediat...
Abstract. We propose an undeniable signature scheme based on el-liptic curve isogenies, and prove it...
Undeniable signatures, introduced by Chaum and van Antwerpen, is a useful cryptography primitive to ...
In this paper, we present the first concrete example of identity-based undeniable signature with sel...
Today, the role of digital signatures becoming more and more significant. The signature provides aut...
In this paper, we propose a dual version of the first threshold ring signature scheme based on error...
This paper defines a new practical construction for a code-based signature scheme. We introduce a n...
The paper provides a complete description of the digital signature scheme based on the Stern identif...
Devising efficient and secure signature schemes based on coding theory is still considered a challen...
Devising efficient and secure signature schemes based on coding theory is still considered a challen...
This paper defines a new practical construction for a code-based signature scheme. We introduce a ne...
In an age of explosive growth of digital communications and electronic data storage, cryptography pl...
Certificateless cryptography addresses the private key escrow problem in identity-based systems, whi...
In this paper, we propose a dual version of the first identity-based scheme based on error-correctin...
Undeniable signatures are classic digital signatures which are not universally verifiable and can on...
Certificateless cryptosystems overcome the key escrow problem in identity-based cryptography. Mediat...
Abstract. We propose an undeniable signature scheme based on el-liptic curve isogenies, and prove it...
Undeniable signatures, introduced by Chaum and van Antwerpen, is a useful cryptography primitive to ...
In this paper, we present the first concrete example of identity-based undeniable signature with sel...
Today, the role of digital signatures becoming more and more significant. The signature provides aut...
In this paper, we propose a dual version of the first threshold ring signature scheme based on error...