13 search results - page 2 / 3 » Impossibility and Feasibility Results for Zero Knowledge wit... |
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
SSS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Given a public-key infrastructure (PKI) and digital signatures, it is possible to construct broadcast protocols tolerating any number of corrupted parties. Almost all exi...
ASIACRYPT
2004
Springer
14 years 26 days 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...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, howe...