2,092 Hits in 4.7 sec

Cryptanalysis and Improvement of Blind Signcryption Scheme Based on Elliptic Curve

Malik Zia, Rashid Ali
2019 Electronics Letters  
In this Letter, the authors analysed a recently proposed blind signcryption scheme based on elliptic curves and proved it is insecure.  ...  A number of blind signcryption schemes are introduced over the years and some of them are proved to be insecure.  ...  This scheme does not provide the public verification property. Chakraborty and Mehta [14] proposed a blind signature scheme based on an elliptic curve with double blinding.  ... 
doi:10.1049/el.2019.0032 fatcat:whphbu2e2jcdhpnmu6ekr4ok6y

Page 3142 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
In this paper we propose an elliptic curve blind signature scheme and an elliptic curve blind multisignature scheme.  ...  Sachar Paulus (Weinheim) 2003d:94083 94A60 94462 Popescu, Constantin (R-ORA; Oradea) Blind signature and blind multisignature schemes using elliptic curves. (English summary) Stud. Univ.  ... 

Privacy on the Blockchain: Unique Ring Signatures [article]

Rebekah Mercer
2016 arXiv   pre-print
We review the privacy and security properties offered by the scheme we have constructed, and compare its efficiency with other commonly suggested approaches to privacy on the blockchain.  ...  Ring signatures are cryptographic protocols designed to allow any member of a group to produce a signature on behalf of the group, without revealing the individual signer's identity.  ...  Finally, thanks to the University of Manchester, UCL, Yorkshire Ladies' Trust, and countless others for their generous grants over the years, without which this MSc would not have been possible.  ... 
arXiv:1612.01188v2 fatcat:75ln3xybabbwhccxsdzekxlfwa

The Doubling Attack – Why Upwards Is Better than Downwards [chapter]

Pierre-Alain Fouque, Frederic Valette
2003 Lecture Notes in Computer Science  
in the elliptic curve setting.  ...  The recent developments of side channel attacks have lead implementers to use more and more sophisticated countermeasures in critical operations such as modular exponentiation, or scalar multiplication  ...  Coron's Second Countermeasure The second solution is based on the same idea as Chaum's blind RSA signature scheme.  ... 
doi:10.1007/978-3-540-45238-6_22 fatcat:x7fce7adm5e35mrrdvwyj3ruo4

Template Attacks on ECDSA [chapter]

Marcel Medwed, Elisabeth Oswald
2009 Lecture Notes in Computer Science  
The asymmetric cryptosystem under scrutiny is the elliptic curve digital signature algorithm (ECDSA). ECDSA is particularly suitable for 32-bit platforms.  ...  Template attacks have been considered exclusively in the context of implementations of symmetric cryptographic algorithms on 8-bit devices.  ...  ECDSA ECDSA is the elliptic curve version of the digital signature algorithm (DSA). This algorithm computes a signature, i.e. a pair of numbers (r, s), for a given message m.  ... 
doi:10.1007/978-3-642-00306-6_2 fatcat:s55hibjxqnhu5oecv3uekq3vdi

Binary Edwards Curves for Intrinsically Secure ECC Implementations for the IoT

Antoine Loiseau, Jacques J. A. Fournier
2018 Proceedings of the 15th International Joint Conference on e-Business and Telecommunications  
On top of the performance benefits, cryptography over such curves have some intrinsic security properties against physical attacks.  ...  In this document, we present a new set of Binary Edwards Curves which have been defined to achieve the highest security levels (up to 284-bit security level) and whose parameters have been defined to fit  ...  The idea of the differential w-coordinate is to represent a point P(x, y) of the curve by w(P) = x + y.  ... 
doi:10.5220/0006831506250631 dblp:conf/icete/LoiseauF18 fatcat:5f7a45glwzblfkdazctqstefj4

Secure Computation over Lattices and Elliptic Curves [article]

Brett Hemenway Falk, Daniel Noble
2020 IACR Cryptology ePrint Archive  
In this work, we design and implement decentralized versions of lattice-based and elliptic-curve-based public-key cryptoystems using generic secure multiparty computation (MPC) protocols.  ...  To improve performance, we present a novel oblivious elliptic curve multiplication protocol and a new noise-masking technique which may be of independent interest.  ...  Acknowledgements This research was sponsored in part by ONR grant (N00014-15-1-2750) "SynCrypt: Automated Synthesis of Cryptographic Constructions".  ... 
dblp:journals/iacr/FalkN20 fatcat:wx3lxc5c2ncnbkwwcd6t7purh4

Coordinate Blinding over Large Prime Fields [chapter]

Michael Tunstall, Marc Joye
2010 Lecture Notes in Computer Science  
In this paper we propose a multiplicative blinding scheme for protecting implementations of a scalar multiplication over elliptic curves.  ...  Specifically, this blinding method applies to elliptic curves in the short Weierstraß form over large prime fields.  ...  Acknowledgments The work described in this paper has been supported in part by the European Commission IST Programme under Contract IST-2002-507932 ECRYPT and EPSRC grant EP/F039638/1 "Investigation of  ... 
doi:10.1007/978-3-642-15031-9_30 fatcat:z7sakpmh2bby3gl4hg7vhxfbsa

