Filters








177 Hits in 5.1 sec

Improvement of Chen-Zhang-Liu's IRPB Signature Scheme

Dezhi Gao
2010 Intelligent Information Management  
Recently, Chen-Zhang-Liu first proposed an ID-based restrictive partially blind (IRPB) signature from bilinear pairings.  ...  Restrictive partially blind signatures incorporate the advantages of restrictive blind signatures and partially blind signatures, which play an important role in electronic commerce.  ...  Maitland and Boyd [4] first proposed a provably secure restrictive partially blind signature scheme, which satisfies the partial blindness and restrictive blindness.  ... 
doi:10.4236/iim.2010.29064 fatcat:5sbrcusgkvahzjuz2a57gqmbhe

ID-Based Restrictive Partially Blind Signatures [chapter]

Xiaofeng Chen, Fangguo Zhang, Shengli Liu
2005 Lecture Notes in Computer Science  
In this paper we follow Brand's construction to propose the first identity-based (ID-based) restrictive blind signature scheme from bilinear pairings.  ...  Furthermore, we first propose an ID-based restrictive partially blind signature scheme, which is provably secure in the random oracle model.  ...  In this paper we first propose an ID-based restrictive partially blind signature scheme from bilinear pairings.  ... 
doi:10.1007/11596981_17 fatcat:qrhtcfm5drfj7k233wljzcqi6a

ID-based restrictive partially blind signatures and applications

Xiaofeng Chen, Fangguo Zhang, Shengli Liu
2007 Journal of Systems and Software  
In this paper we follow Brand's construction to propose the first identity-based (ID-based) restrictive blind signature scheme from bilinear pairings.  ...  Furthermore, we first propose an ID-based restrictive partially blind signature scheme, which is provably secure in the random oracle model.  ...  In this paper we first propose an ID-based restrictive partially blind signature scheme from bilinear pairings.  ... 
doi:10.1016/j.jss.2006.02.046 fatcat:semwt2mkxrfc5cgkfwunmx3rsa

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

S J
2019 JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES  
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.  ...  A partially blind signature enables a signer to explicitly incorporate a pre-agreed common information into a blind signature without the loss of blindness property.  ...  [XXVI] proposed another partially blind signature scheme using bilinear pairings.  ... 
doi:10.26782/jmcms.2019.06.00036 fatcat:tx5bvi5nizegbhwjqdymeqstty

Round-Optimal ID-Based Blind Signature Schemes without ROS Assumption

Wei Gao, Guilin Wang, Xueli Wang, Fei Li
2012 Journal of Communications  
This paper presents two Identity-Based Blind Signature (IBBS) schemes based on bilinear pairings. Both of them enjoy the following features.  ...  First, they achieve the optimal bound of round complexity for blind signatures, i.e., each signature can be blindly generated with one round (or two moves) of message exchanges between the signature requesting  ...  CONCLUSIONS In this paper, we proposed two secure and practical oneround identity-based blind signature (IBBS) schemes from bilinear pairings without resorting to the ROS assumption.  ... 
doi:10.4304/jcm.7.12.909-920 fatcat:25j3znhqf5c2db4m7vcgcxknsi

On the generic construction of identity-based signatures with additional properties

Eike Kiltz, Javier Herranz, David Galindo
2010 Advances in Mathematics of Communications  
In particular, our work implies the existence of identity-based signatures with additional properties that are provably secure in the standard model, do not need bilinear pairings, or can be based on general  ...  Our results show that this is possible for great number of properties including proxy signatures; (partially) blind signatures; verifiably encrypted signatures; undeniable signatures; forward-secure signatures  ...  If S is a strongly secure standard signature scheme and PS is a secure (partially) blind signature scheme then a secure identity-based (partially) blind signature scheme IB PS can be constructed.  ... 
doi:10.3934/amc.2010.4.453 fatcat:zpdvgtqncvdcpiwjqzox3723ei

On the Generic Construction of Identity-Based Signatures with Additional Properties [chapter]

David Galindo, Javier Herranz, Eike Kiltz
2006 Lecture Notes in Computer Science  
In particular, our work implies the existence of identity-based signatures with additional properties that are provably secure in the standard model, do not need bilinear pairings, or can be based on general  ...  Our results show that this is possible for great number of properties including proxy signatures; (partially) blind signatures; verifiably encrypted signatures; undeniable signatures; forward-secure signatures  ...  If S is a strongly secure standard signature scheme and PS is a secure (partially) blind signature scheme then a secure identity-based (partially) blind signature scheme IB PS can be constructed.  ... 
doi:10.1007/11935230_12 fatcat:xmzndw3plzhqhbk4ryc5g6wb34

Concurrent Blind Signatures Without Random Oracles [chapter]

Aggelos Kiayias, Hong-Sheng Zhou
2006 Lecture Notes in Computer Science  
We present a blind signature scheme that is efficient and provably secure without random oracles under concurrent attacks utilizing only four moves of short communication.  ...  This latter variant of our scheme gives rise to a partially blind signature with essentially the same efficiency and security properties as our basic scheme. * An earlier version of this paper was titled  ...  Acknowledgement We thank one of the reviewers of Eurocrypt 2006 for pointing out a flaw in the design of a previous version of our blind signature protocol.  ... 
doi:10.1007/11832072_4 fatcat:pbfh7ie6pjd3hci2lpvhb2zpcy

Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures [chapter]

