659 search results - page 89 / 132 » Compiling and securing cryptographic protocols |
SP
1989
IEEE
15 years 6 months ago
1989
IEEE
Routing mechanisms for inter-autonomousregion communication require distribution of policy-sensitive information as well as algorithms that operate on such information. Without su...
112
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
145
Voted
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
115
click to vote
PET
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Webs of trust constitute a decentralized infrastructure for establishing the authenticity of the binding between public keys and users and, more generally, trust relation...
CCS
2008
ACM
15 years 4 months ago
2008
ACM
To protect against replay attacks, many Internet protocols rely on nonces to guarantee freshness. In practice, the server generates these nonces during the initial handshake, but ...