9 search results - page 2 / 2 » Pairing-Based Non-interactive Zero-Knowledge Proofs |
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
IACR
2011
12 years 4 months ago
2011
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
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...