12 search results - page 3 / 3 » Short Non-interactive Zero-Knowledge Proofs |
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
EUROCRYPT
2006
Springer
13 years 8 months ago
2006
Springer
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...