80 Hits in 5.1 sec

A New Partially Blind Signature Based on Factoring and Discrete Logarithms

N.M.F. Tahat, S.M.A. Shatnawi, E.S. I smail
2008 Journal of Mathematics and Statistics  
In this study, we propose a secure partially blind signature scheme based on factoring and discrete logarithms and show that the proposed scheme satisfies the partial blindness, randomization, unlinkability  ...  Partially blind signatures played an important role in many electronic commerce applications. Many existing partially blind signature scheme based on a single hard problem but not secure.  ...  However, all developed partially blind signature schemes in the literature are based on a single hard problem like factoring, discrete logarithm or elliptic curve discrete logarithm problem.  ... 
doi:10.3844/jmssp.2008.124.129 fatcat:rwwrykawkbbczlnjkrstknnu6y

CLB-ECC: Certificateless Blind Signature Using ECC

2015 Journal of Information Processing Systems  
In this article, we propose a certificateless blind signature protocol which is based on elliptic curve cryptography (CLB-ECC).  ...  An e-cash framework, which is based on CLB-ECC, has also been proposed.  ...  It is observed from the literature that most of the recent certificateless blind signature schemes are based on a discrete logarithm problem and integer factorization problem.  ... 
doi:10.3745/jips.03.0029 fatcat:4qickopzezfi3nfbny6qjclgim

Strong loss tolerance of electronic coin systems

Birgit Pfitzmann, Michael Waidner
1997 ACM Transactions on Computer Systems  
In particular, systems based on electronic coins are treated. We present general design principles and options and their instantiation in one concrete payment system. The measures are practical.  ...  Untraceable electronic cash means prepaid digital payment systems, usually with offline payments, that protect user privacy.  ...  Cryptographic Preliminaries The system is based on the assumption that it is infeasible to compute discrete logarithms in certain families of large groups.  ... 
doi:10.1145/253145.253282 fatcat:azduni7ay5hydgxta4k4bl2qia

Group blind digital signatures: A scalable solution to electronic cash [chapter]

Anna Lysyanskaya, Zulfikar Ramzan
1998 Lecture Notes in Computer Science  
We show how to use our group blind signatures to construct an electronic cash system in which multiple banks can securely distribute anonymous and untraceable e-cash.  ...  In this paper we construct a practical group blind signature scheme. Our scheme combines the already existing notions of blind signatures and group signatures.  ...  Acknowledgements The first author would like to acknowledge the support of DARPA grant DABT 63-96-C-0018, the NSF Graduate Research Fellowship and a Lucent Technologies GRPW Program.  ... 
doi:10.1007/bfb0055483 fatcat:haiu42vfpbgj7eax4ann3xpemu

ID-based restrictive partially blind signatures and applications

Xiaofeng Chen, Fangguo Zhang, Shengli Liu
2007 Journal of Systems and Software  
The existing restrictive partially blind signature scheme was constructed under certificate-based (CA-based) public key systems.  ...  Restrictive blind signatures allow a recipient to receive a blind signature on a message not known to the signer but the choice of message is restricted and must conform to certain rules.  ...  We assume that the discrete logarithm problem (DLP) in both G 1 and G 2 are hard. A bilinear pairing is a map e : G 1 × G 1 → G 2 with the following properties: 1.  ... 
doi:10.1016/j.jss.2006.02.046 fatcat:semwt2mkxrfc5cgkfwunmx3rsa

A New Design Partially Blind Signature Scheme Based On Two Hard Mathematical Problems

Nedal Tahat
2012 Zenodo  
Recently, many existing partially blind signature scheme based on a single hard problem such as factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems.  ...  This paper proposes a secured partially blind signature scheme based on factoring (FAC) problem and elliptic curve discrete logarithms (ECDL) problem.  ...  Based on this blindness property, blind signatures have been widely used in untraceable electronic cash systems. 2) Randomization: The signer will inject one or more randomizing factors into the blinded  ... 
doi:10.5281/zenodo.1328602 fatcat:jpsgq5h23neztiww3yqnerihcm

PairiPairing-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment Systemng-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment System

In order to improve the efficiency, in this paper, we propose a new pairing free partially blind signature scheme with message recovery in the identity-based frame work.  ...  The proposed scheme is existentially unforgeable with the assumption that the Elliptic Curve Discrete Logarithm Problem (ECDLP) is hard.  ...  Elliptic Curve Discrete Logarithm Problem Given a random instance , P the generator of G and , Q aP  where , q a Z   the Elliptic Curve Discrete Logarithm Problem (ECDLP) is to find  ... 
doi:10.26782/jmcms.2019.06.00036 fatcat:tx5bvi5nizegbhwjqdymeqstty

An efficient ID-based partially blind signature scheme and application in electronic-cash payment system

Mahender Kumar, C.P. Katti
2016 ACCENTS Transactions on Information Security  
Fort this reason, we present a novel efficient identity-based partially blind signature scheme (ID-PBS) based on the hardness of gap Diffie-Hellman problem and elliptic curve discrete logarithm problem  ...  A kind of blind signature, partially blind signature, allows a user to request the signatory authority on some pre-shared information such that signatory authority only sign the message but could not able  ...  Acknowledgment This research work has been partially supported by the Council of Scientific and Industrial Research, a research and development organisation in India, with sanctioned no. 09/263(1052)/2015  ... 
doi:10.19101/tis.2017.26002 fatcat:s4jbj5aehfbi7dwu3y5mzxscj4

