2967 search results - page 292 / 594 » Cryptology |
148
click to vote
CRYPTO
2007
Springer
16 years 28 days ago
2007
Springer
The common random string model introduced by Blum, Feldman and Micali permits the construction of cryptographic protocols that are provably impossible to realize in the standard m...
154
click to vote
CRYPTO
2007
Springer
16 years 28 days ago
2007
Springer
At Crypto ’06, Bellare presented new security proofs for HMAC and NMAC, under the assumption that the underlying compression function is a pseudo-random function family. Converse...
191
click to vote
FC
2007
Springer
16 years 28 days ago
2007
Springer
Onion routing is a scheme for anonymous communication that is designed for practical use. Until now, however, it has had no formal model and therefore no rigorous analysis of its a...
157
click to vote
PAIRING
2007
Springer
16 years 27 days ago
2007
Springer
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptograph...
160
click to vote
TCC
2007
Springer
16 years 26 days ago
2007
Springer
We construct public-key systems that support comparison queries (x ≥ a) on encrypted data as well as more general queries such as subset queries (x ∈ S). These systems support...