Results 111 to 120 of about 121,303 (160)

Identity Based Threshold Ring Signature

2005
In threshold ring signature schemes, any group of t entities spontaneously conscript arbitrarily n – t entities to generate a publicly verifiable t-out-of-n signature on behalf of the whole group, yet the actual signers remain anonymous. The spontaneity of these schemes is desirable for ad-hoc groups such as mobile ad-hoc networks.
Yiu, SM, Chow, SSM, Hui, LCK
openaire   +2 more sources

Efficient ID-based Threshold Ring Signature scheme

2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, 2008
Threshold ring signature enables any group of t entities spontaneously conscripting arbitrary n-t entities to generate a publicly verifiable t-out-of-n threshold signature on behalf of the whole group of the n entities, while the actual signers remain anonymous.
Jiang Han, Xu QiuLiang, Chen Guohua
openaire   +1 more source

Count Me In! Extendability for Threshold Ring Signatures

2022
Ring signatures enable a signer to sign a message on behalf of a group anonymously, without revealing her identity. Similarly, threshold ring signatures allow several signers to sign the same message on behalf of a group; while the combined signature reveals that some threshold t of the group members signed the message, it does not leak anything else ...
Aranha, Diego F., Hall-Andersen, Mathias Nørup, Nitulescu, Anca, Pagnin, Elena, Yakoubov, Sophia   +4 more
openaire   +3 more sources

Threshold Discernible Ring Signatures

2012
A ring signature [1] demonstrates that the signer who produced it is among a group A of n people, called a ring. A signer may produce a ring signature on any ring A he is part of, arbitrarily without any setup procedure or the consent of anyone in A. Several extensions of ring signatures have been proposed in literature.
Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan   +4 more
openaire   +1 more source

Separable Linkable Threshold Ring Signatures

2004
A ring signature scheme is a group signature scheme with no group manager to setup a group or revoke a signer. A linkable ring signature, introduced by Liu, et al. [20], additionally allows anyone to determine if two ring signatures are signed by the same group member (a.k.a. they are linked). In this paper, we present the first separable linkable ring
Patrick P. Tsang, Victor K. Wei, Tony K. Chan, Man Ho Au, Joseph K. Liu, Duncan S. Wong   +5 more
openaire   +1 more source

Identity-based threshold ring signature without pairings

2008 International Conference on Communications, Circuits and Systems, 2008
Identity-based(ID-based) threshold ring signature has rapidly emerged in recent years and many schemes have been proposed until now. However, most of these ID-based threshold ring signatures are constructed from bilinear pairings, a powerful but computationally expensive primitive.
null Xiong Hu, null Qin ZhiGuang, null Li FaGen, null JinJing   +3 more
openaire   +1 more source

Improved Lattice-Based Threshold Ring Signature Scheme

2013
We present in this paper an improvement of the lattice-based threshold ring signature proposed by Cayrel, Lindner, Ruckert and Silva (CLRS) [LATINCRYPT ’10]. We generalize the same identification scheme CLRS to obtain a more efficient threshold ring signature. The security of our scheme relies on standard lattice problems.
Slim Bettaieb, Julien Schrek
openaire   +1 more source

A Separable Threshold Ring Signature Scheme

2004
We present a threshold ring signature scheme (spontaneous anonymous threshold signature scheme) that allows the use of both RSA-based and DL-based public keys at the same time. More generally, the scheme supports the mixture of public keys for any trapdoor-one-way type as well as three-move type signature schemes. This kind of ‘separability’ has useful
Joseph K. Liu, Victor K. Wei, Duncan S. Wong   +2 more
openaire   +1 more source

Identity Based Threshold Ring Signature from Lattices

2014
In the graded encoding systems that can be used to construct multilinear maps, the graded Computational Deffie-Hellman problem gGCDHP problem is assumed to be hard. We present an equivalent problem, called the variant graded Computational Deffie-Hellman problem vGCDHP, and make generalization to get the general graded Computational Deffie-Hellman ...
Baodian Wei, Yusong Du, Huang Zhang, Fangguo Zhang, Haibo Tian, Chongzhi Gao   +5 more
openaire   +1 more source

A Novel Lattice-Based Threshold Ring Signature Scheme

2020 5th International Conference on Computer Science and Engineering (UBMK), 2020
In this paper, we present a new TRSS (threshold ring signature scheme) which depends on the worst-case hardness of a lattice problem. We apply Fiat-Shamir transform to a lattice-based identification scheme to obtain the proposed scheme. The hardness of the identification scheme which is the hybrid combination of two different designs is based on ...
Sedat Akleylek, Meryem Soysaldi
openaire   +1 more source