A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Attribute Based Multisignature Scheme for Wireless Communications
2015
Mobile Information Systems
Preserved Fulltext
In order to reduce the bandwidth needed to transmit attribute based signatures and keep signer's privacy, attribute based multisignature scheme (ABMS) was proposed in this paper. ...
The simulation shows that our ABMS scheme is more appropriate for wireless communication to guarantee integrity of the data. ...
In Section 2, we review some concept about bilinear pairing, complexity assumption, flexible threshold predicate, and Lagrange interpolation. ...
doi:10.1155/2015/827320
fatcat:er4zp6xgpbfg3dtr7s73qsfgdy
Forward-Secure Multisignature, Threshold Signature and Blind Signature Schemes
2010
Journal of Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this paper, we construct two forward-secure multisignature schemes, one forward-secure threshold signature scheme, and one forward-secure blind signature scheme. ...
Our constructions are based on the recently proposed forward-secure signature scheme from bilinear maps in [11] . ...
scheme from bilinear maps in [11] . ...
doi:10.4304/jnw.5.6.634-641
fatcat:jy2hnimplbgxtbxa6ayts3pegi
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem ...
Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [8] . ...
Acknowledgements We thank Mihir Bellare for the useful discussions, for suggesting to consider the topic of threshold signatures. ...
doi:10.1007/3-540-36288-6_3
fatcat:7ygbetygwndlxfidwbqehyq3eu
New Efficient Identity-Based Key-Insulated Multisignature Scheme
2013
International Journal of Machine Learning and Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Index Terms-Identity-based, key-insulated, multi-signature, key exposure, bilinear pairing. ...
In the proposed scheme, a valid key-insulted multisignature must be cooperatively generated by all signers. Our scheme has the properties of unbounded time periods and random-access key-updates. ...
multi-signature (IB-KIMS) scheme from pairings. ...
doi:10.7763/ijmlc.2013.v3.284
fatcat:phdx4kmnzzaznk7oevawo3xz44
Identity-Based Aggregate Signatures
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In our schemes, the verifier does not need to obtain and/or store various signer public keys to verify; instead, the verifier only needs a description of who signed what, along with two constant-length ...
Our scheme is secure in the random oracle model under the computational Diffie-Hellman assumption over pairing-friendly groups against an adversary that chooses its messages and its target identities adaptively ...
Bilinear Maps Our IBAS scheme uses a bilinear map, which is often called a "pairing." ...
doi:10.1007/11745853_17
fatcat:glcpkottnra3rlht2fep2pqk2y
A Secure and an Efficient ID-based Multi-Proxy Multi-Signature Scheme from Bilinear Pairings
2017
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an identity based multi-proxy multi-signature scheme from bilinear pairings. ...
Due to various application of the bilinear pairings in cryptography, many identity based signature scheme have been proposed. ...
In this paper, we propose a secure an efficient ID-based multiproxy multi-signature scheme from bilinear pairings. ...
doi:10.5120/ijca2017912735
fatcat:uf33hrdxzfbd5pjpczoxt5xh2i
New identity-based society oriented signature schemes from pairings on elliptic curves
2005
Applied Mathematics and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Both schemes make use of pairings on elliptic curves in construction and thus have the merits of simplicity in design and efficiency in performance. ...
In this paper, we will propose two identity-based society oriented signature schemes that allow a group of co-signers to collaboratively generate a single signature for a message. ...
In this paper, we will propose two identity-based society oriented signature schemes from pairings on elliptic curves. ...
doi:10.1016/j.amc.2003.07.016
fatcat:53qvekkzv5dvrky5cc4vk37fwm
Compact Multi-signatures for Smaller Blockchains
[chapter]
2018
Advances in Industrial Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In addition, we construct the first short accountable-subgroup multisignature (ASM) scheme. ...
Secure multi-signatures have been constructed from Schnorr signatures (e.g. [9]), from BLS signatures (e.g. [10]), and from many other schemes as discussed in Section 1.5. ...
Bilinear groups are typically asymmetric, in the sense that one of the two groups has a more compact representation. ...
doi:10.1007/978-3-030-03329-3_15
fatcat:efd5ctujrvdq3blkn2jeoxl65i
Generalized Ring Signatures
2008
IEEE Transactions on Dependable and Secure Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
performed in the same domain; 2) by combining with multisignatures, we can develop the generalized multisigner ring signature schemes to enforce cross-organizational involvement in message leaking. ...
In this paper, we first propose a generalized ring signature scheme based on the original ElGamal signature scheme. ...
Recently, ring signature schemes based on bilinear pairing [7] , [8] , [9] , [10] and identity-based ring signature schemes [9] , [11] are introduced. ...
doi:10.1109/tdsc.2008.22
fatcat:p6cl4lrpjzc5hn3bjrq3kfwztu
Identity-Based Threshold Proxy Signature from Bilinear Pairings
2010
Informatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present two identitybased threshold proxy signature schemes, which allow an original signer to delegate her signing capability to a group of n proxy signers, and it requires a consensus of t or more ...
In addition to identity-based scheme, privacy protection for proxy singers and security assurance are two distinct features of this work. ...
Bilinear Pairing Bilinear pairing is a key primitive for many ID-based cryptographic schemes, for example, , Boneh and Franklin (2003) , Cha and Cheon (2003) , Baek and Zheng (2004) , Gagne (2002) ...
doi:10.15388/informatica.2010.272
fatcat:i7nemng6zvglhmv2kn6ttaheze
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
We construct an efficient aggregate signature from a recent short signature scheme based on bilinear maps due to Boneh, Lynn, and Shacham. ...
An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into a ...
Two groups (G 1 , G 2 ) are a bilinear group pair if the group action on either can be computed in one time unit, the map ψ from G 2 to G 1 can be computed in one time unit, a bilinear map e : G 1 × G ...
doi:10.1007/3-540-39200-9_26
fatcat:jrmb7whrzjd2jj7uwe2o3oasbm
Unique Aggregate Signatures with Applications to Distributed Verifiable Random Functions
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
By proving uniqueness of existing pairing-based aggregate signature schemes we immediately obtain several concrete communicationefficient DVUF/DVRF instantiations. ...
The DVRF scheme from [11] requires a trusted setup procedure for the generation and distribution of shares sk i , which is a strong assumption. ...
Similarly, the multisignature scheme from [22] , which is based on the signature scheme by Waters [32] , could be used to build DVUF in the standard model. ...
doi:10.1007/978-3-319-02937-5_14
fatcat:a4xr7hh6zrae3dqejrsodcajoe
SeDyA
2013
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks - WiSec '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Aggregation of information in these messages contributes to this goal by reducing the bandwidth requirements that prevent applications from disseminating messages over a large area. ...
Aggregation will allow applications to exchange high quality summaries of the current status in a specific region, rather than forwarding all individual status messages from this region, increasing the ...
One of the issues encountered when using elliptic curves is that of pairings 3 . These pairings map two points of an elliptic curve to a group G using a bilinear map. ...
doi:10.1145/2462096.2462119
dblp:conf/wisec/HeijdenDK13
fatcat:7jpa6vqikrf55miqglcjs5ck5a
A New Approach to Group Signature Schemes
2011
Journal of Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Using this method, Based on the famous BLS signature scheme from bilinear pairings, we put forward a new group signature scheme. ...
Due to the simple constructive method and the sound properties of bilinear pairings, it is shown that our scheme is very efficient. ...
A bilinear pairing is a computable map 1
1
2
:
e G G
G
× →
with the following two properties. ...
doi:10.4304/jcp.6.4.812-817
fatcat:4rpmnc3slra4dghabcfussnw4i
Provably Secure Untraceable Electronic Cash against Insider Attacks
2007
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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 ...
[16] proposed another concrete scheme from a bilinear map. ...
doi:10.1093/ietfec/e90-a.5.980
fatcat:yqlv7nqqorghndruj7net3j6yq
« Previous
Showing results 1 — 15 out of 55 results