224 search results - page 12 / 45 » Isolated Proofs of Knowledge and Isolated Zero Knowledge |
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...
FOCS
2002
IEEE
14 years 18 days ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
SIAMCOMP
2008
13 years 6 months ago
2008
We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean ...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
EMSOFT
2010
Springer
13 years 5 months ago
2010
Springer
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...