5324 search results - page 435 / 1065 » Internet Security Protocols |
163
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
185
click to vote
CSFW
2009
IEEE
15 years 10 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
176
click to vote
FROCOS
2007
Springer
16 years 1 months ago
2007
Springer
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
196
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
177
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
Abstract. In the field of Security, process equivalences have been used to characterize various information-hiding properties (for instance secrecy, anonymity and non-interference)...