3115 search results - page 475 / 623 » Synthesizing Secure Protocols |
148
click to vote
ICDCS
2005
IEEE
15 years 11 months ago
2005
IEEE
TLS has been formally analyzed with the OTS/CafeOBJ method. In the method, distributed systems are modeled as transition systems, which are written in terms of equations, and it i...
179
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
130
click to vote
EUROPKI
2005
Springer
15 years 11 months ago
2005
Springer
In an electronic cash (e-cash) system, Recoverability means once you have lost your e-cash, you still can get back the amount of e-cash that you have lost. Untraceability means no ...
137
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
171
click to vote
TRUSTBUS
2005
Springer
15 years 11 months ago
2005
Springer
There is a broad literature on distributed card games over communications networks, collectively known as mental poker. Like in any distributed protocol, avoiding the need for a Tr...