An ECC-Based Blind Signature Scheme

Fuh-Gwo Jeng, Tzer-Long Chen, Tzer-Shyong Chen
2010 Journal of Networks  
All blind signature schemes proposed previously almost are based on the integer factorization problems, discrete logarithm problems, or the quadratic residues, which are shown by Lee et al. that none of  ...  Cryptography is increasingly applied to the E-commerce world, especially to the untraceable payment system and the electronic voting system.  ...  ACKNOWLEDGEMENT This work was supported partially by National Science Council of Republic of China under Grants NSC 98-2221-E-029-025.  ... 
doi:10.4304/jnw.5.8.921-928 fatcat:ltsb2xugsrgwpfri4pgwptzjka

Simple and Transparent E-Cash System with Observers

Eligijus Sakalauskas, Inga Timofejeva, Aleksėjus Michalkovič, Jonas Muleravičius
2018 Information Technology and Control  
The security of the proposed e-money system is based on discrete logarithm problems in cyclic and elliptic curve groups. The system's security against chosen message attack is provided.  ...  The proposed e-cash system is based on two well-known cryptographic primitives, namely ElGamal signature along with Schnorr identification protocols.  ...  The first one is based on the discrete logarithm problem (DLP), or ElGamal cryptography, the second one -on elliptic curve discrete logarithm problem (ECDLP).  ... 
doi:10.5755/j01.itc.47.1.18021 fatcat:ktbud2zaf5cctpwu3vaoywvrli

Untraceable Fair Network Payment Protocols with Off-Line TTP [chapter]

Chih-Hung Wang
2003 Lecture Notes in Computer Science  
This paper employs two techniques of off-line untraceable cash and designated confirmer signatures to construct a new fair payment protocol, in which the untraceability (or privacy) property can be achieved  ...  The fairness concept in payments can be illustrated as that two parties (e.g. customers and merchants) exchange the electronic items (e.g. electronic money and goods) with each other in a fair manner that  ...  Acknowledgement This work was supported in part by National Science Council of Republic of China under contract NSC91-2213-E-415-005.  ... 
doi:10.1007/978-3-540-40061-5_11 fatcat:4whsud564re7vc2k46dmfyjjui

An Efficient Divisible Electronic Cash Scheme [chapter]

Tatsuaki Okamoto
1995 Lecture Notes in Computer Science  
Therefore, our "divisible" off-line cash scheme is more efficient and practical than the previous schemes.  ...  exponentiations for one payment, while all previous divisible cash schemes require more than several Kbytes of transfered data and more than 200 modular exponentiations for one payment.  ...  of the payment protocol, the modular square root operations are needed with probability of 4/18, and the average number of the root operations is 5.  ... 
doi:10.1007/3-540-44750-4_35 fatcat:pvxymb6lsbdcdnhwys7qqwhyku

Provably Secure Untraceable Electronic Cash against Insider Attacks

2007 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
Firstly we discussed the security model of e-cash schemes based on the blind multisignature scheme against a (restricted) attack model and proposed a concrete scheme proven to be secure in the model [1  ...  Second, we propose a new untraceable e-cash scheme with a blind multisignature scheme and prove that the proposed scheme is secure against the (non-restricted) attacks under the DDH assumption in the random  ...  Acknowledgements The authors are grateful to anonymous referees for their valuable remarks and suggestions that helped to improve the quality and readability of the paper.  ... 
doi:10.1093/ietfec/e90-a.5.980 fatcat:yqlv7nqqorghndruj7net3j6yq

Strengthened security for blind signatures [chapter]

David Pointcheval
1998 Lecture Notes in Computer Science  
Moreover, this transformation keeps the scheme efficient and so can be used in a secure and efficient anonymous off-line electronic cash system.  ...  Last year, Stern and the author studied the security of blind signatures in this model.  ...  Therefore, all the security of the system relies on the security of the blind signature that we use. In all the proposed electronic cash schemes, two main blind signature schemes have been used.  ... 
doi:10.1007/bfb0054141 fatcat:oh355ztw3beetffb5ekbubq2ni

Combating Double-Spending Using Cooperative P2P Systems

Ivan Osipkov, Eugene Y. Vasserman, Nicholas Hopper, Yongdae Kim
2007 27th International Conference on Distributed Computing Systems (ICDCS '07)  
A variety of schemes with various security properties have been proposed for this purpose, but because strings of bits are inherently copyable, they must all deal with the problem of double-spending.  ...  In this paper, we present an electronic cash scheme that introduces a new peer-to-peer system architecture to prevent double-spending without requiring an on-line trusted party or tamper-resistant software  ...  This work was partially supported by NSF grants CNS-0546162 and CNS-0448423.  ... 
doi:10.1109/icdcs.2007.91 dblp:conf/icdcs/OsipkovVHK07 fatcat:vrnczvvuffev3mwsoc66ydydwm
« Previous Showing results 1 — 15 out of 80 results