Filters








637 Hits in 2.1 sec

Generalized Ring Signatures

J. Ren, L. Harn
2008 IEEE Transactions on Dependable and Secure Computing  
In this paper, we first propose a generalized ring signature scheme based on the original ElGamal signature scheme.  ...  Comparing to ring signatures based on RSA algorithm, the proposed generalized ring signature scheme has three advantages: 1) all ring members can share the same prime number p and all operations can be  ...  ACKNOWLEDGMENTS The authors would like to thank an anonymous reviewer for the valuable comments on an earlier version of this paper.  ... 
doi:10.1109/tdsc.2008.22 fatcat:p6cl4lrpjzc5hn3bjrq3kfwztu

Proposing a method to design secure digital signature scheme on the ring structure Zn

Nguyen Dao Truong, Le Van Tuan
2022 Journal of Science and Technology on Information security  
Abstract—In this paper, we propose a method to design signature scheme on ring structure with residual classes modulo composite.  ...  Furthermore, our proposed signature scheme has overcome some weaknesses of some published signature scheme of the same type, which are built on ring structure.  ...  Basic signature scheme -BSS The content of this section presents a method to design a secure digital signature scheme based on the discrete logarithm problem on ring of the residual classes modulo composite  ... 
doi:10.54654/isj.v2i14.194 fatcat:i7uibf5yt5fgre73xxafukls2e

A New Signature Protocol Based on RSA and Elgamal Scheme

Ettanfouhi J, Khadir O
2016 International Journal of Information Technology, Modeling and Computing  
In this paper, we present a new signature scheme based on factoring and discrete logarithm problems.  ...  Derived from a variant of ElGamal signature protocol and the RSA algorithm, this method can be seen as an alternative protocol if known systems are broken.  ...  Our method is based simultanyously on RSA cryptosystem and DLP. the new variant of Elgamal algorithm[4] to solve equation (9) and to get the values of r′ , s′ and t .  ... 
doi:10.5121/ijitmc.2016.4302 fatcat:w6uf3kobfnah5p5lj6mklebxgm

A Signature Algorithm Based On Dlp And Computing Square Roots

Ounasser Abid
2018 Zenodo  
In this work, we present a new digital signature protocol based on the discrete logarithm problem and computing square roots modulo a large composite number.  ...  KEYWORDS Public key cryptography, ElGamal signature scheme, discrete logarithm problem, Rabin digital signature  ...  VARIANT OF ELGAMAL SIGNATURE SCHEME Elgamal Signature Protocol In this section we recall ElGamal signature scheme [2] , in three steps. Step 1.  ... 
doi:10.5281/zenodo.1404702 fatcat:fdbt7xv7gncf3maohixntqrmra

NEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES

Ounasser Abid
2019 Zenodo  
In this work, a new digital signature based on elliptic curves is presented. We established its efficiency and security.  ...  The method, derived from a variant of ElGamal signature scheme, can be seen as a secure alternative protocol if known systems are completely broken.  ...  For elliptic curves digital signature algorithm (ECDSA) based partially on the ElGamal classical protocol, see [14, p.297] or [8, p.134 ].  ... 
doi:10.5281/zenodo.2567721 fatcat:l4qmjoyevjholi3nxefb32tnmy

A Novel Provably Secure Anonymous Communication (PSAC) Scheme

Jian Ren, Lein Harn, Tongtong Li
2007 International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)  
To solve this problem, a k-anonymous protocol based on hierarchical ring structure and mix technique was proposed.  ...  International Conference on Wireless Algorithms, Systems and Applications 0-7695-2981-X/07 $25.00  ...  Recently, message sender anonymity based on ring signatures were introduced [18] .  ... 
doi:10.1109/wasa.2007.39 fatcat:mn6w2acgufhczoxsayckyt3kxm

A Signature Algorithm based on DLP and Computing Square Roots

Ounasser Abid, Omar Khadir
2016 International Journal of Information Technology, Modeling and Computing  
In this work, we present a new digital signature protocol based on the discrete logarithm problem and computing square roots modulo a large composite number.  ...  VARIANT OF ELGAMAL SIGNATURE SCHEME Elgamal Signature Protocol In this section we recall ElGamal signature scheme [2] , in three steps. Step 1.  ...  In the next section, we expose ElGamal signature and one of its variants. We devote the third section to describe our contribution and to analyze the security issue.  ... 
doi:10.5121/ijitmc.2016.4103 fatcat:ak33djifjrhtbmbs73qldxkmky

Insecure primitive elements in an ElGamal signature protocol [article]

Omar Khadir
2015 arXiv   pre-print
Consider the classical ElGamal digital signature scheme based on the modular relation α^m≡ y^r r^s [p].  ...  In 1985, ElGamal [6] proposed a public key cryptosystem and one of the first digital signature protocols both based on the discrete logarithm.  ...  The equation is based on a hard question in mathematics like factorization or discrete logarithm problem.  ... 
arXiv:1509.01504v1 fatcat:bgsjr5nixzgt3nsvkwqanuuu6q

