Sciweavers

79 search results - page 3 / 16
» Fair Blind Signatures without Random Oracles
Sort
View
ASIACRYPT
2007
Springer
13 years 11 months ago
Fully Anonymous Group Signatures Without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
Jens Groth
CIS
2005
Springer
13 years 10 months ago
ID-Based Restrictive Partially Blind Signatures
Restrictive blind signatures allow a recipient to receive a blind signature on a message not known to the signer but the choice of message is restricted and must conform to certain...
Xiaofeng Chen, Fangguo Zhang, Shengli Liu
EUROCRYPT
2006
Springer
13 years 9 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
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
13 years 9 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
13 years 11 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup