20 search results - page 2 / 4 » On Defining Proofs of Knowledge in the Bare Public Key Model |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
CCS
2006
ACM
13 years 8 months ago
2006
ACM
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. However, existing schemes impose key s...