58 search results - page 9 / 12 » How to Round Any CSP |
128
click to vote
SP
2009
IEEE
16 years 13 days ago
2009
IEEE
In this paper, we study the degree to which a genomic string, Q, leaks details about itself any time it engages in comparison protocols with a genomic querier, Bob, even if those ...
141
click to vote
ASIACRYPT
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper we combine a recent rotational cryptanalysis with the rebound attack, which results in the best cryptanalysis of Skein, a candidate for the SHA-3 competitio...
199
click to vote
CSFW
2002
IEEE
15 years 10 months ago
2002
IEEE
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
162
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Secret handshakes were recently introduced [BDS+ 03] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member ca...
158
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...