713 search results - page 63 / 143 » Dispersing Hash Functions |
CRYPTO
2012
Springer
13 years 6 days ago
2012
Springer
Liskov, Rivest and Wagner formalized the tweakable blockcipher (TBC) primitive at CRYPTO’02. The typical recipe for instantiating a TBC is to start with a blockcipher, and then b...
PKC
2012
Springer
13 years 5 days ago
2012
Springer
We define a new notion of relatively-sound non-interactive zeroknowledge (NIZK) proofs, where a private verifier with access to a trapdoor continues to be sound even when the Ad...
74
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
CCR
2004
14 years 9 months ago
2004
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Fast retrieval methods are critical for large-scale and
data-driven vision applications. Recent work has explored
ways to embed high-dimensional features or complex distance
fun...