37 search results - page 6 / 8 » Optimistic Concurrent Zero Knowledge |
TAMC
2007
Springer
14 years 3 months 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
14 years 3 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...
FUIN
2007
13 years 9 months ago
2007
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
PPOPP
2010
ACM
14 years 7 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
MOBIDE
2009
ACM
14 years 2 months ago
2009
ACM
Optimistic replication is a fundamental technique for supporting concurrent work practices in mobile environments. However, due to sudden and frequent transitions to weakly connec...