Sciweavers

162 search results - page 2 / 33
» A Group Signature Scheme from Lattice Assumptions
Sort
View
ASIACRYPT
2004
Springer
13 years 9 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
13 years 10 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
IJNSEC
2011
143views more  IJNSEC 2011»
13 years 8 days ago
Probable Security Proof of A Blind Signature Scheme over Braid Groups
In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive ...
Girraj Kumar Verma
LATINCRYPT
2010
13 years 3 months ago
A Lattice-Based Threshold Ring Signature Scheme
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as securi...
Pierre-Louis Cayrel, Richard Lindner, Markus R&uum...
IJNSEC
2006
122views more  IJNSEC 2006»
13 years 5 months ago
A Directed Signature Scheme Based on RSA Assumption
A directed signature scheme allows a designated verifier to directly verify a signature issued to him, and a third party to check the signature validity with the help of the signe...
Rongxing Lu, Zhenfu Cao