Sciweavers

17 search results - page 2 / 4
» Efficient Group Signatures without Trapdoors
Sort
View
EUROCRYPT
2006
Springer
13 years 8 months ago
Compact Group Signatures Without Random Oracles
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
Xavier Boyen, Brent Waters
IACR
2011
173views more  IACR 2011»
12 years 4 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
IJNSEC
2008
129views more  IJNSEC 2008»
13 years 5 months ago
Repairing Efficient Threshold Group Signature Scheme
To enhance the efficiency of threshold group signature schemes, Yu and Chen, recently, proposed an efficient threshold group signature scheme. By using elliptic curves, the propos...
Zuhua Shao
EUROCRYPT
2003
Springer
13 years 10 months ago
Extracting Group Signatures from Traitor Tracing Schemes
Abstract. Digital Signatures emerge naturally from Public-Key Encryption based on trapdoor permutations, and the “duality” of the two primitives was noted as early as Diffie-He...
Aggelos Kiayias, Moti Yung
ISW
2005
Springer
13 years 10 months ago
Tracing-by-Linking Group Signatures
In a group signature [19], any group member can sign on behalf of the group while remaining anonymous, but its identity can be traced in an future dispute investigation. Essentiall...
Victor K. Wei