Results 1 to 10 of about 50 (50)

Group Signature Without Random Oracles from Randomizable Signatures [PDF]

open access: yes, 2020
Group signature is a central tool for privacy-preserving protocols, ensuring authentication, anonymity and accountability. It has been massively used in cryptography, either directly or through variants such as direct anonymous attestations. However, it remains a complex tool, especially if one wants to avoid proving security in the random oracle model.
Clarisse, Rémi, Sanders, Olivier
openaire   +2 more sources

Group Signatures in Practice [PDF]

open access: yes, 2015
This work has been partially supported under the framework of the international cooperation program managed by National Research Foundation of Korea (NRF- 2013K2A1A2053670) and by Comunidad de Madrid (Spain) under the project S2013/ICE-3095-CM (CIBERDINE).
Gayoso Martínez, Víctor   +2 more
openaire   +2 more sources

Unique Group Signatures [PDF]

open access: yes, 2012
We initiate the study of unique group signature such that signatures of the same message by the same user will always have a large common component (i.e., unique identifier). It enables an efficient detection algorithm, revealing the identities of illegal users, which is fundamentally different from previous primitives.
Matthew Franklin, Haibin Zhang
openaire   +1 more source

Group actions and higher signatures [PDF]

open access: yesProceedings of the National Academy of Sciences, 1985
Let π be a nontrivial finite group and M be a closed manifold. An interesting question is whether or not M has the R -homology type of a manifold admitting a free π action. Here this problem is studied for actions that are “homologically trivial.” If π 1
openaire   +2 more sources

A traceable group signature scheme

open access: yesMathematical and Computer Modelling, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Jonathan Jen-Rong, Liu, Yuanchi
openaire   +1 more source

ID-based group signature

open access: yesElectronics Letters, 1997
The authors present an ID-based group signature which is based on ordinary ID-based signature schemes such as Ohta-Okamoto's scheme and Guillou-Quisquater's scheme. Thus, the group signature is verified from the identities of group members. A signer proves that, by verifiable encryption of his ordinary signature, a group authority can identify him and,
null Park, null Kim, null Won
openaire   +1 more source

Linkable Democratic Group Signatures [PDF]

open access: yes, 2006
In a variety of group-oriented applications cryptographic primitives like group signatures or ring signatures are valuable methods to achieve anonymity of group members. However, in their classical form, these schemes cannot be deployed for applications that simultaneously require (i) to avoid centralized management authority like group manager and (ii)
Mark Manulis   +2 more
openaire   +1 more source

Convertible Group Undeniable Signatures [PDF]

open access: yes, 2003
Group undeniable signatures are like ordinary group signatures except that verifying signatures needs the help of the group manager. In this paper, we propose a convertible group undeniable signature scheme in which the group manager can turn all or selective signatures, which are originally group undeniable signatures, into ordinary group signatures ...
Lyuu, Yuh-Dauh, Wu, Ming-Luen
openaire   +1 more source

Foundations of Fully Dynamic Group Signatures [PDF]

open access: yesJournal of Cryptology, 2016
AbstractGroup signatures allow members of a group to anonymously sign on behalf of the group. Membership is administered by a designated group manager. The group manager can also reveal the identity of a signer if and when needed to enforce accountability and deter abuse.
Bootle J   +4 more
openaire   +5 more sources

Group Signature Schemes Using Braid Groups

open access: yes, 2006
Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first group signature schemes based on the conjugacy problem, decomposition problem and root problem in the braid groups which are believed to be hard problems.
Thomas, Tony, Lal, Arbind Kumar
openaire   +2 more sources

Home - About - Disclaimer - Privacy