117 search results - page 7 / 24 » Short Group Signature Without Random Oracles |
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
ISPEC
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
ASIACRYPT
2004
Springer
14 years 24 days ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di�...
ACNS
2010
Springer
13 years 10 months ago
2010
Springer
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...