Digital signature and public key cryptosystem in a prime order subgroup of Zn* [chapter]

Colin Boyd
1997 Lecture Notes in Computer Science  
There are similarities with the best known digital signatures and public key cryptosystems (RSA and discrete logarithm based schemes) in terms of the mathematical structure.  ...  A new digital signature scheme and public key cryptosystem are proposed which use operations in a prime order subgroup of Z n for a composite number n.  ...  1 mod z mod n is a valid signature for m. Finding z is the discrete logarithm problem in the ring Z n .  ... 
doi:10.1007/bfb0028490 fatcat:rqltzihbojc7biw7ce5gko7bjy

Short Accountable Ring Signatures Based on DDH [chapter]

Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit
2015 Lecture Notes in Computer Science  
They enable individual users to anonymously sign messages on behalf of a group of users. In ring signatures, the group, i.e. the ring, is chosen in an ad hoc manner by the signer.  ...  Accountable ring signatures imply traditional ring and group signatures.  ...  Constant-size ring signatures can also be based on the strong RSA assumption [DKNS04] and on pairing assumptions [Ngu05] .  ... 
doi:10.1007/978-3-319-24174-6_13 fatcat:flp2cxh6vndfxfyqbj5qa37u5m

Eos a Universal Verifiable and Coercion Resistant Voting Protocol [chapter]

Ştefan Patachi, Carsten Schürmann
2017 Lecture Notes in Computer Science  
We present the voting protocol Eos that is based on a conditional linkable ring signatures scheme. Voters are organized in rings allowing them to sign votes anonymously.  ...  Voters may assume multiple pseudo identities, one of which is legitimate. We use the others to signal coercion to the Election Authority.  ...  Based on CLR signatures, we develop then a universally verifiable, receiptfree, coercion-resistant, vote secrecy and integrity preserving voting protocol, named Eos, which is also described in this paper  ... 
doi:10.1007/978-3-319-68687-5_13 fatcat:5grjwufnl5ao5fzlecq3jspexi

A new CEMBS based on RSA signatures and its application in constructing fair exchange protocol

Zhou Yong-Bin, Zhang Zhen-Feng, Qing Si-Han, Liu Juan
2004 IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004  
And the devised scheme in this paper is the first efficient CEMBS based on RSA signatures.  ...  A new CEMBS-constructing method based on RSA signature is proposed, which is proved to be simple, efficient and secure.  ...  ·Another CEMBS-constructing process based on P = ElGamal , S GQ = has one severe flaw, for in this scheme only one component D of signature ( , d ) D is encrypted.  ... 
doi:10.1109/eee.2004.1287365 fatcat:3jpnzjaz5basxaesgdt3j5tyve

Conditions on the generator for forging ElGamal signature [article]

Omar Khadir
2013 arXiv   pre-print
This paper describes new conditions on parameters selection that lead to an efficient algorithm for forging ElGamal digital signature. Our work is inspired by Bleichenbacher's ideas.  ...  One of the most popular signature algorithm was proposed by ElGamal [4] . It has many variants [16, 17, 9, 5] and is based on the hard discrete logarithm problem.  ...  The first sufficient condition for forging ElGamal signature is based on a slight simplification of Bleichenbacher's theorem. More precisely, we have : Theorem 2.  ... 
arXiv:1301.2907v1 fatcat:m5rgv7dmebhsfalbecui5ocgiu

New variant of ElGamal signature scheme [article]

Omar Khadir
2013 arXiv   pre-print
In this paper, a new variant of ElGamal signature scheme is presented and its security analyzed. We also give, for its theoretical interest, a general form of the signature equation.  ...  New Variant and Theoretical Generalization In this section, we suggest a new variant of ElGamal signature scheme based on an equation with three unknown variables.  ...  In 1985, ElGamal [3] , inspired by the Diffie-Hellman ingenious ideas on new directions in cryptography [2] , was one of the firsts to propose a practical signature scheme.  ... 
arXiv:1301.3258v1 fatcat:5kmapyreerej3pqvyi4h4l3lju

On the Uniformity of Distribution of the Elliptic Curve ElGamal Signature

Edwin El Mahassni, Igor Shparlinski
2002 Finite Fields and Their Applications  
The result is based on some new estimates of exponential sums. For the ElGamal signature over a finite field, a similar result has been obtained by the second author. # 2002 Elsevier Science (USA)  ...  We show that, under some natural conditions, the pairs ðr; sÞ produced by the elliptic curve ElGamal signature scheme are uniformly distributed.  ...  Our result is based on a new upper bound of exponential sums with linear combinations of rðkÞ and sðk; mÞ which can be of independent interest.  ... 
doi:10.1006/ffta.2002.0366 fatcat:hoy2olivbzclzltp3zem4jupby
« Previous Showing results 1 — 15 out of 637 results