Sciweavers

144 search results - page 2 / 29
» Signature Schemes Based on Two Hard Problems Simultaneously
Sort
View
ASIACRYPT
2009
Springer
13 years 12 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky
FC
2005
Springer
171views Cryptology» more  FC 2005»
13 years 10 months ago
Identity-Based Partial Message Recovery Signatures (or How to Shorten ID-Based Signatures)
Abstract. We firstly proposed a new notion of short identity-based signature scheme. We argue that the identity-based environment is essential in some scenarios. The notion of sho...
Fangguo Zhang, Willy Susilo, Yi Mu
ISPEC
2005
Springer
13 years 10 months ago
Short Linkable Ring Signatures for E-Voting, E-Cash and Attestation
Abstract. A ring signature scheme can be viewed as a group signature scheme with no anonymity revocation and with simple group setup. A linkable ring signature (LRS) scheme additio...
Patrick P. Tsang, Victor K. Wei
IJNSEC
2010
127views more  IJNSEC 2010»
13 years 3 days ago
Identity-based Threshold Signature Secure in the Standard Model
Recently, design of Identity-based (ID-based) threshold signature schemes which are efficient and provably secure in the standard model has drawn great concerns. In this paper, an...
Hu Xiong, Zhiguang Qin, Fagen Li
TCS
2008
13 years 5 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven