268 search results - page 23 / 54 » An Analysis of Bitstate Hashing |
CORR
2006
Springer
13 years 9 months ago
2006
Springer
An efficient archive securing the integrity of VoIP-based two-party conversations is presented. The solution is based on chains of hashes and continuously chained electronic signa...
ICLP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
IEEEARES
2006
IEEE
14 years 3 months ago
2006
IEEE
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
JNW
2006
13 years 9 months ago
2006
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...