scholarly journals Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings

2004 ◽  
pp. 372-386 ◽  
Author(s):  
Lan Nguyen ◽  
Rei Safavi-Naini
Keyword(s):  
Free Group ◽  
Bilinear Pairings ◽  
Group Signature ◽  
Signature Schemes ◽  
Provably Secure

Certificateless Short Signature Scheme from Bilinear Pairings

2013 ◽  
Vol 380-384 ◽  
pp. 2435-2438 ◽  
Author(s):  
Shu Rong Feng ◽  
Jiao Mo ◽  
Hua Zhang ◽  
Zheng Ping Jin
Keyword(s):  
Bilinear Pairings ◽  
Public Key ◽  
Security Level ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Short Signature ◽  
Certificateless Signature ◽  
Provably Secure

Certificateless short signature schemes can not only have the advantage of certificateless signature, but also provide a short signature size in communication. However, all existing certificateless short signature schemes only proven secure against a normal adversary which can only obtain the valid signature for the original public key rather than a super adversary which can obtain the valid signature for the replaced public key. Recently, Fan et al. proposed a certificateless short signature scheme which is very efficient, but we found it is still cannot against super adversary. In this paper, we first analysis their scheme, and then present an improved scheme which can against super adversaries. Furthermore, our scheme can provide both the strongest security level and the shortest signature size compared the existed provably secure certificateless short signature scheme.

scholarly journals Provably Secure Group Signature Schemes From Code-Based Assumptions

2020 ◽  
Vol 66 (9) ◽  
pp. 5754-5773 ◽  
Author(s):  
Martianus Frederic Ezerman ◽  
Hyung Tae Lee ◽  
San Ling ◽  
Khoa Nguyen ◽  
Huaxiong Wang
Keyword(s):  
Group Signature ◽  
Signature Schemes ◽  
Provably Secure

scholarly journals Provably Secure Anonymous-yet-Accountable Crowdsensing with Scalable Sublinear Revocation

2017 ◽  
Vol 2017 (4) ◽  
pp. 384-403 ◽  
Author(s):  
Sazzadur Rahaman ◽  
Long Cheng ◽  
Danfeng Daphne Yao ◽  
He Li ◽  
Jung-Min Jerry Park
Keyword(s):  
Citizen Science ◽  
Low Cost ◽  
Group Signature ◽  
Performance Gain ◽  
Signature Scheme ◽  
Dynamic Nature ◽  
Open Problems ◽  
Signature Schemes ◽  
Experimental Findings ◽  
Provably Secure

Abstract Group signature schemes enable anonymous-yet-accountable communications. Such a capability is extremely useful for applications, such as smartphone-based crowdsensing and citizen science. However, the performance of modern group signature schemes is still inadequate to manage large dynamic groups. In this paper, we design the first provably secure verifier-local revocation (VLR) - based group signature scheme that supports sublinear revocation, named Sublinear Revocation with Backward unlinkability and Exculpability (SRBE). To achieve this performance gain, SRBE introduces time bound pseudonyms for the signer. By introducing low-cost short-lived pseudonyms with sublinear revocation checking, SRBE drastically improves the efficiency of the group-signature primitive. The backward-unlinkable anonymity of SRBE guarantees that even after the revocation of a signer, her previously generated signatures remain unlinkable across epochs. This behavior favors the dynamic nature of real-world crowdsensing settings. We prove its security and discuss parameters that influence its scalability. Using SRBE, we also implement a prototype named GroupSense for anonymous-yet-accountable crowdsensing, where our experimental findings confirm GroupSense’s scalability. We point out the open problems remaining in this space.

scholarly journals Breaking and Repairing Trapdoor-Free Group Signature Schemes from Asiacrypt’2004

2007 ◽  
Vol 22 (1) ◽  
pp. 71-74
Author(s):  
Xin-Yi Huang ◽  
Willy Susilo ◽  
Yi Mu ◽  
Fu-Tai Zhang
Keyword(s):  
Free Group ◽  
Group Signature ◽  
Signature Schemes

scholarly journals A Secure and Efficient Off-line Electronic Payment System forWireless Networks

2010 ◽  
Vol 5 (4) ◽  
pp. 551 ◽  
Author(s):  
Horea Oros ◽  
Constantin Popescu
Keyword(s):  
Bilinear Pairings ◽  
Payment System ◽  
Group Signature ◽  
Electronic Payment ◽  
Electronic Cash ◽  
Signature Schemes ◽  
Limited Bandwidth ◽  
System A ◽  
Payment Protocol ◽  
Electronic Payment System

An electronic cash system allows the exchange of digital coins with value assured by the bank’s signature and with concealed user identity. In an electronic cash system, a user can withdraw coins from the bank and then spends each coin anonymously and unlinkably. In this paper we propose a secure and efficient off-line electronic payment system based on bilinear pairings and group signature schemes. The anonymity of the customer is revocable by a trustee in case of a dispute. Because the amount of communication in the payment protocol is about 480 bits, the proposed off-line electronic payment system can be used in wireless networks with limited bandwidth.

Leakage-Free and Provably Secure Certificateless Signcryption Scheme Using Bilinear Pairings

2015 ◽  
Vol 58 (10) ◽  
pp. 2636-2648 ◽  
Author(s):  
SK Hafizul Islam ◽  
Fagen Li
Keyword(s):  
Bilinear Pairings ◽  
Signcryption Scheme ◽  
Provably Secure

Two proposals for group signature schemes based on number theory problems

2012 ◽  
Vol 21 (4) ◽  
pp. 648-658
Author(s):  
R. Duran Diaz ◽  
L. Hernandez Encinas ◽  
J. Munoz Masque
Keyword(s):  
Number Theory ◽  
Group Signature ◽  
Signature Schemes
Sign in / Sign up

Export Citation Format

Share Document