Sarah Meiklejohn, Hovav Shacham, David Mandell Freeman
2010 Lecture Notes in Computer Science  
Our example cryptosystem is a simple round-optimal blind signature scheme that is secure in the common reference string model, without random oracles, and based on mild assumptions; it is of independent  ...  Specifically, we show that a pairing generated in a natural way from the Decision Linear assumption in primeorder groups can be simultaneously cancelling and projecting only with negligible probability  ...  The first author is supported in part by a MURI grant administered by the Air Force Office of Scientific Research and in part by a graduate fellowship from the Charles Lee Powell Foundation.  ... 
doi:10.1007/978-3-642-17373-8_30 fatcat:opm5q3yy3vctto2zrf2eccsfnu

An Efficient Revocable Group Signature Scheme in Vehicular Ad Hoc Networks

2015 KSII Transactions on Internet and Information Systems  
Based on Chinese remainder theorem and Schnorr signature algorithm, this paper proposes an efficient revocable group signature scheme in VANETs.  ...  Although many revocable group signature schemes has been proposed in vehicular ad hoc networks (VANETs), the existing schemes suffer from long computation delay on revocation that they cannot adapt to  ...  Due to the application of restrictive partially blind signature technique in the generation of blind certificates, attackers cannot deduce the real identity of BVs from the blind certificate [30] .  ... 
doi:10.3837/tiis.2015.10.027 fatcat:hffcmfroibcmvh67jsxkhjd6qi

A Leakage Resilient MAC [chapter]

Daniel P. Martin, Elisabeth Oswald, Martijn Stam, Marcin Wójcik
2015 Lecture Notes in Computer Science  
We put forward the first practical message authentication code (MAC) which is provably secure against continuous leakage under the Only Computation Leaks Information (OCLI) assumption.  ...  our scheme to its non-leakage security.  ...  PRFs, Signatures) which can be converted into MACs. We show that compared to the majority of other provably secure schemes we are considerably more efficient.  ... 
doi:10.1007/978-3-319-27239-9_18 fatcat:ossr3onblzgplpfun7nlvnugiq

A Survey on Proxy Re-Signature Schemes for Translating One Type of Signature to Another

Shilpa Chaudhari, R. Aparna, Archana Rane
2021 Cybernetics and Information Technologies  
Blaze-Bleumer-Strauss discussed PRS in 1998 for translating a signature on a message from Alice into a signature from Bob on the same message at semi-trusted proxy which does not learn any signing-key  ...  location, delegatee involvement, proxy re-signing rights, duration-based revocation rights, security model environment, and cryptographic approach.  ...  The blind signature and blind message is given as input to blind agents in the PRS scheme. It provides security against forged signature attack.  ... 
doi:10.2478/cait-2021-0028 fatcat:47x4h2numbgx5duo6sdbcaqake

Identity Based Threshold Ring Signature [chapter]

Sherman S. M. Chow, Lucas C. K. Hui, S. M. Yiu
2005 Lecture Notes in Computer Science  
scheme (when t = 1) and threshold ring signature scheme from pairings.  ...  In this paper, we present an identity based (ID-based) threshold ring signature scheme. The scheme is provably secure in the random oracle model and provides trusted authority compatibility.  ...  Due to the elegancy of bilinear pairing, signatures generated by our scheme are much shorter and simpler than signatures from other previous threshold ring signature schemes.  ... 
doi:10.1007/11496618_17 fatcat:boetdxk4i5dc5lpowm4zpl57qm

Compact Group Signatures Without Random Oracles [chapter]

Xavier Boyen, Brent Waters
2006 Lecture Notes in Computer Science  
We present the first efficient group signature scheme that is provably secure without random oracles.  ...  First, we derive our underlying signature scheme from the Waters [Wat05] signature scheme that was proven secure under the computational Diffie-Hellman assumption in bilinear groups.  ...  Acknowledgments We thank Dawn Song for suggesting the concept of signature delegation and Dan Boneh for useful comments and suggestions.  ... 
doi:10.1007/11761679_26 fatcat:2npt2zhwznhrpdzo27zgheltse

$P^{2}$: Privacy-Preserving Communication and Precise Reward Architecture for V2G Networks in Smart Grid

Zhenyu Yang, Shucheng Yu, Wenjing Lou, Cong Liu
2011 IEEE Transactions on Smart Grid  
However, the close monitoring tends to raise privacy concerns from the BV owners about identity and location information leakage, which have not been considered in previous works.  ...  To protect privacy of BVs in V2G networks, we present 2 , a secure communication architecture which achieves privacy-preserving for both BVs' monitoring and rewarding processes.  ...  Maitland et al. and Chen et al. combined these two blind signature techniques and proposed provably secure restrictive partially blind signatures, based on public key infrastructure (PKI) and ID-based  ... 
doi:10.1109/tsg.2011.2140343 fatcat:4horpx3gpbdk7f4ej6me2n4y2e
« Previous Showing results 1 — 15 out of 177 results