Sciweavers

4111 search results - page 682 / 823
» Security, Protocols, and Trust
Sort
View
ICDCS
2005
IEEE
16 years 22 days 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
209
Voted
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
16 years 19 days 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
159
Voted
EUROPKI
2005
Springer
16 years 19 days 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
16 years 19 days 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...
SAC
2004
ACM
16 years 16 days ago
Protected transmission of biometric user authentication data for oncard-matching
Since fingerprint data are no secrets but of public nature, the verification data transmitted to a smartcard for oncardmatching need protection by appropriate means in order to ...
Ulrich Waldmann, Dirk Scheuermann, Claudia Eckert