Sciweavers

3504 search results - page 539 / 701
» Secure protocol composition
Sort
View
EEE
2005
IEEE
15 years 7 months ago
Who Counts Your Votes?
Open and fair elections are paramount to modern democracy. Although some people claim that the penciland-paper systems used in countries such as Canada and UK are still the best m...
Halina Kaminski, Lila Kari, Mark Perry
ICDCS
2005
IEEE
15 years 7 months ago
Equational Approach to Formal Analysis of TLS
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...
Kazuhiro Ogata, Kokichi Futatsugi
137
Voted
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
15 years 7 months ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
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 ...
Stefan Wolf, Jürg Wullschleger
EUROPKI
2005
Springer
15 years 7 months ago
Recoverable and Untraceable E-Cash
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 ...
Joseph K. Liu, Patrick P. Tsang, Duncan S. Wong
ICALP
2005
Springer
15 years 7 months ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
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...
Mathieu Baudet, Véronique Cortier, Steve Kr...