32 search results - page 6 / 7 » Concurrent Non-Malleable Zero Knowledge |
TAMC
2007
Springer
14 years 11 days ago
2007
Springer
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
ASIACRYPT
2004
Springer
13 years 11 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...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
INFOCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
—Physical layer techniques have come a long way and can achieve close to Shannon capacity for single pointto-point transmissions. It is apparent that, to further improve network ...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...