11 search results - page 2 / 3 » Robust Non-interactive Zero Knowledge |
FOCS
2003
IEEE
14 years 27 days 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 Ü ...
IACR
2011
12 years 7 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 11 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...
JCP
2008
13 years 7 months ago
2008
In order to implement both the efficiency and security in the Peer-to-Peer (P2P) network, we design a trusted small world overlay P2P network with the role based and reputation bas...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
A timestamping scheme is non-interactive if a stamper can stamp a document without communicating with any other player. The only communication done is at validation time. Non-Inte...