Efficient Countermeasures Against Power Analysis for Elliptic Curve Cryptosystems [chapter]

Kouichi Itoh, Tetsuya Izu, Masahiko Takenaka
2004 IFIP International Federation for Information Processing  
In spite of continuous efforts of previous countermeasures, recent improved and sophisticated attacks against Elliptic Curve Cryptosystems are not protected.  ...  by Goubin and the Zero-value Point Analysis (ZPA) by Akishita-Takagi.  ...  Acknowledgments The authors would like to thank Toru Akishita, JJean-Bernard Fischer and Naoya Torii for their valuable and helpful comments on the preliminary version of this paper.  ... 
doi:10.1007/1-4020-8147-2_7 fatcat:qulzg45d65bv5fjegnw4zmndwa

Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields [chapter]

Tae Hyun Kim, Tsuyoshi Takagi, Dong-Guk Han, Ho Won Kim, Jongin Lim
2006 Lecture Notes in Computer Science  
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes.  ...  For the practical applications, it is crucial to provide efficient and secure implementations of the pairings. There have been several works on efficient implementations of the pairings.  ...  For example, identity based signature schemes such as short signature scheme by Boneh et al. require the secret information as an input (i.e., the secret scalar) of the elliptic curve scalar multiplication  ... 
doi:10.1007/11935070_11 fatcat:gscsnwskwfhwpeisug3ma5xnty

Page 10578 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
As an example, we de- scribe the first-known attack with subexponential complexity on Schnorr and Okamoto-Schnorr blind signatures over elliptic curve groups.”  ...  Summary: “The concept of quick trickle characteristic sequence is presented, the properties and numbers of quick trickle charac- teristic sequences are investigated, and the mapping relationship between  ... 

Flexible Exponentiation with Resistance to Side Channel Attacks [chapter]

Camille Vuillaume, Katsuyuki Okeya
2006 Lecture Notes in Computer Science  
Our countermeasure is well-suited for tamper-resistant implementations of RSA or DSA, without significant penalty in terms of speed compared to commonly implemented methods.  ...  Thanks to its high efficiency and flexibility, our method can be implemented on various platforms, from smartcards with low-end processors to high-performance servers.  ...  Acknowledgement This work was partly supported by National Institute of Information and Communications Technology (NICT).  ... 
doi:10.1007/11767480_18 fatcat:bmacuz4dyrhndpl6g4infbcnuy

The Provable Security of Ed25519: Theory and Practice [article]

Jacqueline Brendel, Cas Cremers, Dennis Jackson, Mang Zhao
2020 IACR Cryptology ePrint Archive  
Ed25519 is one of the most efficient and widely used signature schemes, and different instantiations of Ed25519 are used in protocols such as TLS 1.3, SSH, Tor, ZCash, and WhatsApp/Signal.  ...  In this work we provide the first detailed analysis and security proofs of Ed25519 signature schemes.  ...  Acknowledgements: We thank the anonymous reviewers as well as Mihir Bellare, Steven Galbraith, and Eike Kiltz for their helpful comments and discussions.  ... 
dblp:journals/iacr/BrendelCJZ20 fatcat:vrqksl7r3vgezdubpufh2yxyvm

A novel medical image signcryption scheme using tent-logistic-tent system and Henon chaotic map

Tahir Sajjad Ali, Rashid Ali
2020 IEEE Access  
The proposed scheme uses elliptic curve for signcryption purpose and chaotic maps for performing encryption of the medical images.  ...  It employs a technique of public key cryptography furnished with elliptic curve cryptography for the generation of secret encryption key.  ...  Currently Zia and Ali improved an elliptic curve based signcryption scheme for firewalls [70] and established the enhancement of a blind signcryption scheme based on elliptic curves [71] in 2019.  ... 
doi:10.1109/access.2020.2987615 fatcat:wgks5cvdojeixn4mb3qmuhipau

A secure and efficient certificateless content extraction signature with privacy protection

Can Zhao, Jiabing Liu, Fuyong Zheng, Dejun Wang, Bo Meng, Pandi Vijayakumar
2021 PLoS ONE  
In this study, we proposed a Secure and Efficient and Certificateless Content Extraction Signature with Privacy Protection (SECCESPP) in which scalar multiplication of elliptic curves is used to replace  ...  The security and privacy of the SECCESPP scheme are demonstrated based on the elliptic curve discrete logarithm problem in the random oracle model and are formally analyzed with the formal analysis tool  ...  Conclusion To improve the efficiency of and provide privacy protection for content extraction signatures, we proposed the SECCESPP scheme in which the scalar multiplication on elliptic curves is used to  ... 
doi:10.1371/journal.pone.0258907 pmid:34723998 pmcid:PMC8559944 fatcat:h72crstrejazjfkmjqzcguugbi
« Previous Showing results 1 — 15 out of 2,092 results